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.

What is the meaning of Thread Priority?

1054

---

What is the purpose of system programs?

1029

---

How the Kernel handles both the page stealer and the fault handler?

995

---

What is synchronization? What are the different synchronization mechanisms?

983

---

How do you start a startup?

910

---

Explain migration process?

928

---

Can I move programs from c drive to d?

862

---

Is x86 better than x64?

862

---

What is throughput?

982

---

How you can Kill the Session by force?

993

---

How do I search for a pattern in vi?

856

---

For a deadlock to occur what are the necessary conditions

996

---

What is normal operating system?

964

---

Explain binary semaphore and its functionality.

960

---

what is difference between xp & 2003?

1939

---