Low complexity scheduling algorithm for a buffered crossbar...

Details Low complexity scheduling algorithm for a buffered crossbar... Low complexity scheduling algorithm for a buffered crossbar...

2007-12-31

2010-12-14

Sefcheck, Gregory B (Department: 2477)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

Reexamination Certificate

active

07852866

ABSTRACT:
Scheduling techniques for use with buffered crossbar switches, without speedup, which can provide 100% throughput are described. Each input/output may keep track of the previously served VOQ/crosspoint buffer. The queue lengths of such VOQs and the queue lengths of VOQs corresponding to a uniform probability selection output (e.g., from a Hamiltonian walk schedule) are used to improve the schedule at each time slot.

REFERENCES:
patent: 7031330 (2006-04-01), Bianchini, Jr.
patent: 2006/0077973 (2006-04-01), Yoon et al.
Li et al., “Exhaustive Service Matching Algorithms for Input Queued Switches”, 2004, IEEE, pp. 253-257.
Giaccone et al., “Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches”, 2002, IEEE, pp. 1160-1166.

Affiliated with

Also associated with

Rating

Low complexity scheduling algorithm for a buffered crossbar... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Low complexity scheduling algorithm for a buffered crossbar..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low complexity scheduling algorithm for a buffered crossbar... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4177273