A Node Allocation Algorithm for Parallel Applications
Srinivasan Subha · 2008
This paper proposes an allocation scheme of nodes to distributed applications that minimizes the total execution time. The scheme is based on profiling. An algorithm that models the system as a min-max optimization problem is developed. The algorithm transfers nodes from faster processes to slower process by inspection of the profiled data and arrives at a solution better than existing algorithm.