Fast first-come, first-served time stamp arbitration mechanism

Details Fast first-come, first-served time stamp arbitration mechanism Fast first-come, first-served time stamp arbitration mechanism

1996-08-16

1998-01-27

Auve, Glenn A.

395732, G06F 1300

Patent

active

057129886

ABSTRACT:
A first-come-first-serve ("FCFS") scheduler that routes requests from two or more clients to a single resource. The FCFS scheduler contains a time stamp mechanism which provides a time stamp for each request. The scheduler provides resource access to the client with the oldest generated request and under a predetermined priority scheme in the event of simultaneous requests. The time stamps are generated by adders which add the current value of a time stamp counter with the number of client requests. The time stamp counter is incremented by the output of the adders. The updated value of the counter is decoded into a time stamp output value stored within time stamp registers. A hifind circuit reads the registers and generates an output signal associated with the set of registers, and corresponding client request, with the lowest time stamp. The output signal allows the client to access the resource.

REFERENCES:
patent: 5289583 (1994-02-01), Fischer et al.
patent: 5303391 (1994-04-01), Simcoe et al.
patent: 5473762 (1995-12-01), Krein et al.

Affiliated with

Also associated with

Rating

Fast first-come, first-served time stamp arbitration mechanism does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast first-come, first-served time stamp arbitration mechanism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast first-come, first-served time stamp arbitration mechanism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-349476