Sciweavers

2714 search results - page 310 / 543
» Approximation Schemes for Scheduling
Sort
View
119
Voted
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 9 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
15 years 9 months ago
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements
In addition to real-time requirements, the program code size is a critical design factor for real-time embedded systems. To take advantage of the code size vs. execution time trad...
Insik Shin, Insup Lee, Sang Lyul Min
RANDOM
1998
Springer
15 years 8 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
ECRTS
2008
IEEE
15 years 5 months ago
Dynamic Reconfiguration for Adaptive Multiversion Real-Time Systems
Modern real-time systems must be designed to be highly adaptable, reacting to aperiodic events in a predictable manner and exhibiting graceful degradation in overload scenarios wh...
George Lima, Eduardo Camponogara, Ana Carolina Sok...
AIPS
2004
15 years 5 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf