157 search results - page 14 / 32 » The Case for Fair Multiprocessor Scheduling |
90
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
118
click to vote
JSSPP
1995
Springer
15 years 1 months ago
1995
Springer
We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to increasing the system throughpu...
100
click to vote
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
89
Voted
CODES
2011
IEEE
13 years 9 months ago
2011
IEEE
Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are ...
ANSS
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper studies parallel job scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Five policies are used to ...