Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue.
Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.
Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.
Dynamic scheduling: The number of thread in a program can be altered during the course of execution.
Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue.Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.Dynamic scheduling: The number of thread in a program can be altered during the course of execution.
interrupt
When a particular thread has many dependent thread, and that particular thread is terminated, then all the threads that depends on that terminated thread will no longer belong to something and they will certainly mislead to their each functions. This is what it call orphan thread.
multiprocessor and multicomputer
uniprocessor : - A type of architecture that is based on a single computing unit. All operations ( additions, multiplications, etc ) are done sequentally on the unit. . multiprocessor : - A type of architecture that is based on multiple computing units. Some of the operations ( not all, mind you ) are done in parallel and the results are joined afterwards.
Nai-Fung Chen has written: 'An analysis of scheduling algorithms in multiprocessor computing systems' -- subject(s): Computer programming, Critical path analysis, Multiprocessors
•No special support needed from the kernel (use any Unix) •Thread creation and context switch are fast (no syscall) •Defines its own thread model and scheduling policies
The CPU scheduler is the part of the Operating System that determines when to allow each thread to execute. Usually this is done by seeing if all the wait conditions, such as IO wait, timer wait, semaphore wait, etc. have been cleared, and if the thread priority or round-robin turn criteria have been met.
difference b/w thread based and use based testing
for improving the efficiency of the computer system.In multiprocessor environment , instructions can be executed parallely.
media planning is the process of formulating strategies and selecting the appropriate media vehicle that can be use to reach the target audience.
Multiprocessor systems have gained popularity over the years as they allow the user to do more than they could with a single processor system. Xbox 360, CELL, and Sequent are examples of multiprocessor systems.