Introduction to Parallel & Vector Solution of Linear Systems
Introduction to Parallel & Vector Solution of Linear Systems
A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System
IEEE Transactions on Computers
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling
IEEE Transactions on Software Engineering
Production and Stabilization of Real-Time Task Schedules
Journal of the ACM (JACM)
Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Journal of the ACM (JACM)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Optimality of the STE Rule for Multiple Server Queues That Serve
On the Optimality of the STE Rule for Multiple Server Queues That Serve
Optimal Scheduling of Parallel Processing Systems with Real-Time
Optimal Scheduling of Parallel Processing Systems with Real-Time
Comparison of Hybrid Minimum Laxity/First-in-First-Out Scheduling Policies
Comparison of Hybrid Minimum Laxity/First-in-First-Out Scheduling Policies
Dynamic processor partitioning for multiprogrammed multiprocessor systems
Dynamic processor partitioning for multiprogrammed multiprocessor systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
| Hi-index | 0.00 |
Soft real-time environments consist of jobs that must receive service within a particulartime interval. If service for a specific job is not completed by the end of its time interval,it is said to be lost; in addition, the computation time expended on the job is wasted, andany further computation for the job is discontinued. The goal of a system designer is toprovide an environment that minimizes the number of jobs that are lost. If a parallelenvironment is available, the system designer has two options: Allow each processor toexecute a job individually, or let multiple processors cooperate in executing a job. Thisarticle shows, for two classes of static allocation policies, that simple comparativeanalytical models may be used to indicate which option minimizes the number of lost jobs, as a function of workload intensity. The first class of policies, called equal partitions, statically decomposes the system into equal-size sets of processors and executes one job per partition. These policies are frequently employed in other contexts. The second class of policies, called two partitions, statically partitions the processors into two sets, not necessarily of the same size. Surprisingly, it is observed mathematically that even for statistically identical jobs, this class of policies is superior to equal partitions under certain loadings. The analysis is validated experimentally with a workload executed on a 16-node iPSC/2 hypercube.