Sciweavers

1316 search results - page 92 / 264
» A New Scheduling Algorithm for Servers
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 10 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
RTSS
1994
IEEE
14 years 2 months ago
Efficient Aperiodic Service Under Earliest Deadline Scheduling
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
Marco Spuri, Giorgio C. Buttazzo
INFOCOM
2003
IEEE
14 years 4 months ago
Input Queued Switches: Cell Switching vs. Packet Switching
— Input Queued(IQ) switches have been very well studied in the recent past. The main problem in the IQ switches concerns scheduling. The main focus of the research has been the ï...
Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah
INFOCOM
2009
IEEE
14 years 5 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
RTSS
2009
IEEE
14 years 5 months ago
Gang EDF Scheduling of Parallel Task Systems
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which applies the Earliest Deadline First (EDF) policy ...
Shinpei Kato, Yutaka Ishikawa