Previous [1] [2] [3] [4] [5] [6] [7] [8]

Journal of Inforamtion Science and Engineering, Vol.10 No.1, pp.81-97 (March 1994)
A Branch-and-Bound Algorithm for Reliability-Oriented
Tack Assignment in Bus Network Systems

Rong-Hong Jan and Shiow-Ling Chen
Department of Computer and Information Science
Natioal Chiao Tung University
Hsinchu, Taiwan 300, R.O.C.

Optimal assignment of program modules in bus network systems is studied in this paper. The proposed model maximizes system reliability and maibtains the precedence relationship among the program modules for a task consisting of m program modules, executed on n peocessors. A branch-and-bound algorithm has been developed fo solving this assignment problem, and the approach is illustrared by an example. The computational results are given to show the effectiveness of the algorithm.

Keywords: task assignment, branch-and-bound algorithm, distributed processing, state-space search, system reliability, precedence relationship

Received July 10, 1992; revised January 18, 1993.
Communicated by Richard C. T. Lee.