Sciweavers

103 search results - page 17 / 21
» Online weighted flow time and deadline scheduling
Sort
View
RTS
2011
131views more  RTS 2011»
13 years 3 months ago
Global scheduling based reliability-aware power management for multiprocessor real-time systems
Reliability-aware power management (RAPM) has been a recent research focus due the negative effects of the popular power management technique dynamic voltage and frequency scaling ...
Xuan Qi, Dakai Zhu, Hakan Aydin
ACE
2004
182views Education» more  ACE 2004»
13 years 10 months ago
Facilitating Successful Online Computing Courses While Minimising Extra Tutor Workload
A key problem in facilitating a successful online course is the highly time -consuming nature of the administrative and pedagogical tasks involved. It is also difficult to achieve...
Stuart Young, Mae McSporran
DATE
2004
IEEE
151views Hardware» more  DATE 2004»
14 years 10 days ago
Dynamic Voltage and Cache Reconfiguration for Low Power
Given a set of real-time tasks scheduled using the earliest deadline first (EDF) algorithm, we discuss two techniques for reducing power consumption while meeting all timing requi...
André C. Nácul, Tony Givargis
ESA
2003
Springer
94views Algorithms» more  ESA 2003»
14 years 1 months ago
Semi-clairvoyant Scheduling
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
Luca Becchetti, Stefano Leonardi, Alberto Marchett...
GECON
2008
Springer
152views Business» more  GECON 2008»
13 years 9 months ago
The Power of Preemption in Economic Online Markets
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Lior Amar, Ahuva Mu'alem, Jochen Stößer