论文信息 - On module assignment in two-processor distributed systems: a modified algorithm

On module assignment in two-processor distributed systems: a modified algorithm

In this method an arbitrary module of the program is considered for allocation to a processor or for being fused with another module. The method has been said to produce an optimal allocation for a two-processor distributed system when the intermodule communication pattern forms a tree

Anil K. Sarje | G. Sagar | Kamal U. Ahmed

[1] Sol M. Shatz,et al. Introduction to Distributed-Software Engineering , 1987, Computer.

[2] Shahid H. Bokhari,et al. Partitioning Problems in Parallel, Pipelined, and Distributed Computing , 1988, IEEE Trans. Computers.

[3] Shahid H. Bokhari,et al. Control of Distributed Processes , 1978, Computer.

[4] Donald F. Towsley,et al. Allocating programs containing branches and loops within a multiple processor system , 1986, IEEE Transactions on Software Engineering.

[5] Masahiro Tsuchiya,et al. A Task Allocation Model for Distributed Computing Systems , 1982, IEEE Transactions on Computers.

[6] Harold S. Stone,et al. Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[7] Wesley W. Chu,et al. Task Allocation in Distributed Data Processing , 1980, Computer.

[8] J. Sheild,et al. Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing , 1987 .

[9] S. P. Rana,et al. On Module Assignment in Two-Processor Distributed Systems , 1979, Inf. Process. Lett..