7891 search results - page 321 / 1579 » A Distributed Scheduling Framework |
164
Voted
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
118
click to vote
ISORC
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper presents a simple protocol that provides application processes with an approximate real-time notion. This time notion is very versatile. At one extreme, it behaves at l...
125
Voted
ICDCS
1999
IEEE
15 years 9 months ago
1999
IEEE
We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources bet...
170
click to vote
ACPC
1999
Springer
15 years 9 months ago
1999
Springer
In this paper, we first present an Object Composition Petri Nets (OCPN) based model methodology for describing the dynamic behaviour of the multiple video objects and user interac...
129
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...