Sciweavers

904 search results - page 22 / 181
» Scheduling task graphs optimally with A
Sort
View
ACTAC
2007
69views more  ACTAC 2007»
13 years 8 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
14 years 1 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
RTSS
2002
IEEE
14 years 1 months ago
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults
abstractions + algorithms For Robustness to Timing Faults A new optimality criterion + algorithms
John Regehr
INFOCOM
2011
IEEE
13 years 1 days ago
Multiple task scheduling for low-duty-cycled wireless sensor networks
—For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time durin...
Shuguang Xiong, Jianzhong Li, Mo Li, Jiliang Wang,...
JSA
2007
191views more  JSA 2007»
13 years 8 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....