Sciweavers

233 search results - page 27 / 47
» A Task Duplication Based Scheduling Algorithm Using Partial ...
Sort
View
IPL
2008
80views more  IPL 2008»
13 years 7 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
EMSOFT
2004
Springer
14 years 28 days ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
GLOBECOM
2010
IEEE
13 years 5 months ago
Deadline-Based Differentiation in P2P Streaming
Splitting a P2P video distribution in multiple media flows with different priorities is an interesting approach for developing flexible and adaptive streaming systems, ranging from...
Csaba Király, Renato Lo Cigno, Luca Abeni
MP
2002
85views more  MP 2002»
13 years 7 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
NOSSDAV
2005
Springer
14 years 1 months ago
Meeting CPU constraints by delaying playout of multimedia tasks
Multimedia applications today constitute a significant fraction of the workload running on portable devices such as mobile phones, PDAs and MP3 players. However, the processors i...
Balaji Raman, Samarjit Chakraborty, Wei Tsang Ooi