As an Amazon Associate I earn from qualifying purchases.

What is Weak Semaphore in Operating System? PDF Download

Learn Weak Semaphore definition in operating system with explanation to study “What is Weak Semaphore”. Study weak semaphore explanation with operating system terms to review operating system course for online degree programs.

Weak Semaphore Definition:

  • A semaphore in which all processes waiting on the same semaphore proceed in an unspecified order.

    Operating Systems by William Stallings



Weak Semaphore Explanation:

A semaphore that doesn't specify order in which processes are removed from the queue is a weak semaphore. The main difference in strong and weak semaphore is as mentioned that a weak semaphore doesn't specify order while a strong semaphore specifies an order for removal of processes from the queue.

Keep Learning Operating System Explanations

What is Processor?

A processor is an integrated electronic circuit that performs the calculations that run a computer. A processor performs, input/output (IO), ...

What is Page Frame?

A page frame is the smallest fixed-length contagious block of physical memory into which pages are mapped by the operating ...

What is Reusable Resource?

A reusable resource is a resource that is not rendered useless by being used. For instance, a magnetic disk such ...

What is Symmetric Multiprocessing?

Symmetric multiprocessing is the processing of programs by multiple processors that share a common operating system and memory. The processors ...

What is Trap Door?

Trap door is a new jorgan for backdoor programs or viruses in software field. A trap door is a secret ...

What is Mutex?

Mutex (Mut from Mutual and ex from exclusion) is a mutual exclusion object which allows multiple program threads to share ...