Appeal No. 2000-1238
Application 08/566,638
The invention
The invention is a semaphore manager data structure for
managing semaphores in a multi-tasking computer system having a
storage means. Figure 7 shows five different ways to allocate
semaphores to classes and objects in an object-oriented computing
system environment. The rounded squares 70 represent Classes A,
B, and C. Each circle 79 represents an object and the number in
each circle is the corresponding semaphore. The "Global
Semaphore" allocation technique assigns the same semaphore
(i.e., Semaphore 1) to every object in all three classes. The
"Semaphore per Group of Classes" technique assigns Semaphore 1 to
all of the objects in classes A and C and Semaphore 2 to all of
the objects in Class B. The "Semaphore per Class" technique
assigns Semaphore 1 to all of the objects in Class A, Semaphore 2
to all of the objects in Class B, and Semaphore 3 to all of the
objects in Class C. The "Semaphore per Group of Objects"
technique assigns Semaphore 1 to the first object in every class,
Semaphore 2 to the second object in every class, and so on, while
the "Semaphore per Object" technique assigns a unique semaphore
to every object. The specification explains that these
allocation schemes
-2-
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 Next
Last modified: November 3, 2007