Sciweavers

3934 search results - page 240 / 787
» Approximate Schedulability Analysis
Sort
View
CP
2004
Springer
15 years 12 months ago
Decomposition and Learning for a Hard Real Time Task Allocation Problem
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Ma...
ECRTS
2003
IEEE
15 years 12 months ago
Resource Partitioning among Real-Time Applications
When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing req...
Giuseppe Lipari, Enrico Bini
ASAP
2000
IEEE
142views Hardware» more  ASAP 2000»
15 years 11 months ago
Contention-Conscious Transaction Ordering in Embedded Multiprocessors
This paper explores the problem of efficiently ordering interprocessor communication operations in statically-scheduled multiprocessors for iterative dataflow graphs. In most digi...
Mukul Khandelia, Shuvra S. Bhattacharyya
RTSS
1998
IEEE
15 years 10 months ago
Efficient Object Sharing in Quantum-Based Real-Time Systems
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum...
James H. Anderson, Rohit Jain, Kevin Jeffay
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 11 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich