Multiport memory based data path allocation focusing on interconnection optimization

Jer-Min Jou, Ren Der Chen, Shiann Rong Kuang

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

A method based on the 0-1 integer linear programming (ILP) model aiming primarily at minimizing the cost of interconnections is proposed for solving the data path allocation problem using multiport memories. The interconnection elements are generally composed of buses, multiplexers, and tri-state buffers. After solving the operation binding problem, we first find the number of buses required. Then we deal with the multiport memory allocation problem simultaneously minimizing the cost of multiplexers and tri-state buffers. From the solution quality and execution time of the experimental results, we see that our method is suitable for solving data path allocation problem using multiport memories when the cost of interconnections is first considered.

Original languageEnglish
Pages (from-to)45-48
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume1
Publication statusPublished - 1994 Dec 1
EventProceedings of the 1994 IEEE International Symposium on Circuits and Systems. Part 3 (of 6) - London, England
Duration: 1994 May 301994 Jun 2

Fingerprint

Data storage equipment
Storage allocation (computer)
Costs
Linear programming

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{2f87772da0894904ad32dbf0fe2bf44c,
title = "Multiport memory based data path allocation focusing on interconnection optimization",
abstract = "A method based on the 0-1 integer linear programming (ILP) model aiming primarily at minimizing the cost of interconnections is proposed for solving the data path allocation problem using multiport memories. The interconnection elements are generally composed of buses, multiplexers, and tri-state buffers. After solving the operation binding problem, we first find the number of buses required. Then we deal with the multiport memory allocation problem simultaneously minimizing the cost of multiplexers and tri-state buffers. From the solution quality and execution time of the experimental results, we see that our method is suitable for solving data path allocation problem using multiport memories when the cost of interconnections is first considered.",
author = "Jer-Min Jou and Chen, {Ren Der} and Kuang, {Shiann Rong}",
year = "1994",
month = "12",
day = "1",
language = "English",
volume = "1",
pages = "45--48",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Multiport memory based data path allocation focusing on interconnection optimization. / Jou, Jer-Min; Chen, Ren Der; Kuang, Shiann Rong.

In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 1, 01.12.1994, p. 45-48.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Multiport memory based data path allocation focusing on interconnection optimization

AU - Jou, Jer-Min

AU - Chen, Ren Der

AU - Kuang, Shiann Rong

PY - 1994/12/1

Y1 - 1994/12/1

N2 - A method based on the 0-1 integer linear programming (ILP) model aiming primarily at minimizing the cost of interconnections is proposed for solving the data path allocation problem using multiport memories. The interconnection elements are generally composed of buses, multiplexers, and tri-state buffers. After solving the operation binding problem, we first find the number of buses required. Then we deal with the multiport memory allocation problem simultaneously minimizing the cost of multiplexers and tri-state buffers. From the solution quality and execution time of the experimental results, we see that our method is suitable for solving data path allocation problem using multiport memories when the cost of interconnections is first considered.

AB - A method based on the 0-1 integer linear programming (ILP) model aiming primarily at minimizing the cost of interconnections is proposed for solving the data path allocation problem using multiport memories. The interconnection elements are generally composed of buses, multiplexers, and tri-state buffers. After solving the operation binding problem, we first find the number of buses required. Then we deal with the multiport memory allocation problem simultaneously minimizing the cost of multiplexers and tri-state buffers. From the solution quality and execution time of the experimental results, we see that our method is suitable for solving data path allocation problem using multiport memories when the cost of interconnections is first considered.

UR - http://www.scopus.com/inward/record.url?scp=0028553452&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028553452&partnerID=8YFLogxK

M3 - Conference article

VL - 1

SP - 45

EP - 48

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -