1257 search results - page 123 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
120
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
115
Voted
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
117
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper presents general techniques for formally modeling, simulating, and model checking real-time resource-sharing protocols in Real-Time Maude. The “scheduling subset” o...
131
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
ATAL
2003
Springer
15 years 7 months ago
2003
Springer
This paper presents a multiagent-system for integrating ALICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned ...