Answer Posted / guest

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

Explain the refresh operation in a dynamic ram?

1256

---

How much ram do I need laptop?

1063

---

Explain the Difference between Process and a Thread.

1106

---

Explain the concept of the multi-processor systems or parallel systems?

1064

---

Will chkdsk repair corrupt files?

1045

---

Define paging and deadlock.

1256

---

How do I know if my hardware supports 64 bit?

973

---

Is 32 gigs of ram overkill?

1001

---

What resources are used when a thread created?

1059

---

For a deadlock to occur what are the necessary conditions

1126

---

What does the safe mode do?

1019

---

Who is the father of os?

1162

---

What is the difference between af_inet and pf_inet?

1001

---

What is the real-time system?

1085

---

Explain the execution cycle for a von neumann architecture.

1057

---