Mechanism for efficient scheduling of communication flows

Details Mechanism for efficient scheduling of communication flows Mechanism for efficient scheduling of communication flows

2005-08-30

2005-08-30

Hsu, Alpus H. (Department: 2665)

Multiplex communications

Channel assignment techniques

Arbitration for access to a channel

C370S408000, C370S412000, C370S449000

Reexamination Certificate

active

06937611

ABSTRACT:
A system for servicing communication queues may include memory configured to store a hierarchical channel map having a plurality of levels wherein each bit of the lowest level is mapped to a different one of a plurality of communication channels and wherein each bit of each higher level is mapped to a group of bits at the next lower level. The system may include a host adapter configured to maintain the hierarchical bitmap wherein each bit at the lowest level is set if the channel to which it is mapped has a pending communication request and is cleared if not. Each bit of each higher level is set if at least one bit is set in the lower level group to which is mapped and cleared if not. The host adapter may be configured to examine the hierarchical bitmap in order to determine a next one of the communication channels to service. At each level of the hierarchical channel map a service mask may be provided to track which bits have already been traversed at that level. Multiple such service masks may be provided at each level to support different service classes.

REFERENCES:
patent: 4271468 (1981-06-01), Christensen et al.
patent: 6378036 (2002-04-01), Lerman et al.
patent: 6463484 (2002-10-01), Moss
patent: 1 126 668 (2001-08-01), None
patent: 98/45976 (1998-10-01), None
“Next Generation I/O: A New Approach to Server I/O Architectures,” A Technical White Paper, AberdeenGroup, Inc., Feb. 1999, 13 pages.
“The Future I/O Alliance and Architectural Strategy,” The Future I/O Developers Forum, Preserving Innovation, Oct. 27, 1999, pp. 1-6.
“Service Displines for Guaranteed Performance Service in PAcket-Switching Networks,” H. Zhang, Proceedings of IEEE, vol. 83, No. 10, pp. 1374-1396, Oct. 1995.
“Traffic Scheduling in PAcket-switched Networks: Analysis, Design, and Implenentation,” Dimitrios Stiliadis, Univ. of California Santa Cruz, 1996, pp. 1-235.
International Search Report for PCT/US 01/13105, mailed Feb. 15, 2002.

Affiliated with

Also associated with

Rating

Mechanism for efficient scheduling of communication flows does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Mechanism for efficient scheduling of communication flows, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanism for efficient scheduling of communication flows will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3449300