Sciweavers

534 search results - page 49 / 107
» On Scheduling Parallel Tasks at Twilight
Sort
View
SP
2002
IEEE
147views Security Privacy» more  SP 2002»
14 years 9 months ago
CX: A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks...
Peter R. Cappello, Dimitros Mourloukos
EUROPAR
2005
Springer
15 years 3 months ago
Batch-Scheduling Dags for Internet-Based Computing
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...
Grzegorz Malewicz, Arnold L. Rosenberg
IPPS
2003
IEEE
15 years 3 months ago
A P2P Approach for Global Computing
We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some smallworld characteri...
Wen Dou, Yan Jia, Huaimin Wang, Wen Qiang Song, Pe...
EOR
2002
105views more  EOR 2002»
14 years 9 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
DSD
2008
IEEE
104views Hardware» more  DSD 2008»
14 years 10 months ago
A Look-Ahead Task Management Unit for Embedded Multi-Core Architectures
Efficient utilization of multi-core architectures relies on the partitioning of applications into tasks and mapping the tasks to cores. In some applications (e.g. H.264 video deco...
Magnus Själander, Andrei Terechko, Marc Duran...