Optimal Interconnections in the Design of Microprocessors and Digital Systems


Autoria(s): Mathialagan, A; Biswas, NN
Data(s)

01/02/1980

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/22857/1/fulltext.pdf

Mathialagan, A and Biswas, NN (1980) Optimal Interconnections in the Design of Microprocessors and Digital Systems. In: IEEE Transactions on Computers, C-29 (2). pp. 145-149.

Publicador

IEEE

Relação

http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=1675538

http://eprints.iisc.ernet.in/22857/

Palavras-Chave #Electrical Engineering
Tipo

Journal Article

PeerReviewed