Message queue processing among cooperative processors having sig

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395325, 395425, 364DIG1, 364239, 36423951, 364244, 3642443, 364284, 3642841, 3642843, G06F 1300

Patent

active

052242153

ABSTRACT:
Processors communicatively attaching a storage sub-system and which place a message on a queue no longer have to wait on a queue lock set by another processor or sub-system dequeuing a message. This is realized by use of a double ended linked list or queue of messages having an isolation/reference point wherein an enqueuing end of the list is lockable and accessible independently from the dequeuing end of the list. The locking primitive may be of the multi-processor lock synchronizing atomic type such as TEST AND SET.

REFERENCES:
patent: 3336582 (1967-08-01), Beausoleil et al.
patent: 4092732 (1978-05-01), Ouchi
patent: 4454595 (1984-06-01), Cage
patent: 4482956 (1984-11-01), Tallman
patent: 4807111 (1989-02-01), Cohen et al.
patent: 4980852 (1990-12-01), Giroir et al.
D. A. Patterson et al., "A Case of Redundant Arrays of Inexpensive Diska (RAID)", ACM Sigmod Conference, Chicago, Illinois, Jun. 1-3, 1988.
Kluth, "The Art of Computer Programming", Second Edition, Copyright Addison-Wesley Pub. Co. 1968, 1973, vol. 1, Fundamental Algorithms, pp. 234-239, 531-534.
Brady et al., "Method and Means for Accessing DASD Arrays with Tuned Data Transfer Rate and Concurrency", Filed May 24, 1990, U.S. Ser. No. 07/528,999.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Message queue processing among cooperative processors having sig does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Message queue processing among cooperative processors having sig, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message queue processing among cooperative processors having sig will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1762703

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.