16128 search results - page 353 / 3226 » Distributed network scheduling |
177
click to vote
ISPAN
2002
IEEE
15 years 9 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
136
click to vote
GRID
2006
Springer
15 years 4 months ago
2006
Springer
Existing data grid scheduling systems handle huge data I/O via replica location services coupled with simple staging, decoupled from scheduling of computing tasks. However, when th...
125
click to vote
GRID
2007
Springer
15 years 4 months ago
2007
Springer
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the grid. One way to mitigate the unpredictabili...
157
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
141
click to vote
WASA
2009
Springer
15 years 11 months ago
2009
Springer
Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN). The aim of this paper is to explore hi...