Task assignment in distributed computing systems

We introduce a technique based on the problem-space genetic algorithm (PSGA) for the static task assignment problem in homogeneous distributed computing systems to reduce the task turnaround time and to increase the throughput of the system by properly balancing the load and reducing the interprocessor communication time among processors. The PSGA based approach combines the power of genetic algorithms, a global search method, with simple and fast problem-specific heuristic to search a large solution space efficiently and effectively to find the best possible solution in an acceptable cpu time. The proposed scheme is applied to a digital signal processing (DSP) system consisting of 119 tasks to illustrate its balancing properties and computational advantage on a large system. The proposed scheme offers 12%-30% improvement in the assignment cost as compared to the previous best known results for the DSP example.<<ETX>>

[1]  Jake K. Aggarwal,et al.  A Generalized Scheme for Mapping Parallel Algorithms , 1993, IEEE Trans. Parallel Distributed Syst..

[2]  Masahiro Tsuchiya,et al.  A Task Allocation Model for Distributed Computing Systems , 1982, IEEE Transactions on Computers.

[3]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[4]  Wesley W. Chu,et al.  Task Allocation in Distributed Data Processing , 1980, Computer.

[5]  S. Arunkumar,et al.  A randomized heuristics for the mapping problem: The genetic approach , 1992, Parallel Comput..

[6]  Pinaki Mazumder,et al.  A genetic approach to standard cell placement using meta-genetic parameter optimization , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Frank Hielscher,et al.  Datapath synthesis using concurrent scheduling and allocation based on problem-space genetic algorithms , 1992 .

[8]  A. K. Sarje,et al.  Heuristic model for task allocation in distributed computer systems , 1991 .

[9]  Virginia Mary Lo,et al.  Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[10]  Tevfik Bultan,et al.  A New Mapping Heuristic Based on Mean Field Annealing , 1992, J. Parallel Distributed Comput..

[11]  Ching-Chi Hsu,et al.  Task assignment scheduling by simulated annealing , 1990, IEEE TENCON'90: 1990 IEEE Region 10 Conference on Computer and Communication Systems. Conference Proceedings.

[12]  J. Sheild,et al.  Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing , 1987 .

[13]  Kemal Efe,et al.  Heuristic Models of Task Assignment Scheduling in Distributed Systems , 1982, Computer.

[14]  Chien-Chung Shen,et al.  A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion , 1985, IEEE Trans. Computers.

[15]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[16]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .