Sciweavers

192 search results - page 28 / 39
» Preemptive Scheduling with Rejection
Sort
View
SPAA
2010
ACM
13 years 10 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
CEE
2007
107views more  CEE 2007»
13 years 9 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
CPAIOR
2007
Springer
14 years 4 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
DATE
2002
IEEE
166views Hardware» more  DATE 2002»
14 years 2 months ago
Event Model Interfaces for Heterogeneous System Analysis
Complex embedded systems consist of hardware and software components from different domains, such as control and signal processing, many of them supplied by different IP vendors. ...
Kai Richter, Rolf Ernst
OPNETEC
2004
Springer
14 years 3 months ago
Routing and Wavelength Assignment for Scheduled and Random Lightpath Demands: Bifurcated Routing versus Non-Bifurcated Routing
: We consider the routing and the wavelength assignment (RWA) of scheduled and random lightpath demands in a wavelength switching mesh network without wavelength conversion functio...
Mohamed Koubàa, Nicolas Puech, Maurice Gagn...