Questions

This can be done in two ways

1. A to G : 2, 3, 7, 6, 5, 1, 4 

2. A to G : 4, 3, 7, 5, 6, 2, 1

1. 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. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis.


2. 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.


3. 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.


4. Dynamic scheduling: The number of thread in a program can be altered during the course of execution.

Kaustubham

YEAR - 1 E

WEEK - 2 E

DAY - 0 E

Hence, the letter 'E', comes once in a year, twice in a week and never in a day.