Sciweavers

279 search results - page 13 / 56
» Low Overhead Parallel Schedules for Task Graphs
Sort
View
142
Voted
EUROPAR
2009
Springer
15 years 9 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
134
Voted
IPPS
2006
IEEE
15 years 8 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
136
Voted
ICCD
2006
IEEE
126views Hardware» more  ICCD 2006»
15 years 11 months ago
Task Merging for Dynamic Power Management of Cyclic Applications in Real-Time Multi-Processor Systems
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...
Shaobo Liu, Qinru Qiu, Qing Wu
131
Voted
SAC
2005
ACM
15 years 8 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
125
Voted
TWC
2008
141views more  TWC 2008»
15 years 2 months ago
Bursty transmission and glue pouring: on wireless channels with overhead costs
Power efficiency is a capital issue in the study of mobile wireless nodes owing to constraints on their battery size and weight. In practice, especially for low-power nodes, it is ...
Pamela Youssef-Massaad, Lizhong Zheng, Muriel M&ea...