279 search results - page 15 / 56 » Low Overhead Parallel Schedules for Task Graphs |
PDP
2009
IEEE
14 years 2 months ago
2009
IEEE
—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...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
IJHPCA
2006
13 years 7 months ago
2006
Divide-and-conquer is a well-suited programming paradigm for parallel Grid applications. Our Satin system efficiently schedules the finegrained tasks of a divide-and-conquer appli...
ICDCS
1996
IEEE
13 years 12 months ago
1996
IEEE
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
PDP
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents QLSE (QoS-constrained List Scheduling hEuristics), a Quality of Service-based launch time scheduling algorithm for wide area Grids. QLSE considers applications...