PPT-Chapter 5: CPU Scheduling

Chapter 5 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling MultipleProcessor Scheduling Operating Systems Examples Algorithm Evaluation Objectives. Avg Access Time 2 Tokens Number of Controllers Average Access Time clock cyles brPage 16br Number of Tokens vs Avg Access Time 9 Controllers Number of Tokens Average Access Time clock cycles brPage 17br brPage 18br 1 CPU scheduling algorithm determines an order for the execution of its scheduled processes Given processes to be scheduled on one processor how many different schedules are possible Give a formula in terms of n Answer n factorial 1 2 1 62 Exp Reading. Silberschatz. et al: Chapters 5.2, 5,3, 5.4. When to Schedule. Required on these occasions:. When a process exits. When a process blocks on I/O or a semaphore (more on this later). When a new process is created. -Ashish Singh. Introduction. History and Background. Linux Scheduling. Modification in Linux Scheduling. Results. Conclusion. References. Questions. History and Background. In 1991 Linus Torvalds took a college computer science course that used the Minix operating system. Suli Yang, Tyler Harter, . Nishant. . Agrawal. , . Samer. Al-. Kiswany. , . Salini. . Selvaraj. . Kowsalya. ,. . Anand. Krishnamurthy, . Rini. T . Kaushik. , . Andrea C. . Arpaci-Dusseau. , . Remzi. CS 3100 CPU Scheduling. 1. Objectives. To introduce CPU scheduling, which is the basis for . multiprogrammed. operating systems. To describe various CPU-scheduling algorithms. To discuss evaluation criteria for selecting a CPU-scheduling algorithm for a particular system. CS . 355. Operating Systems. Dr. Matthew Wright. Operating System Concepts. chapter 5. Basic Concepts. Process execution consists of a . cycle. of CPU execution and I/O . wait.. Typical CPU Burst Distribution. Bulk-synchronous Programming Models on. CPU Architectures. Hee-Seok. Kim. , . Izzat. El Hajj, John Stratton,. Steven . Lumetta. and . Wen-mei. . Hwu. CPU. (Intel, AMD, PowerPC). GPU. (NVIDIA, AMD, Imagination, ARM). 1. 5.1 Basic Concepts. The goal of multi-programming is to maximize the utilization of the CPU as a system resource by having a process running on it at all times. Supporting multi-programming means encoding the ability in the O/S to switch between currently running jobs. BYU CS 345. Disc Scheduling. 2. CS 345. Stalling’s Chapter. #. Project. 1: Computer System Overview. 2: Operating System Overview. 4. P1:. Shell. 3: Process Description and Control. 4: Threads. 4. OPERATING SYSTEMS. SCHEDULING. 5: CPU-Scheduling. 2. What Is In This Chapter?. This chapter is about how to get a process attached to a processor.. It centers around efficient algorithms that perform well.. Seventh Edition. By William Stallings. Dave Bremer. Otago Polytechnic, N.Z.. ©2008, Prentice Hall. Operating Systems:. Internals and Design Principles. Operating Systems:. Internals and Design Principles. for High-End CPU-GPU Architectures. Vignesh. Ravi. Dept. of Computer Science and Engineering. Advisor: . Gagan. . Agrawal. 1. The Death of Single-core CPU Scaling. 2. The Landscape of Computing – Moore’s Law. Chapter 6: CPU Scheduling. Basic Concepts. Scheduling Criteria . Scheduling Algorithms. Thread Scheduling. Multiple-Processor Scheduling. Real-Time CPU Scheduling . (Skip). Operating Systems Examples.