Sciweavers

206 search results - page 28 / 42
» Better Bounds for Online Scheduling
Sort
View
ASPDAC
2006
ACM
119views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Using speculative computation and parallelizing techniques to improve scheduling of control based designs
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
Roberto Cordone, Fabrizio Ferrandi, Marco D. Santa...
IPPS
1998
IEEE
13 years 11 months ago
An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requiremen...
Sylvain Lauzac, Rami G. Melhem, Daniel Mossé...
WCNC
2008
IEEE
14 years 1 months ago
An Opportunistic Scheduling Scheme with Minimum Data-Rate Guarantees for OFDMA
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...
Razvan Pitic, Antonio Capone
HM
2010
Springer
146views Optimization» more  HM 2010»
13 years 7 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
IPPS
1999
IEEE
13 years 12 months ago
A Network Status Predictor to Support Dynamic Scheduling in Network-Based Computing Systems
The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth r...
JunSeong Kim, David J. Lilja