Sciweavers

71 search results - page 2 / 15
» Improved Approximations for Multiprocessor Scheduling Under ...
Sort
View
DATE
2006
IEEE
110views Hardware» more  DATE 2006»
13 years 11 months ago
Multiprocessor synthesis for periodic hard real-time tasks under a given energy constraint
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...
Heng-Ruey Hsu, Jian-Jia Chen, Tei-Wei Kuo
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
13 years 6 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...
IJCAI
2001
13 years 6 months ago
An Improved Grid-Based Approximation Algorithm for POMDPs
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
Rong Zhou, Eric A. Hansen
CCE
2004
13 years 4 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis
RTSS
2000
IEEE
13 years 9 months ago
Static-Priority Periodic Scheduling on Multiprocessors
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...
Srikanth Rarnarnurthy, Mark Moir