| C. Chang and P. Mohapatra, "An Adaptive Job Allocation Method for Multicomputer Systems, " Int'l Conf. Distributed Computing Systems, pp. 224-231, 1996. |
....executing it, increases due to the parallel execution overhead. Numerous attempts have been made on utilizing the scalability of tasks effectively. The goal of these scheduling algorithms is to minimize the total completion time of all tasks [19 21] or to reduce the mean response time of tasks [22 24, 16] by allocating a proper number of processors to each task. In this paper, we propose an on line scheduling scheme, called Maximum Workload derivative First with Fragment Elimination (MWF FE) which decides adaptively the number of processors to be allocated to each scalable real time task ....
C. Chang and P. Mohapatra, "An Adaptive Job Allocation Method for Multicomputer Systems, " Int'l Conf. Distributed Computing Systems, pp. 224-231, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC