21 search results - page 1 / 5 » Improved Approximation Algorithm for Scheduling Tasks with a... |
ACID
2006
13 years 5 months ago
2006
EMSOFT
2007
Springer
13 years 10 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
ICPP
2005
IEEE
13 years 10 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...