Sciweavers

359 search results - page 1 / 72
» Order Scheduling Models: Hardness and Algorithms
Sort
View
FSTTCS
2007
Springer
14 years 1 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
HIPC
2003
Springer
14 years 2 days ago
Combined Scheduling of Hard and Soft Real-Time Tasks in Multiprocessor Systems
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
Basheer Al-Duwairi, Govindarasu Manimaran
RTCSA
2005
IEEE
14 years 14 days ago
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
RTSS
1992
IEEE
13 years 11 months ago
Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
Kevin Jeffay
DATE
2006
IEEE
110views Hardware» more  DATE 2006»
14 years 28 days ago
Online energy-aware I/O device scheduling for hard real-time systems
Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of...
Hui Cheng, Steve Goddard