This Article 
 Bibliographic References 
 Add to: 
Optimal Interconnections in the Design of Microprocessors and Digital Systems
February 1980 (vol. 29 no. 2)
pp. 145-149
A. Mathialagan, Department of Electrical Communication Engineering, Indian Institute of Science
This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.
A. Mathialagan, N.N. Biswas, "Optimal Interconnections in the Design of Microprocessors and Digital Systems," IEEE Transactions on Computers, vol. 29, no. 2, pp. 145-149, Feb. 1980, doi:10.1109/TC.1980.1675538
Usage of this product signifies your acceptance of the Terms of Use.