Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories
Patent
1996-03-29
1999-01-26
Donaghue, Larry D.
Electrical computers and digital processing systems: memory
Storage accessing and control
Hierarchical memories
39580032, 3951821, 395726, 395730, 39520056, 39520078, 395553, 711210, G06F 1500
Patent
active
058646990
ABSTRACT:
A self-directed distributed system provides a method for mutual exclusion of asynchronously interacting processors. The system comprises a system for control of access to a shared resource in a multi-processing computing environment, comprising at least two processors; an interconnection system interconnecting the processors, whereby each processor can communicate with all other processors; a resource for shared access by the processors; communication means within each processor for sending an interest signal to all other processors for signalling the interest of the processor in acquiring the resource; receiving means within each processor for receiving the interest signal of every other processor; interest vector means within each processor for storing the received interest signal of every other processor; and means within each processor for interrogating the interest vector means in the processor to determine the availability of the resource. Each processor can acquire the resource only if (1) the processor's interrogation of its interest vector means indicates no interest in acquiring the resource by any other processor; For every pair of processors, P1 and P2, the processor P1 delays interrogation of its interest vector means a sufficient time after the processor P1's interest signal is sent, that the time gap between the processor P1's interrogation of its interest vector means and the arrival of the processor P1's interest signal at the processor P2 (T1) is not less than time between the processor P2's interrogation of its interest vector means and the time the processor P2's interest signal arrives at the processor P1 (T2).
REFERENCES:
patent: 5197130 (1993-03-01), Chen et al.
patent: 5265235 (1993-11-01), Sindhu et al.
patent: 5283870 (1994-02-01), Joyce et al.
patent: 5337443 (1994-08-01), Lockwood
patent: 5553298 (1996-09-01), Merryman et al.
John P. Hayes., Computer Architecture and Organization, 1990, pp. 468-557.
V.Carl Hamacher, Computer Organization, 1990, pp. 461-483.
Glenn Rirart et al., "An Optimal Algorithm for Mutual Exclusion in Computer Networks", 1981, pp. 9-17 and 578.
Leslie Lamport, "A New Solution of Dijkstra's Concurrent Programming Problem", Massachussetts Computer Associates, Inc. Aug. 1974, vol. 17, No. 8.
Leslie Lamport,"The Mutual Exclusion Problem-Part II Statement and Solutions", Journal of the Association for Computing Machinery, vol. 33, No. 2 Apr. 1986 pp. 327-348.
Alan F. Babich, "Providing Total Corrections of parallel programs," IEEE Transactions on Software Engineering, vol. SE-5, No. 6, Nov. 1979.
Missin Francez et al., "A Proof Method for Ajelic Programs," Informatica, Springer-Verlag, 1978.
Susan Owicki et al., "Providing Liveness Properties of Concurrment Programs," ACM Transactions on Programming Languages and systems, vol. 4, No. 3. Jul. 1982.
Donaghue Larry D.
Follansbee John
LandOfFree
Method and apparatus for mutual exclusion in self-directed distr does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for mutual exclusion in self-directed distr, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for mutual exclusion in self-directed distr will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1457153