Most scheduling algorithms maintain a run queue, which lists processes eligible to run on a processor. On multicore systems, there are two general options: (1) each processing core has its own run queue, or (2) a single run queue is shared by all processing cores. What are the advantages and disadvantages of each of these approaches?

Most scheduling algorithms maintain a run queue, which lists processes eligible to run on a processor. On multicore systems, there are two general options: (1) each processing core has its own run queue, or (2) a single run queue is shared by all processing cores. What are the advantages and disadvantages of each of these approaches?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 23VE

See similar textbooks

Similar questions

Process Scheduling Multiprocessor systems use multiple CPUs to perform various tasks. This increases throughput and reduces response time. In this problem, a multiprocessor system has a certain number of processors. Each processor has the ability to schedule a limited number of processes in one second. However, after this scheduling, the processor's ability is reduced to floor(ability/2). Given the processor's abilities and the number of processes, what is the minimum time required to schedule all the processes in the system? Example n = 5 (number of processors and size of ability[]) ability = 13, 1, 7, 2, 4] processes = 15 This optimal solution is: 1. First, the processor with ability = 7 schedules 7 processes in one second. Now, ability = (3, 1, 3, 2, 4] because 7 was reduced to floor(7/2). There are 15 - 7 = 8 remaining processes. 2. Second, the processor with ability = 4 is used. After that, ability = [3, 1, 3, 2, 2). Remaining processes = 8 - 4= 4.
Most scheduling algorithms maintain a run queue,which lists processes eligible to run on a processor. On multicore systems, there are two general options: (1) each processing core has its own run queue, or (2) a single run queue is shared by all processing cores. What are the advantages and disadvantages of each of these approaches?
Real-Time Scheduling You are part of a group working on a project to devise useful benchmark applications or task sets for testing real-time scheduling schemes. Your group will need to defend that your applications exhibit a range of interesting behaviours. And devise benchmarks for both uniprocessor and multiprocessor systems, for both hard and soft real-time systems, and for systems that also may have non-real-time components. It would be especially interesting to know what a "typical" range would be for execution costs on modern processors. Determining this would involve looking at and thinking about some real applications. Question Discuss the classes of real-time scheduling algorithms that the group can choose from for the project.
Real-Time Scheduling You are part of a group working on a project to devise useful benchmark applications or task sets for testing real-time scheduling schemes. Your group will need to defend that your applications exhibit a range of interesting behaviours. And devise benchmarks for both uniprocessor and multiprocessor systems, for both hard and soft real-time systems, and for systems that also may have non-real-time components. It would be especially interesting to know what a "typical" range would be for execution costs on modern processors. Determining this would involve looking at and thinking about some real applications. Question Discuss the concept of deadline scheduling and briefly define the set of information required for deadline scheduling of a task.
Real-Time Scheduling You are part of a group working on a project to devise useful benchmark applications or task sets for testing real-time scheduling schemes. Your group will need to defend that your applications exhibit a range of interesting behaviours. And devise benchmarks for both uniprocessor and multiprocessor systems, for both hard and soft real-time systems, and for systems that also may have non-real-time components. It would be especially interesting to know what a "typical" range would be for execution costs on modern processors. Determining this would involve looking at and thinking about some real applications. Question As a member of the group working on this project, list and briefly explain the general characteristics of a real-time operating system.
The scheduling of threads and processes may be compared to see the similarities and differences.
The scheduling of processes and threads should be examined and contrasted.
Briefly describe what process starvation in priority scheduling entails and how to avoid it.
SFJ Process Suppose we have a four (4) core processor and all processes are designed to be multi-threaded. Now, like all processors with more than one core, they have the ability to perform multiple tasks at the same time. If there are four (4) with the following CPU and I/O cycles according to the table below, calculate the times for the SJF scheduling process (view image): Where A,B,C,D correspond to A=6, B=3, C=5, D=8.
There has to be a comparison and contrast between process scheduling and thread scheduling.
One way to accomplish this is to examine how thread scheduling compares to process scheduling.
Explain the concept of dynamic scheduling in superscalar processors and its impact on performance.