Sciweavers

233 search results - page 20 / 47
» A Task Duplication Based Scheduling Algorithm Using Partial ...
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
A hierarchical scheduling model for component-based real-time systems
In this paper, we propose a methodology for developing component-based real-time systems based on the concept of hierarchical scheduling. Recently, much work has been devoted to t...
José L. Lorente, Giuseppe Lipari, Enrico Bi...
SIGMOD
2005
ACM
126views Database» more  SIGMOD 2005»
14 years 7 months ago
Cost-Sensitive Reordering of Navigational Primitives
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
Carl-Christian Kanne, Matthias Brantner, Guido Moe...
CP
1998
Springer
13 years 11 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
IEEEPACT
1998
IEEE
13 years 11 months ago
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
Mayez A. Al-Mouhamed, Homam Najjari
RTAS
2011
IEEE
12 years 10 months ago
Maximizing Contention-Free Executions in Multiprocessor Scheduling
—It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with...
Jinkyu Lee, Arvind Easwaran, Insik Shin