Semaphore Implementation

You are here: 85349 -> Resources -> Lectures -> 6 -> 21	Search \| Site Map
[ Questions or Comments ] Lecture 6: Slide 21 of 61

Semaphore Implementation

Define a semaphore as a record/structure

 struct semaphore
 {
   int value;
   List *L;   //a list of processes
 }

Assume two simple operations:
- block suspends the process that invokes it.
- wakeup(P) resumes the execution of a blocked process P.

[ Questions or Comments ]

You are here: 85349 -> Resources -> Lectures -> 6 -> 21

Search | Site Map

Edit | © Central Queensland University
Last modified: Mon Apr 2 15:57:02 2001 by webmaster