Sciweavers

27 search results - page 2 / 6
» On-Line Scheduling to Maximize Task Completions
Sort
View
RTCSA
2005
IEEE
13 years 10 months 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...
JPDC
2007
92views more  JPDC 2007»
13 years 4 months ago
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
PDP
2005
IEEE
13 years 10 months ago
Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...
Olivier Beaumont, Arnaud Legrand, Loris Marchal, Y...
RTCSA
2000
IEEE
13 years 9 months ago
Optimal scheduling of imprecise computation tasks in the presence of multiple faults
With the advance of applications such as multimedia, imagelspeech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision”...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
RTS
2002
111views more  RTS 2002»
13 years 4 months ago
Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems
Distributed real-time applications usually consist of several component tasks and must be completed by its end-to-end (E-T-E) deadline. As long as the E-T-E deadline of an applicat...
Jan Jonsson, Kang G. Shin