Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

MICRO
2002
IEEE

favoriteEmaildiscussreport

123views Hardware» more MICRO 2002»

Efficient Randomized Algorithms for Input-Queued Switch Scheduling

13 years 4 months ago

Efficient Randomized Algorithms for Input-Queued Switch Scheduling

Download web.mit.edu

Devavrat Shah, Paolo Giaccone, Balaji Prabhakar

Real-time Traffic

Hardware | MICRO 2002 |

claim paper

Related Content

» Stable RoundRobin Scheduling Algorithms for HighPerformance Input Queued Switches

» Input Queued Switches Cell Switching vs Packet Switching

» Low complexity stable scheduling algorithms for networks of input queued switches with no ...

» FrameScheduling for InputQueued Switches with Energy Reconfiguration Costs

» Optimal Scheduling Algorithms for InputQueued Switches

» Stability of Maximal Size Matching Scheduling in InputQueued Cell Switches

» Dichotomy Slot Allocation A QoS Guaranteed Scheduling Algorithm for InputQueued Switches

» On Guaranteed Smooth Scheduling For InputQueued Switches

» Scheduling Algorithms for Input Queued Switches Using Local Search Technique

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	MICRO
Authors	Devavrat Shah, Paolo Giaccone, Balaji Prabhakar

Comments (0)