16128 search results - page 491 / 3226 » Distributed network scheduling |
178
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...
196
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
135
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Scheduling jobs on the IBM SP2 system is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order that the jobs ar...
177
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requiremen...
165
click to vote
ICPP
1994
IEEE
15 years 10 months ago
1994
IEEE
1 In this paper, we explore the problem of scheduling parallel programs using task duplication for messagepassing multicomputers. Task duplication means scheduling a parallel progr...