Title :
A Node Allocation Algorithm for Parallel Applications
Abstract :
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.
Keywords :
minimax techniques; parallel processing; resource allocation; min-max optimization problem; node allocation algorithm; parallel applications; Data structures; Information technology; Inspection; Node allocation; Task Scheduling;
Conference_Titel :
Information Technology: New Generations, 2008. ITNG 2008. Fifth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
0-7695-3099-0
DOI :
10.1109/ITNG.2008.45
