Abstract
In this paper, we propose an algorithm to improve Bokhari's method for allocation of chain-like task on chain-like network computers. The time complexity of our algorithm is reduced from the time complexity O(m <sup>3</sup> n) of Bokhari's to O(min(m,n)m <sup>2</sup> ), where m is the number of modules and n is the number of processors. In addition, our algorithm relaxes Bokhari's constraints of all processors to be utilized and n < m. © 1990.