108 search results - page 5 / 22 » A Lower Bound for Dynamic Scheduling of Data Parallel Progra... |
ICDCS
2003
IEEE
14 years 22 days ago
2003
IEEE
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
ICALP
2005
Springer
14 years 29 days ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
SENSYS
2004
ACM
14 years 27 days ago
2004
ACM
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over...
ICALP
2004
Springer
14 years 25 days 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...
GRID
2006
Springer
13 years 7 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...