Title :
Minimization of task turnaround time for distributed systems
Author :
Hsu, Chiun-Chieh ; Wang, Sheng-De ; Kuo, Te-Son
Author_Institution :
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
Abstract :
The problem of assigning a partitioned task to a distributed computing system is studied. Considering communication overhead and idle time, it is possible to develop a mathematical model to describe the cost function, which is defined to evaluate the task turnaround time, under a general model of distributed computing systems. Task assignment is formulated as a DU-mapping, which maps a directed acyclic task graph onto an undirected system graph. The search of optimal DU-mapping is NP-complete and is transformed into a state-space search problem. An approach called critical sink underestimate is developed to attain an optimal DU-mapping. This approach allows the most nodes in the state-space tree to be pruned. Experimental results reveal that this method performs very well due to its close evaluation to the real cost
Keywords :
directed graphs; distributed processing; DU-mapping; NP-complete; communication overhead; cost function; critical sink underestimate; directed acyclic task graph; distributed systems; idle time; mathematical model; minimisation; partitioned task; state-space search problem; task assignment; task turnaround time; Cost function; Distributed computing; Mathematical model; Performance evaluation; Search problems; State-space methods; Throughput; Time factors; Tree graphs; Very large scale integration;
Conference_Titel :
Computer Software and Applications Conference, 1989. COMPSAC 89., Proceedings of the 13th Annual International
Conference_Location :
Orlando, FL
Print_ISBN :
0-8186-1964-3
DOI :
10.1109/CMPSAC.1989.65047
