The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Bandwidth-constrained mapping of cores onto NoC architectures
Open accessAbstract
We address the design of complex monolithic systems, where processing cores generate and consume a varying and large amount of data, thus bringing the communication links to the edge of congestion. Typical applications are in the area of multi-media processing. We consider a mesh-based networks on chip (NoC) architecture, and we explore the assignment of cores to mesh cross-points so that the traffic on links satisfies bandwidth constraints. A single-path deterministic routing between the cores places high bandwidth demands on the links. The bandwidth requirements can be significantly reduced by splitting the traffic between the cores across multiple paths. In this paper, we present NMAP, a fast algorithm that maps the cores onto a mesh NoC architecture under bandwidth constraints, minimizing the average communication delay. The NMAP algorithm is presented for both single minimum-path routing and split-traffic routing. The algorithm is applied to a benchmark DSP design and the resulting NoC is built and simulated at cycle accurate level in SystemC using macros from the /spl times/pipes library. Also, experiments with six video processing applications show significant savings in bandwidth and communication cost for NMAP algorithm when compared to existing algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Networks on chips: a new SoC paradigm
Benini, L., & De Micheli, G. (2002) · Computer · doi:10.1109/2.976921 · Cited by 3,749
Self-citationEnergy-aware mapping for tile-based NoC architectures under performance constraints
Hu, J., & Marculescu, R. (2003) · Proceedings of the 2003 conference on Asia South Pacific design automation - ASPDAC · doi:10.1145/1119772.1119818 · Cited by 580
xpipesCompiler: A Tool for Instantiating Application-Specific Networks on Chip
Jalabert, A., Murali, S., Benini, L., et al. (2008) · Design, Automation, and Test in Europe · doi:10.1007/978-1-4020-6488-3_12 · Cited by 34
Self-citation
Cited by
Opinion mining and sentiment analysis
Pang, B., & Lee, L. (2008) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000011 · Cited by 6,372
Outstanding Research Problems in NoC Design: System, Microarchitecture, and Circuit Perspectives
Marculescu, R., Ogras, U. Y., Peh, L.-S., Jerger, N. E., & Hoskote, Y. (2009) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2008.2010691 · Cited by 683
NoC synthesis flow for customized domain specific multiprocessor systems-on-chip
Bertozzi, D., Jalabert, A., Murali, S., Tamhankar, R., Stergiou, S., Benini, L., & De Micheli, G. (2005) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2005.22 · Cited by 566
Self-citation
Metadata
- Authors
- Murali, S., & De Micheli, G.
- Venue
- Proceedings Design, Automation and Test in Europe Conference and Exhibition
- Publisher
- IEEE Comput. Soc
- Published
- 2004-07-20
- Pages
- 896-901
- OpenAlex
- W4253408813
- Cited by
- 485
- References
- 3
- FWCI
- 13.96
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.