Sciweavers

517 search results - page 20 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
RTAS
2010
IEEE
14 years 8 months ago
Approximate Bandwidth Allocation for Fixed-Priority-Scheduled Periodic Resources
Recent research in compositional real-time systems has focused on determination of a component’s real-time interface parameters. An important objective in interface-parameter de...
Farhana Dewan, Nathan Fisher
EMSOFT
2010
Springer
14 years 8 months ago
Resource adaptations with servers for hard real-time systems
Many real-time applications are designed to work in different operating modes each characterized by different functionality and resource demands. With each mode change, resource d...
Nikolay Stoimenov, Lothar Thiele, Luca Santinelli,...
LATIN
2000
Springer
15 years 1 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
15 years 4 months ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää
LCN
2007
IEEE
15 years 4 months ago
Experiments on Network Services for the Grid
—For demanding Grid applications that use resources at different cluster sites a reservation mechanism ensures the availability of resources to guarantee a certain level of QoS. ...
Christoph Barz, Peter Martini, Markus Pilz, Floria...