The Community for Technology Leaders
Green Image
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
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. Langston and M. Fellows, "Processor Utilization in a Linearly Connected Parallel Processing System," in IEEE Transactions on Computers, vol. 37, no. , pp. 594-603, 1988.
92 ms
(Ver 3.3 (11022016))