This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Assignment of Job Modules onto Array Processors
July 1987 (vol. 36 no. 7)
pp. 888-891
K. Fukunaga, Department of Electrical Engineering, College of Engineering, University of Osaka Prefecture
This paper deals with the optimum assignment of job modules onto array processors. In array processors it is important to assign job modules onto processors such that the modules that communicate with each other are assigned to adjacent processors, because communication overhead increases as communications occur between processors that are remotely connected. We propose an efficient algorithm to solve this assignment problem for a specific array of processors. The algorithm reduces the quadratic problem to a solvable linear problem that produces a good, but not necessarily optimal solution. This is followed by a phase of iterations in which the solution is improved by small perturbation of the assignment.
Index Terms:
job modules, Array processors, assignment problem, distributed processing, graph space, heuristic algorithm
Citation:
K. Fukunaga, S. Yamada, T. Kasai, "Assignment of Job Modules onto Array Processors," IEEE Transactions on Computers, vol. 36, no. 7, pp. 888-891, July 1987, doi:10.1109/TC.1987.1676984
Usage of this product signifies your acceptance of the Terms of Use.