Sciweavers

912 search results - page 54 / 183
» Robust task scheduling for volunteer computing systems
Sort
View
RTS
2011
123views more  RTS 2011»
13 years 3 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
HYBRID
2007
Springer
14 years 19 days ago
On Self-triggered Full-Information H-Infinity Controllers
Abstract. A self-triggered control task is one in which the task determines its next release time. It has been conjectured that self-triggering can relax the requirements on a real...
Michael D. Lemmon, Thidapat Chantem, Xiaobo Sharon...
ANSS
2002
IEEE
14 years 1 months ago
Scheduling a Job Mix in a Partitionable Parallel System
Efficient scheduling of jobs on parallel processors is essential for good performance. However, design of such schedulers is challenging because of the complex interaction between...
Helen D. Karatza, Ralph C. Hilzer Jr.
JPDC
2007
92views more  JPDC 2007»
13 years 8 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...
RTCSA
2006
IEEE
14 years 2 months ago
Maximizing Guaranteed QoS in (m, k)-firm Real-time Systems
(m,k)-firm constraints have been used to schedule tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guara...
Jian (Denny) Lin, Albert M. K. Cheng