Sciweavers

280 search results - page 15 / 56
» Quasi-Static Scheduling of Communicating Tasks
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
ICA3PP
2010
Springer
14 years 13 days ago
On-Line Task Granularity Adaptation for Dynamic Grid Applications
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...
Nithiapidary Muthuvelu, Ian Chai, Eswaran Chikkann...
NOMS
2010
IEEE
180views Communications» more  NOMS 2010»
13 years 6 months ago
Performance-driven task co-scheduling for MapReduce environments
—MapReduce is a data-driven programming model proposed by Google in 2004 which is especially well suited for distributed data analytics applications. We consider the management o...
Jorda Polo, David Carrera, Yolanda Becerra, Malgor...
PROCEDIA
2010
148views more  PROCEDIA 2010»
13 years 2 months ago
SysCellC: a data-flow programming model on multi-GPU
High performance computing with low cost machines becomes a reality with GPU. Unfortunately, high performances are achieved when the programmer exploits the architectural specific...
Dominique Houzet, Sylvain Huet, Anis Rahman
IPPS
1998
IEEE
13 years 12 months ago
Scheduling with Communication Delays and Data Routing in Message Passing Architectures
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
Aziz Moukrim, Alain Quilliot