This Article 
 Bibliographic References 
 Add to: 
Processor Utilization in a Linearly Connected Parallel Processing System
May 1988 (vol. 37 no. 5)
pp. 594-603
The authors study the problem of assigning program fragments to a system of processing elements in which low-level operations are performed in parallel. Such a system is said to be linearly connected if each processing element can only communicate directly with its two nearest neighbors. They show that the problem of determining whether a perfect assignment exists is NP-complete but can be solv

[1] E. G. Coffman, Jr., Ed.,Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
[2] E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, "Approximation algorithms for bin packing--An updated survey," Bell Telephone Lab. Tech. Rep., 1983.
[3] M. R. Fellows, "Encoding graphs in graphs," Comput. Sci. Tech. Rep., Univ. California, San Diego, 1985.
[4] M. R. Fellows, D. K. Friesen, and M. A. Langston, "Linearly connected parallel processing systems with local memory," in preparation.
[5] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[6] M. A. Langston, "A study of composite heuristic algorithms,"J. Oper. Res. Soc., vol. 38, pp. 539-544, 1987.
[7] C. E. McDowell and W. F. Appelbe, "Processor scheduling for linearly connected parallel processors,"IEEE Trans. Comput., vol. C-35, pp. 632-638, 1986.
[8] C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.

Index Terms:
processor utilization; parallel processing; linearly connected parallel processing system; assigning program fragments; perfect assignment; NP-complete; execution time; near-optimal heuristic algorithms; worst-case performance; computability; heuristic programming; parallel processing; parallel programming.
M.R. Fellows, M.A. Langston, "Processor Utilization in a Linearly Connected Parallel Processing System," IEEE Transactions on Computers, vol. 37, no. 5, pp. 594-603, May 1988, doi:10.1109/12.4610
Usage of this product signifies your acceptance of the Terms of Use.