Optimal task assignment in linear array networks

Author

Lee, Cheol-Hoon ; Lee, Dongmyun ; Kim, Myunghwan

Author_Institution

Dept. of Electr. Eng., Korea Adv. Inst. for Sci. & Technol., Seoul, South Korea

Volume

41

Issue

7

fYear

1992

fDate

7/1/1992 12:00:00 AM

Firstpage

877

Lastpage

880

Abstract

The problem of assigning tasks to the processors of a distributed computing system such that the sum of execution and communication costs is minimized is discussed. This problem is known to be NP-complete in the general case, and thus intractable for systems with a large number of processors. H.S. Stone´s (1977) network flow approach for a two-processor system is extended to the case for a linear array of any number of processors. The task assignment problem for a linear array network is first transformed into the two-terminal network flow problem, and then solved by applying the Goldberg-Tarjan (1987) network flow algorithm in time no worse than O(n²m ³ log n), where n and m are the number of processors and the number of tasks, respectively

Keywords

computational complexity; computer networks; distributed processing; NP-complete; communication costs; distributed computing system; linear array networks; network flow approach; optimal task assignment; task assignment; two-terminal network flow problem; Bonding; Distributed computing; Fault tolerance; Hypercubes; Intelligent networks; Labeling; Multiprocessor interconnection networks; Network topology; Parallel processing; Visualization;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.256461

Filename

256461