Sciweavers

279 search results - page 3 / 56
» Low Overhead Parallel Schedules for Task Graphs
Sort
View
SIPS
2007
IEEE
15 years 3 months ago
Low-Overhead Run-Time Scheduling for Fine-Grained Acceleration of Signal Processing Systems
In this paper, we present four scheduling algorithms that provide flexible utilization of fine-grain DSP accelerators with low run-time overhead. Methods that have originally been...
Jani Boutellier, Shuvra S. Bhattacharyya, Olli Sil...
IWOMP
2009
Springer
15 years 4 months ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins
ICPP
1994
IEEE
15 years 1 months ago
A New Approach to Scheduling Parallel Programs Using Task Duplication
1 In this paper, we explore the problem of scheduling parallel programs using task duplication for messagepassing multicomputers. Task duplication means scheduling a parallel progr...
Ishfaq Ahmad, Yu-Kwong Kwok
TON
2010
126views more  TON 2010»
14 years 4 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
RTCSA
2006
IEEE
15 years 3 months ago
Predictable Interrupt Scheduling with Low Overhead for Real-Time Kernels
In this paper we analyze the traditional model of interrupt management and its inability to incorporate the reliability and temporal predictability demanded by real-time systems. ...
Luis E. Leyva-del-Foyo, Pedro Mejía-Alvarez...