Parallel queueing method

Details Parallel queueing method Parallel queueing method

1982-11-04

1984-11-13

Zache, Raulfe B.

Boots, shoes, and leggings

364200, G06F 100

Patent

active

044829566

ABSTRACT:
Each embodiment enables a single chained queue to have parallel operations by plural element insertion routines and one deletion routine which may be simultaneously executing asynchronously on plural processors for deleting an element, while inserting one or more anchor-pointed elements. This is done by providing a dequeueing lock which is only examined by a program routine which is to delete an element, but is not examined by any program routine which is to make an insertion of an anchor-pointed element into the queue using a System/370 compare and swap instruction. The embodiments provide efficient processing in a non-pure LIFO queue, which is non-pure because the queue can, at the user's option, be used for either LIFO or non-LIFO dequeueing. No lock is used on the queue when inserting anchor-pointed elements. A special case of non-LIFO processing is FIFO (first-in/first-out) processing, which finds the last element in the queue as the required element.

REFERENCES:
patent: 4271468 (1981-06-01), Christensen et al.

Affiliated with

Also associated with

Rating

Parallel queueing method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Parallel queueing method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel queueing method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2364023