Boots – shoes – and leggings
Patent
1992-12-30
1994-11-22
Kriess, Kevin A.
Boots, shoes, and leggings
364DIG1, 364DIG2, 395725, 395325, G06F 1314
Patent
active
053676793
ABSTRACT:
A scheduler for scheduling communication by a plurality of clients who compete to use a shared resource. Each client asserts a request bit to request use of the shared resource, and receives a grant bit from the scheduler that is asserted when the client is scheduled to use the shared resource. The scheduler includes a SC generation unit in which the request bits are inverted, the bit at the previous scheduling cycle grant is forced, and a scheduler carry operation is performed on the inverted request bits and grant bits to supply carry bits. The carry bits are "AND"ed with the forced, inverted request bits to supply a SC result and a carryout bit. The carryin bit is initially assumed to be zero, and the SC generation unit performs an initial operation. If the carryout bit from the final generation unit is zero, then the SC result bits for the initial operation provide the .grant word for the current scheduling cycle. However, if the carryout bit is one, the SC generation unit performs a second operation assuming a carryin bit of one to supply the grant word for the current scheduling cycle. To increase speed of operation, parallel branches may be provided so that the initial and the second operations can proceed in parallel and the correct grant word can be selected after the carryout bit is known. The second operation can be implemented with a hifind operation. Priority between clients can be implemented by allowing clients with priority to disable the scheduler.
REFERENCES:
patent: 4375639 (1983-03-01), Johnson, Jr.
patent: 4449183 (1984-05-01), Flahive et al.
patent: 4499538 (1985-02-01), Finger et al.
patent: 4536839 (1985-08-01), Shah et al.
patent: 4669079 (1987-05-01), Blum
patent: 4763122 (1988-08-01), Franaszek
patent: 4924380 (1990-05-01), McKinney et al.
patent: 4964034 (1990-10-01), Jaskowiak
patent: 5072363 (1991-12-01), Gallagher
patent: 5088024 (1992-02-01), Vernon et al.
patent: 5179705 (1993-01-01), Kent
patent: 5276635 (1994-01-01), Naini et al.
Vernon, Mary K. and Manber, Udi, "Distributed Round-Robin and First-Come First-Serve Protocols and their Application to Multiprocessor Bus Arbitration", SCIC, Mar. 1988, pp. 10-18.
Hennessy, John L., and Patterson, David A., "Computer Architecture A Quantitative Approach", Morgan Kaufman Publishers Inc., 1990, pp. A31-A39.
Intel Corporation
Kriess Kevin A.
Payne Matthew M.
LandOfFree
Round robin scheduler using a scheduler carry operation for arbi does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Round robin scheduler using a scheduler carry operation for arbi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Round robin scheduler using a scheduler carry operation for arbi will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1998052