Questions

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.

The smallest unit of data storage in a computer is called Bit (Binary Digit). Half a byte (four bits) is called a Nibble.

1 bit (binary digit) = the value of 0 or 1

8 bits = 1 byte

1024 bytes = 1 kilobyte

1024 kilobytes = 1 megabyte

1024 megabytes = 1 gigabyte

1024 gigabytes = 1 terabyte

1024 terabytes = 1 petabyte

Hence, Computer storage units smallest to largest i.e, in ascending order is

 1 bit  <  1 byte  <  1 KB  <  1 MB  <  1 GB  <  1TB  <  1 PB.

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