Sciweavers

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

6

PDP
2007
IEEE

favoriteEmaildiscussreport

82views Distributed And Parallel Com...» more PDP 2007»

Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms

13 years 10 months ago

Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms

Download www.ens-lyon.fr

Matthieu Gallet, Yves Robert, Frédér

Real-time Traffic

Distributed And Parallel Computing | PDP 2007 |

claim paper

Related Content

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

» Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity

» A Distributed Scheduling Algorithm for an Optical Switching Fabric

» Distributed parallel scheduling algorithms for highspeed virtual output queuing switches

» Scheduling highrate sessions in Fractional Lambda Switching networks Algorithm and analysi...

» Guaranteed Scheduling for Switches with Configuration Overhead

» Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and D...

» Request Distribution for Fairness with a New LoadUpdate Mechanism in Web Server Cluster

» The Complexity of Connectivity in Wireless Networks

Post Info
More Details (n/a)

Added	04 Jun 2010
Updated	04 Jun 2010
Type	Conference
Year	2007
Where	PDP
Authors	Matthieu Gallet, Yves Robert, Frédéric Vivien

Comments (0)