Sciweavers

1095 search results - page 55 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ECRTS
2010
IEEE
15 years 5 months ago
AIRS: Supporting Interactive Real-Time Applications on Multicore Platforms
Modern real-time systems increasingly operate with multiple interactive applications. While these systems often require reliable quality of service (QoS) for the applications, eve...
Shinpei Kato, Ragunathan Rajkumar, Yutaka Ishikawa
ECRTS
2004
IEEE
15 years 7 months ago
Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems
We present an approach to partitioning and mapping for multicluster embedded systems consisting of time-triggered and eventtriggered clusters, interconnected via gateways. We have...
Paul Pop, Petru Eles, Zebo Peng, Viacheslav Izosim...
DAC
2006
ACM
16 years 5 months ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...
135
Voted
JCO
2002
96views more  JCO 2002»
15 years 3 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu
LCN
2008
IEEE
15 years 10 months ago
Efficient power management for Wireless Sensor Networks: A data-driven approach
—Providing energy-efficient continuous data collection services is of paramount importance to Wireless Sensor Network (WSN) applications. This paper proposes a new power manageme...
MingJian Tang, Jinli Cao, Xiaohua Jia