Title :
Greedy weighted matching for scheduling the input-queued switch
Author :
Brzezinski, Andrew ; Modiano, Eytan
Author_Institution :
Lab. for Inf. & Decision Syst., Massachusetts Inst. of Technol.
Abstract :
We consider greedy maximal weighted matching based scheduling for input-queued switches. We present simulation results that demonstrate the attractive throughput and delay performance achievable under maximal weighted matching. For the 2times2 input-queued switch we subsequently prove for i.i.d. Bernoulli arrival processes that greedy maximal weighted matching achieves 100% throughput.
Keywords :
delays; greedy algorithms; queueing theory; telecommunication switching; Bernoulli arrival processes; delay performance; greedy maximal weighted matching; input-queued switch; scheduling; Bipartite graph; Computational complexity; Delay; Fabrics; Laboratories; Numerical simulation; Performance analysis; Processor scheduling; Switches; Throughput;
Conference_Titel :
Information Sciences and Systems, 2006 40th Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
1-4244-0349-9
Electronic_ISBN :
1-4244-0350-2
DOI :
10.1109/CISS.2006.286435
