103 search results - page 13 / 21 » Online weighted flow time and deadline scheduling |
FSTTCS
2007
Springer
14 years 2 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
IEEEPACT
1998
IEEE
14 years 25 days ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
RTAS
2007
IEEE
14 years 2 months ago
2007
IEEE
Many mission-critical distributed real-time applications must handle aperiodic tasks with end-to-end deadlines. However, existing middleware (e.g., RT-CORBA) lacks schedulability ...
IOR
2010
13 years 7 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...