Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2007-01-02
2007-01-02
Phunkulh, Bob A. (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S398000, C370S419000
Reexamination Certificate
active
10109718
ABSTRACT:
The present invention is a system and a method for connection scheduling of crossbar switches having at least one ingress and at least one egress, each of the egresses is connected to at least one port, comprising at least one scheduler for scheduling matches between the ingresses and the egresses, which is in communication with the crossbar switch and at least one memory for holding data which is useful in the process of scheduling the crossbar switch. The memory is in communication with the scheduler. The scheduler schedules the matches between the ingresses and the egresses using data stored in the memory regarding the ingresses, egresses, and the ports. The scheduler operates in accordance with a selection algorithm, which is based on prioritizing of the ports. Selections are performed hierarchically as will be detailed hereinbelow. The scheduler efficiently matches between plurality of inputs and plurality of outputs, especially in crossbar systems having a large number of inputs and outputs. Matching is performed in three steps: request, grant, and accept. The data stored in the memory is stored in unique memory structures, which enable the effective processing of the stored information.
REFERENCES:
patent: 4929940 (1990-05-01), Franaszek et al.
patent: 4968977 (1990-11-01), Chinnaswamy et al.
patent: 5124978 (1992-06-01), Chao
patent: 5179552 (1993-01-01), Chao
patent: 5197054 (1993-03-01), Harada
patent: 5199028 (1993-03-01), Arnold
patent: 5267235 (1993-11-01), Thacker
patent: 5339396 (1994-08-01), Muramatsu et al.
patent: 5392401 (1995-02-01), Barucchi et al.
patent: 5500858 (1996-03-01), McKeown
patent: 5513364 (1996-04-01), Nishikawa
patent: 5517619 (1996-05-01), Muramatsu et al.
patent: 5541914 (1996-07-01), Krishnamoorthy et al.
patent: 5555543 (1996-09-01), Grohoski et al.
patent: 6044061 (2000-03-01), Aybay et al.
patent: 6061345 (2000-05-01), Hahn et al.
patent: 6128719 (2000-10-01), Kim
patent: 6195335 (2001-02-01), Calvignac et al.
patent: 6230229 (2001-05-01), Van Krevelen et al.
patent: 6370148 (2002-04-01), Calvignac et al.
patent: 6757246 (2004-06-01), Alasti et al.
patent: 6882649 (2005-04-01), Gura et al.
patent: 6937133 (2005-08-01), Johnson et al.
patent: 6990072 (2006-01-01), Alasti et al.
patent: 2002/0027902 (2002-03-01), Reeve et al.
patent: 2003/0072326 (2003-04-01), Alasti et al.
patent: 2002/0001304 (2006-02-01), Johnson et al.
“The iSLIP Scheduling Algorithm for Input-Queued Switches”, Nick McKeown. Stanford University, Stanford CA.
Abelman ,Frayne & Schwab
P-Cube Ltd.
Phunkulh Bob A.
LandOfFree
System and method for scheduling a cross-bar does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for scheduling a cross-bar, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for scheduling a cross-bar will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3756024