Multiprocessor thread-scheduling strategies
Describe the well-liked multiprocessor thread-scheduling strategies?
Expert
Load Sharing: Processes are not assigned to a specific processor. A global queue of threads is sustained. Each and every processor, when idle, chooses a thread from this queue. Note that load balancing signify to a scheme where work is assigned to processors on a more permanent basis.
Gang scheduling: The setup of related threads is scheduled to run on a setup of processors at the equal time, on a one-to-one basis. Closely related threads or processes might be scheduled this manner to reduce synchronization blocking, and reduce process switching. Group scheduling predated this policy.
Dedicated processor assignment: offers implicit scheduling defined by assignment of threads to processors. For the period of program execution, each and every program is allocated a setup of processors equivalent in number to the number of threads in the program. Processors are selected from the available pool.
Dynamic scheduling: There are many thread in a program which can be changed through the course of execution.
Explain some of the disadvantages of the linked allocation?
Explain the term TP Monitor?
Briefly explain about the term synchronization? And as well write down the various synchronization methods?
Write down the main reasons for process suspension?
What do you mean by the term arm-stickiness? Illustrate in brief.
Illustrate the basic difference between the normal LAN cable and cross cable? What could be the utmost length of the LAN cable?
Specify the various operations which may be carried out upon the process.
Briefly explain the Distinguish between physical and logical address?
Write about the term Memory Compaction.
Explain different types of operating systems?
18,76,764
1924177 Asked
3,689
Active Tutors
1453310
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!