Sciweavers

21 search results - page 2 / 5
» Improved Approximation Algorithm for Scheduling Tasks with a...
Sort
View
RTAS
2007
IEEE
13 years 11 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...
AOR
2007
107views more  AOR 2007»
13 years 4 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
ASPDAC
2007
ACM
174views Hardware» more  ASPDAC 2007»
13 years 8 months ago
Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems
Dynamic voltage scaling (DVS) circuits have been widely adopted in many computing systems to provide tradeoff between performance and power consumption. The effective use of energ...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo, Chi-Sh...
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 6 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
OPODIS
2010
13 years 2 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah