Sciweavers

3934 search results - page 41 / 787
» Approximate Schedulability Analysis
Sort
View
WSC
2008
15 years 3 months ago
Calculating float in linear schedules with singularity functions
This paper presents an exact approach of calculating float for each activity in linear schedules. It is based on singularity functions, which have been used previously to determin...
Gunnar Lucko, Angel A. Pena Orozco
WSC
2008
15 years 3 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
118
Voted
RTS
2010
134views more  RTS 2010»
14 years 11 months ago
Improved multiprocessor global schedulability analysis
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) ...
Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto March...
63
Voted
GLOBECOM
2006
IEEE
15 years 7 months ago
Power Optimal Opportunistic Scheduling
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
Abhijeet Bhorkar, Abhay Karandikar, Vivek S. Borka...
132
Voted
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
15 years 4 months ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...