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 major problems for implementing the demand paging?
What do you mean by the term arm-stickiness? Illustrate in brief.
Illustrate the term DOMAIN? Write down the difference between the domain and a workgroup?
Illustrate the term Asymmetric Multiprocessing.
What do you understand by the Hard Real time systems and soft real time system?
What has triggered is necessitate for multitasking in Personal computer?
What is the Translation Lookaside Buffer (or TLB)?
Explain two data items which is used within the petersons solution?
Write down a brief note on cycle stealing?
Illustrate the difference between firewall and proxy server.
18,76,764
1947563 Asked
3,689
Active Tutors
1436725
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!