1243 search results - page 153 / 249 » EDZL Scheduling Analysis |
123
click to vote
HPDC
2006
IEEE
15 years 7 months ago
2006
IEEE
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We...
122
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
118
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
125
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
125
Voted
RTAS
2006
IEEE
15 years 7 months ago
2006
IEEE
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...