Interlock queueing

Details Interlock queueing Interlock queueing

G - Physics

06

F

G06F 13/14 (2006.01) G06F 9/46 (2006.01)

Patent

CA 2042772

ABSTRACT A lockout avoidance circuit is provided for a plurality of nodes which generate lock requests for a shared resource such as a memory location. The circuit insures that lock requests are eventually satisfied. A lock queue includes a plurality of registers pipelined together. Lock requests only enter the lock queue if they are refused access to a shared resource a predetermined number of times. A first register is the head of the queue and the last register is the bottom of the queue. An enabling circuit allows the queue to store in the registers lock requests received from the different nodes in the order in which they are initially refused service. The enabling circuit operates the queue by pushing the stored lock requests toward the head of the queue each time the head entry in the queue is serviced. The lockout avoidance circuit is implemented at each level of the system wherein a lockout condition can occur.

Affiliated with

Also associated with

Rating

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

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

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1621384