Sciweavers

703 search results - page 87 / 141
» Maintenance scheduling problems as benchmarks for constraint...
Sort
View
PDP
2003
IEEE
15 years 2 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
87
Voted
RTAS
1999
IEEE
15 years 1 months ago
Timing Constraint Remapping to Avoid Time Discontinuities in Distributed Real-Time Systems
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...
Minsoo Ryu, Jungkeun Park, Seongsoo Hong
AIMSA
2008
Springer
15 years 4 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek
76
Voted
RTSS
2002
IEEE
15 years 2 months ago
Maximizing the System Value while Satisfying Time and Energy Constraints
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
Cosmin Rusu, Rami G. Melhem, Daniel Mossé
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 2 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...