Sciweavers

155 search results - page 21 / 31
» On Schedulability Bounds of Static Priority Schedulers
Sort
View
TON
2010
118views more  TON 2010»
14 years 4 months ago
Capacity Scaling of Wireless Networks With Inhomogeneous Node Density: Lower Bounds
Abstract-- We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area, and analyze the scaling laws of their ...
Giusi Alfano, Michele Garetto, Emilio Leonardi, Va...
PODC
2006
ACM
15 years 3 months ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
Bogdan Caprita, Jason Nieh, Clifford Stein
EUROPAR
2009
Springer
15 years 4 months ago
Scheduling Recurrent Precedence-Constrained Task Graphs on a Symmetric Shared-Memory Multiprocessor
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...
UmaMaheswari C. Devi
CP
2011
Springer
13 years 9 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
TPDS
1998
110views more  TPDS 1998»
14 years 9 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