Sciweavers

320 search results - page 53 / 64
» Open problems in real-time scheduling
Sort
View
101
Voted
COLCOM
2007
IEEE
15 years 3 months ago
Peer2Schedule - an experimental peer-to-peer application to support present collaboration
Abstract—This paper describes experiences from implementing an experimental mobile peer-to-peer application called Peer2Schedule aimed at improving and supporting collaboration w...
Alf Inge Wang, Peter Nicolai Motzfeldt
TECS
2010
74views more  TECS 2010»
14 years 7 months ago
Recovering from distributable thread failures in distributed real-time Java
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
Edward Curley, Binoy Ravindran, Jonathan Stephen A...
EMSOFT
2004
Springer
15 years 2 months ago
Practical PACE for embedded systems
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...
Ruibin Xu, Chenhai Xi, Rami G. Melhem, Daniel Moss...
STACS
2010
Springer
15 years 4 months ago
The Recognition of Tolerance and Bounded Tolerance Graphs
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
George B. Mertzios, Ignasi Sau, Shmuel Zaks
CP
2009
Springer
15 years 4 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...