Sciweavers

904 search results - page 30 / 181
» Scheduling task graphs optimally with A
Sort
View
VLSISP
2002
112views more  VLSISP 2002»
13 years 8 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
INFOCOM
2009
IEEE
14 years 3 months ago
Delay Guarantees for Throughput-Optimal Wireless Link Scheduling
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
Koushik Kar, Xiang Luo, Saswati Sarkar
EOR
2002
105views more  EOR 2002»
13 years 8 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
SPAA
2010
ACM
13 years 8 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
DAC
2005
ACM
14 years 9 months ago
System-level energy-efficient dynamic task scheduling
Dynamic voltage scaling (DVS) is a well-known low power design technique that reduces the processor energy by slowing down the DVS processor and stretching the task execution time...
Jianli Zhuo, Chaitali Chakrabarti