Fast arbiter having easy scaling for large numbers of...

H - Electricity – 04 – L

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H04L 5/14 (2006.01) G06F 13/362 (2006.01)

Patent

CA 2045328

PD88-0514 ABSTRACT OF THE DISCLOSURE A fast arbiter having a selectable queuing descipline and capable of being easily scaled to both large numbers of requesters and large numbers of types of resources where there are multiple instances of each type of resource, is provided by a request logic circuit coupled to each requester, thereby forming a plurality of request logic circuits; a grant logic circuit is coupled to each instance of the plurality of types of resources, thereby forming a plurality of grant logic circuits; a broadcast medium transfers information among the plurality of request logic circuits and the plurality of grant logic circuits. During a first cycle, request logic circuits enable a selected requester to broadcast are quest onto the broadcast medium for the preselected type of resource. During a second cycle, grant logic circuits enable a first grant logic circuit to broadcast queue position information on the broadcast medium for the preselected type of resource, and the queue position information for the preselected type of resource is hereinafter referred to as a first queue position information. Figure 1

LandOfFree

Say what you really think

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

Rating

Fast arbiter having easy scaling for large numbers of... 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 arbiter having easy scaling for large numbers of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast arbiter having easy scaling for large numbers of... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1949787

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