Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
302 words
A loosely-coupled compound computer system constituted by connecting a plurality of computers through a network, said plurality of computers using a shared resource under exclusive control, each of the plurality of computers being connected to said shared resource through a distinct bus and wherein a specific computer of said plurality of computers comprises: semaphore means for indicating a busy state of said shared resource according to a value of a semaphore variable which is increased/decreased in response to P and V operation instructions; and means, coupling to said semaphore means, for issuing the P and V operation instructions added with computer identification data and task identification data indicating which task of which computer issued a use request or use end information of the shared resource through the network in response to a shared resource use request from another computer or the specific computer, and determining whether or not enabling information of the use request should be issued through the network to a source computer of the use request according to the value of the semaphore variable, and each remaining computer of said plurality of computers comprises: means for transmitting the shared-resource-use request to the issuing means in the specific computer through the network; means for receiving the enabling information representing permission of the use request to access the shared resource from the issuing means in the specific computer through the network and then accessing the shared resource through the distinct bus; means for waiting to use said shared resource until the enabling information from said semaphore means is received through the network; and means for issuing, to the issuing means in the specific computer through the network, the use end information upon completion of the access to said shared resource, whereby the semaphore means releases the busy state of the shared resource.
Claim 2
Dependent Claim
302 words
A loosely-coupled compound computer system constituted by connecting a plurality of computers through a network, said plurality of computers using a shared resource under exclusive control, each of the plurality of computers being connected to said shared resource through a distinct bus and wherein a specific computer of said plurality of computers comprises: semaphore means for indicating a busy state of said shared resource according to a value of a semaphore variable which is increased/decreased in response to P and V operation instructions; and means, coupling to said semaphore means, for issuing the P and V operation instructions added with computer identification data and task identification data indicating which task of which computer issued a use request or use end information of the shared resource through the network in response to a shared resource use request from another computer or the specific computer, and determining whether or not enabling information of the use request should be issued through the network to a source computer of the use request according to the value of the semaphore variable, and each remaining computer of said plurality of computers comprises: means for transmitting the shared-resource-use request to the issuing means in the specific computer through the network; means for receiving the enabling information representing permission of the use request to access the shared resource from the issuing means in the specific computer through the network and then accessing the shared resource through the distinct bus; means for waiting to use said shared resource until the enabling information from said semaphore means is received through the network; and means for issuing, to the issuing means in the specific computer through the network, the use end information upon completion of the access to said shared resource, whereby the semaphore means releases the busy state of the shared resource.
Claim 3
Dependent Claim
14 words
A system according to claim 1, wherein said semaphore means comprises a binary semaphore.
Claim 4
Dependent Claim
14 words
A system according to claim 1, wherein said semaphore means comprises a count semaphore.
Claim 5
Dependent Claim
40 words
A system according to claim 1, wherein said semaphore means comprises means for, when the semaphore variable is "0", queuing the computer identification data indicating the computer as the use request source, and the task identification data in a queue.
Claim 6
Independent Claim
306 words
A method of performing exclusive control utilizing a semaphore in a loosely-coupled compound computer system constituted by connecting a plurality of computers through a network, said plurality of computers using a shared resource under exclusive control, each of said plurality of computers being connected to the shared resource through a distinct bus, a specific computer of said plurality of computers comprising a semaphore mechanism for indicating a busy state of said shared resource according to a value of a semaphore variable which is increased/decreased in response to P and V operation instructions, and a lock server mechanism for looking up the semaphore variable of said semaphore mechanism to manage the exclusive control among said plurality of computers, comprising the steps of: a) issuing a lock request to said lock server mechanism through the network; b) causing said lock server mechanism to issue a P operation instruction added with computer identification data and task identification data indicating which task of which computer issued the lock request to said semaphore mechanism through the network; c) causing said semaphore mechanism to check the value of the semaphore variable in response to the P operation instruction so as to determine whether said shared resource is ready or busy; d) issuing use enabling information, representing an access permission for the shared resource, to a use request source through said lock server mechanism and through the network when the shared resource is ready; e) queuing the computer identification data and the task identification data in a queue when the shared resource is busy; whereby a computer which issued the lock request waits to use said shared resource until the computer which issued the lock request receives use enabling information through the network; and f) accessing the shared resource through the distinct bus upon receiving the enabling information from the lock server mechanism.
Claim 7
Independent Claim
306 words
A method of performing exclusive control utilizing a semaphore in a loosely-coupled compound computer system constituted by connecting a plurality of computers through a network, said plurality of computers using a shared resource under exclusive control, each of said plurality of computers being connected to the shared resource through a distinct bus, a specific computer of said plurality of computers comprising a semaphore mechanism for indicating a busy state of said shared resource according to a value of a semaphore variable which is increased/decreased in response to P and V operation instructions, and a lock server mechanism for looking up the semaphore variable of said semaphore mechanism to manage the exclusive control among said plurality of computers, comprising the steps of: a) issuing a lock request to said lock server mechanism through the network; b) causing said lock server mechanism to issue a P operation instruction added with computer identification data and task identification data indicating which task of which computer issued the lock request to said semaphore mechanism through the network; c) causing said semaphore mechanism to check the value of the semaphore variable in response to the P operation instruction so as to determine whether said shared resource is ready or busy; d) issuing use enabling information, representing an access permission for the shared resource, to a use request source through said lock server mechanism and through the network when the shared resource is ready; e) queuing the computer identification data and the task identification data in a queue when the shared resource is busy; whereby a computer which issued the lock request waits to use said shared resource until the computer which issued the lock request receives use enabling information through the network; and f) accessing the shared resource through the distinct bus upon receiving the enabling information from the lock server mechanism.