Sciweavers

52 search results - page 1 / 11
» Greedy multiprocessor server scheduling
Sort
View
ORL
2006
116views more  ORL 2006»
13 years 11 months ago
Greedy multiprocessor server scheduling
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...
Carl Bussema, Eric Torng
RTAS
2007
IEEE
14 years 5 months ago
Real-Time Task Replication for Fault Tolerance in Identical Multiprocessor Systems
Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibili...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo, Shau-Y...
ICPP
2002
IEEE
14 years 4 months ago
Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
Dakai Zhu, Nevine AbouGhazaleh, Daniel Mossé...
EUC
2008
Springer
14 years 28 days ago
Scheduling Aperiodic Tasks Using Total Bandwidth Server on Multiprocessors
This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two proble...
Shinpei Kato, Nobuyuki Yamasaki
RTSS
2003
IEEE
14 years 4 months ago
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...
Theodore P. Baker