Static Processor Allocation in a Soft Real-Time Multiprocessor Environment
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
IN THIS PAPER WE STUDY THE BEHAVIOR OF TWO POLICIES FOR SCHEDULING CUST- OMERS WITH DEADLINES UNTIL THE BEGINNING OF SERVICE ONTO MULTIPROCESSORS. BOTH POLICIES ATTEMPT TO APPROXIMATE THE PERFORMANCE OF THE `MINIMUM LAXI- TY'' SCHEDULING POLICY WITHOUT INCURRING ITS COMPLETE OVERHEAD. THIS IS ACCOMPLISHED BY DIVIDING THE QUEUE INTO TWO QUEUES - ONE, OF MAXIMUM SIZE N