Issue No. 03 - March (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.277786
<p>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.</p>
Index Termsresource allocation; multiprocessing programs; hypercube networks; real-time systems;static processor allocation; soft real-time multiprocessor environment; parallelenvironment; static allocation policies; equal partitions; two partitions; 16-node iPSC/2hypercube
B. Carlson and L. Dowdy, "Static Processor Allocation in a Soft Real-Time Multiprocessor Environment," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 316-320, 1994.