Sciweavers

517 search results - page 67 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
INFOCOM
1999
IEEE
15 years 2 months ago
Matching Output Queueing with a Combined Input Output Queued Switch
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaj...
PODC
2009
ACM
15 years 10 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
15 years 4 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
CCGRID
2003
IEEE
15 years 3 months ago
Scheduling Distributed Applications: the SimGrid Simulation Framework
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...
Arnaud Legrand, Loris Marchal, Henri Casanova
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
14 years 7 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...