Sciweavers

1758 search results - page 7 / 352
» Schedule processes, not VCPUs
Sort
View
ECAI
1998
Springer
15 years 9 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
ICALP
2000
Springer
15 years 9 months ago
Parallel Machine Scheduling Problems with Controllable Processing Times
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
Klaus Jansen, Monaldo Mastrolilli
DATE
1998
IEEE
68views Hardware» more  DATE 1998»
15 years 9 months ago
Scheduling of Conditional Process Graphs for the Synthesis of Embedded Systems
We present an approach to process scheduling based on an abstract graph representation which captures both dataflow and the flow of control. Target architectures consist of severa...
Petru Eles, Krzysztof Kuchcinski, Zebo Peng, Alexa...
DAM
2008
61views more  DAM 2008»
15 years 5 months ago
Scheduling malleable tasks with interdependent processing rates: Comments and observations
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...
Edmund K. Burke, Moshe Dror, James B. Orlin
176
Voted
MP
2007
145views more  MP 2007»
15 years 4 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz