Sciweavers

307 search results - page 18 / 62
» The communication complexity of distributed task allocation
Sort
View
IJAMC
2010
149views more  IJAMC 2010»
14 years 10 months ago
Deadline-Driven Auctions for NPC host allocation in P2P MMOGs
: This paper presents the design, implementation and evaluation of Deadline-Driven Auctions (DDA), a novel task mapping infrastructure for heterogeneous distributed environments. D...
Lu Fan, Philip W. Trinder, Hamish Taylor
TPDS
1998
110views more  TPDS 1998»
14 years 11 months ago
On Exploiting Task Duplication in Parallel Program Scheduling
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
Ishfaq Ahmad, Yu-Kwong Kwok
PDP
2009
IEEE
15 years 6 months ago
Effects of Job and Task Placement on Parallel Scientific Applications Performance
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...
Javier Navaridas, Jose Antonio Pascual, José...
JSS
2007
93views more  JSS 2007»
14 years 11 months ago
Resource management for real-time tasks in mobile robotics
Coordinated behavior of mobile robots is an important emerging application area. Different coordinated behaviors can be achieved by assigning sets of control tasks, or strategies...
Huan Li, Krithi Ramamritham, Prashant J. Shenoy, R...
AMAI
2008
Springer
14 years 12 months ago
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
Patrick Amstutz, Nikolaus Correll, Alcherio Martin...