104 search results - page 14 / 21 » Parallel processor scheduling with delay constraints |
163
click to vote
IFIPTCS
2010
15 years 12 days ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
125
Voted
ICDCSW
2009
IEEE
15 years 9 months ago
2009
IEEE
Designing cyber-physical systems with high efficiency, adaptability, autonomy, reliability and usability is a challenging task. In this paper, we focus on minimizing networkwide ...
146
Voted
DAC
2007
ACM
16 years 3 months ago
2007
ACM
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
138
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
118
click to vote
IPCO
1998
15 years 3 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...