| 0 | 342.6 KB | ||
| 001 Introduction, Basics, Memory Structure.mp4 | 330.8 MB | ||
| 001 Introduction_en.vtt | 6.2 KB | ||
| 001 Scheduling Algorithms Introduction, Basic Terminologies.mp4 | 291.6 MB | ||
| 1 | 770.5 KB | ||
| 001 Introduction, Basics, Memory Structure_en.vtt | 17.8 KB | ||
| 001 Introduction, Definitions.mp4 | 162.1 MB | ||
| 001 Introduction, Definitions_en.vtt | 10.4 KB | ||
| 001 Introduction.mp4 | 75.1 MB | ||
| 001 Scheduling Algorithms Introduction, Basic Terminologies_en.vtt | 14.7 KB | ||
| 2 | 457.5 KB | ||
| 002 First Come First Serve (FCFS) Introduction , Example.mp4 | 366.2 MB | ||
| 002 First Come First Serve (FCFS) Introduction , Example_en.vtt | 18.6 KB | ||
| 002 Memory Specification Words, Bytes, Bits.mp4 | 170.6 MB | ||
| 002 Memory Specification Words, Bytes, Bits_en.vtt | 7.8 KB | ||
| 002 Necessary Conditions for Occurring deadlock.mp4 | 51.4 MB | ||
| 002 Necessary Conditions for Occurring deadlock_en.vtt | 5.3 KB | ||
| 002 Producer Consumer Problem with busy waiting.mp4 | 241.2 MB | ||
| 002 Producer Consumer Problem with busy waiting_en.vtt | 19.9 KB | ||
| 003 First Come First Serve (FCFS) Example.mp4 | 230.2 MB | ||
| 003 First Come First Serve (FCFS) Example_en.vtt | 11.3 KB | ||
| 003 Producer Consumer Problem - Lack of Synchronization.mp4 | 83.5 MB | ||
| 003 Producer Consumer Problem - Lack of Synchronization_en.vtt | 12.7 KB | ||
| 003 RAM Chip Organization_en.vtt | 10.1 KB | ||
| 003 Resource Allocation Graph(RAG)_en.vtt | 11 KB | ||
| 3 | 966.6 KB | ||
| 003 RAM Chip Organization.mp4 | 193.1 MB | ||
| 003 Resource Allocation Graph(RAG).mp4 | 62.6 MB | ||
| 004 Creating Big memory with small size memory chips.mp4 | 253.4 MB | ||
| 004 Creating Big memory with small size memory chips_en.vtt | 12 KB | ||
| 4 | 187.2 KB | ||
| 004 Producer Consumer Problem Without busy waiting - Blocking (Sleeping).mp4 | 81.8 MB | ||
| 004 Producer Consumer Problem Without busy waiting - Blocking (Sleeping)_en.vtt | 9 KB | ||
| 004 Shortest Job First Scheduling Algorithm.mp4 | 259.5 MB | ||
| 004 Shortest Job First Scheduling Algorithm_en.vtt | 12.8 KB | ||
| 004 Strategies for Deadlock Handling.mp4 | 62.3 MB | ||
| 004 Strategies for Deadlock Handling_en.vtt | 6.6 KB | ||
| 005 Deadlock Prevention Breaking one of necessary Conditions.mp4 | 128.7 MB | ||
| 005 Deadlock Prevention Breaking one of necessary Conditions_en.vtt | 12 KB | ||
| 005 Examples Building Bigger memory with small size chips.mp4 | 338.1 MB | ||
| 005 Examples Building Bigger memory with small size chips_en.vtt | 16.8 KB | ||
| 005 Shortest Remaining Time First Scheduling Algorithm.mp4 | 341.6 MB | ||
| 005 Shortest Remaining Time First Scheduling Algorithm_en.vtt | 16.6 KB | ||
| 005 Terminologies Critical Section, Race Condition, Pre-emption, Mutual Exclusion.mp4 | 54.7 MB | ||
| 005 Terminologies Critical Section, Race Condition, Pre-emption, Mutual Exclusion_en.vtt | 5 KB | ||
| 5 | 423.7 KB | ||
| 006 Deadlock Avoidance Introduction.mp4 | 50.4 MB | ||
| 006 Deadlock Avoidance Introduction_en.vtt | 5.3 KB | ||
| 006 Memory Manager Functions and Goals.mp4 | 203.9 MB | ||
| 006 Memory Manager Functions and Goals_en.vtt | 10.2 KB | ||
| 006 Priority Based Scheduling Algorithms Non-Preemptive.mp4 | 252.7 MB | ||
| 006 Priority Based Scheduling Algorithms Non-Preemptive_en.vtt | 12.6 KB | ||
| 006 Requirements of Synchronization.mp4 | 107.6 MB | ||
| 006 Requirements of Synchronization_en.vtt | 7.9 KB | ||
| 6 | 372.2 KB | ||
| 007 Deadlock Avoidance Bankers Algorithm.mp4 | 119.3 MB | ||
| 007 Deadlock Avoidance Bankers Algorithm_en.vtt | 12.1 KB | ||
| 007 Memory management Techniques Contiguous and Non-Contiguous memory.mp4 | 113.2 MB | ||
| 007 Memory management Techniques Contiguous and Non-Contiguous memory_en.vtt | 5.6 KB | ||
| 007 Priority Based Scheduling Algorithms Preemptive_en.vtt | 13 KB | ||
| 007 Synchronization Mechanism 1 Desabling Interrupts.mp4 | 66.7 MB | ||
| 007 Synchronization Mechanism 1 Desabling Interrupts_en.vtt | 5.6 KB | ||
| 7 | 816.8 KB | ||
| 007 Priority Based Scheduling Algorithms Preemptive.mp4 | 262.6 MB | ||
| 008 Contiguous Memory Allocation Overlays.mp4 | 126.2 MB | ||
| 008 Contiguous Memory Allocation Overlays_en.vtt | 5.8 KB | ||
| 008 Deadlock Avoidance Bankers Algorithm - Single Instance - Example_en.vtt | 11 KB | ||
| 8 | 456.5 KB | ||
| 008 Deadlock Avoidance Bankers Algorithm - Single Instance - Example.mp4 | 100.2 MB | ||
| 008 Highest Response Ration Next Scheduling Algorithm.mp4 | 280.2 MB | ||
| 008 Highest Response Ration Next Scheduling Algorithm_en.vtt | 14.3 KB | ||
| 008 Synchronization Mechanism 2 Lock Variable.mp4 | 182.1 MB | ||
| 008 Synchronization Mechanism 2 Lock Variable_en.vtt | 15.3 KB | ||
| 009 Deadlock Avoidance Bankers Algorithm - Multiple Instance - Example.mp4 | 145.4 MB | ||
| 009 Deadlock Avoidance Bankers Algorithm - Multiple Instance - Example_en.vtt | 15.1 KB | ||
| 009 Non-Contiguous Memory Allocation Introduction.mp4 | 83.7 MB | ||
| 009 Non-Contiguous Memory Allocation Introduction_en.vtt | 4.2 KB | ||
| 9 | 537.7 KB | ||
| 009 Round Robin Scheduling Algorithm.mp4 | 424.1 MB | ||
| 009 Round Robin Scheduling Algorithm_en.vtt | 21.7 KB | ||
| 009 Synchronization Mechanism 3 Strict Alternation.mp4 | 124.3 MB | ||
| 009 Synchronization Mechanism 3 Strict Alternation_en.vtt | 10.6 KB | ||
| 10 | 606.6 KB | ||
| 010 Physical Address Space (PAS) and Logical Address Space (LAS).mp4 | 195.5 MB | ||
| 010 Physical Address Space (PAS) and Logical Address Space (LAS)_en.vtt | 10.3 KB | ||
| 010 Semaphores Introduction Counting Semaphores and Counting Semaphores.mp4 | 57.6 MB | ||
| 010 Semaphores Introduction Counting Semaphores and Counting Semaphores_en.vtt | 5 KB | ||
| 011 Architecture PAS, LAS, LA and PA.mp4 | 125.1 MB | ||
| 011 Architecture PAS, LAS, LA and PA_en.vtt | 6.3 KB | ||
| 011 Counting Semaphores Down() and Up().mp4 | 75.3 MB | ||
| 011 Counting Semaphores Down() and Up()_en.vtt | 11.8 KB | ||
| 11 | 281.7 KB | ||
| 012 Binary Semaphores Down() and Up().mp4 | 125.1 MB | ||
| 012 Binary Semaphores Down() and Up()_en.vtt | 12 KB | ||
| 012 Paging Organization of Logical Address Space.mp4 | 225 MB | ||
| 12 | 783 KB | ||
| 012 Paging Organization of Logical Address Space_en.vtt | 11 KB | ||
| 013 Four cases of Binary Semaphores_en.vtt | 5.2 KB | ||
| 13 | 799 KB | ||
| 013 Four cases of Binary Semaphores.mp4 | 48.7 MB | ||
| 013 Paging Organization of Physical Address Space.mp4 | 169.7 MB | ||
| 013 Paging Organization of Physical Address Space_en.vtt | 9.3 KB | ||
| 014 Paging Organization fo MMU - Page Table_en.vtt | 7.8 KB | ||
| 14 | 973.5 KB | ||
| 014 Paging Organization fo MMU - Page Table.mp4 | 158.5 MB | ||
| 014 Producer Consumer Problem with Semaphores.mp4 | 187.1 MB | ||
| 014 Producer Consumer Problem with Semaphores_en.vtt | 19.2 KB | ||
| 015 Paging Address Translation - Logical Address to Physical Address_en.vtt | 6.2 KB | ||
| 15 | 97 KB | ||
| 015 Paging Address Translation - Logical Address to Physical Address.mp4 | 122.3 MB | ||
| 015 Readers - Writers Problem with Semaphore.mp4 | 154 MB | ||
| 015 Readers - Writers Problem with Semaphore_en.vtt | 18.1 KB | ||
| 16 | 474.5 KB | ||
| 016 Paging Numerical Problem 1.mp4 | 154.8 MB | ||
| 016 Paging Numerical Problem 1_en.vtt | 7.6 KB | ||
| 017 Paging Numerical Problem 2.mp4 | 129.8 MB | ||
| 017 Paging Numerical Problem 2_en.vtt | 5.9 KB | ||
| 17 | 892.3 KB | ||
| 018 Performance of paging.mp4 | 117.5 MB | ||
| 018 Performance of paging_en.vtt | 5.7 KB | ||
| 18 | 971 KB | ||
| 019 Translation Look Ahead Buffer (TLB).mp4 | 319.6 MB | ||
| 019 Translation Look Ahead Buffer (TLB)_en.vtt | 14.7 KB | ||
| TutsNode.com.url | 102.4 B | ||
| [TGx]Downloaded from torrentgalaxy.to .txt | 614.4 B | ||
| 19 | 956.8 KB | ||
| 20 | 445 KB | ||
| 020 Optimal Page Size.mp4 | 58.5 MB | ||
| 020 Optimal Page Size_en.vtt | 12.7 KB | ||
| TutsNode.com.txt | 102.4 B | ||
| 21 | 269.7 KB | ||
| 021 Multilevel Paging.mp4 | 77.2 MB | ||
| 021 Multilevel Paging_en.vtt | 14.1 KB | ||
| 022 Multilevel Paging Performance with TLB.mp4 | 51.9 MB | ||
| 022 Multilevel Paging Performance with TLB_en.vtt | 8 KB | ||
| 22 | 873.2 KB | ||
| 23 | 536.8 KB | ||
| 24 | 182.1 KB | ||
| 25 | 9.2 KB | ||
| 26 | 565 KB | ||
| 27 | 242 KB | ||
| 28 | 264.9 KB | ||
| 29 | 822.2 KB | ||
| 30 | 921.8 KB | ||
| 31 | 935.5 KB | ||
| 32 | 708.6 KB | ||
| 33 | 728.9 KB | ||
| 34 | 730.1 KB | ||
| 35 | 550.7 KB | ||
| 36 | 849.7 KB | ||
| 37 | 438.8 KB | ||
| 38 | 808.2 KB | ||
| 39 | 346.7 KB | ||
| 40 | 473.9 KB | ||
| 41 | 190.6 KB | ||
| 42 | 772 KB | ||
| 43 | 748.9 KB | ||
| 44 | 937.6 KB | ||
| 45 | 355.5 KB | ||
| 46 | 400.6 KB | ||
| 47 | 767.7 KB | ||
| 48 | 557.1 KB | ||
| 49 | 365.2 KB | ||
| 50 | 345.1 KB | ||
| 51 | 86.8 KB | ||
| 52 | 651.8 KB | ||
| 53 | 630.5 KB | ||
| ▲ 167 total files | |||
Description
CPU Scheduling is a process of determining which process will own CPU for execution while another process is on hold. The main task of CPU scheduling is to make sure that whenever the CPU remains idle, the OS at least select one of the processes available in the ready queue for execution. The selection process will be carried out by the CPU scheduler. It selects one of the processes in memory that are ready for execution.
What you will Learn :
Scheduling Algorithms:
Non-Preemtitve Scheduling Algorithms:
First Come First Serve Scheduling algorithm.
Shortest Job First Scheduling algorithm.
Priority Based Scheduling algorithm.
Highest Response Ration First Scheduling algorithm.
Preemptive Scheduling Algorithms:
Shortest Remaining Time Scheduling algorithm.
Priority Based Scheduling algorithm.
Round Robin Scheduling algorithm.
InterProcess Communication (IPC) and Synchronization :
Synchronization Mechanisms
Counting Semaphores and Binary Semaphores
Producer – Consumer Problems
Readers – Writers Problem
Dining Philosophers Problem
Deadlocks :
Deadlock Prevention
Deadlock Avoidance
Deadlock Ignorance
Memory Management Unit :
Contiguous Memory
Non-contiguous memory
Paging
Multi-level Paging
Who this course is for:
Academic Students.
Interview Preparation Persons.
Competitive Exam Preparation Aspirants.
Those who want to become a highly paid coding developer.
Those who want to open up doors in your IT career by learning one of the world’s most popular and in-demand programming.
Important information before you enroll!
If you find the course is not useful for your career, no worry since it is free.
Once enrolled, you have unlimited, 24/7, lifetime access to the course.
You will have instant and free access to any updates I’ll add to the course – video lectures, additional resources, quizzes, exercises.
You will benefit from my full support regarding any question you might have 7 days a week.
Check out the promo video at the top of this page and some of the free preview lectures in the curriculum to get a taste of my teaching style and methods before making your decision.
———————————————————————————————————————————————————————————
ALL THE BEST FOR YOUR BRIGHT FUTURE.
Who this course is for:
Academic Students
For all
Requirements
NO
Last Updated 11/2021
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 1.1 GB | freecoursewb | 3 months | 14 | 1 | |
| 1.04 GB | Wilson36 | 1 year | 9 | 0 | |
| 14.9 GB | kosmous | 1 year | 4 | 0 | |
| 3.1 GB | freecoursewb | 2 years | 8 | 3 | |
| 4.5 GB | tutsnode | 3 years | 11 | 0 |
All Comments