{"title":"Table of content","authors":"S. Sally","doi":"10.7788/boehlau.9783412217020.toc","DOIUrl":"https://doi.org/10.7788/boehlau.9783412217020.toc","url":null,"abstract":"No abstract is available for this article.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123744086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Message from the Chairs","authors":"N. Chang, J. Henkel, A. Pimentel, P. Eles","doi":"10.1109/ESTMED.2010.5666974","DOIUrl":"https://doi.org/10.1109/ESTMED.2010.5666974","url":null,"abstract":"The papers in this volume forms the proceedings of the 2nd International Workshop on Network on Chip Architectures (NoCArc 2009) held on December 12, 2009, in conjunction with the 42nd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO42), December 12–16, 2009, New York, USA.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130838921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kelli Ireland, Joseph Jezak, S. Levitan, D. Chiarulli
{"title":"Scalable arbitration of partitioned bus interconnection networks in 3D-IC systems","authors":"Kelli Ireland, Joseph Jezak, S. Levitan, D. Chiarulli","doi":"10.1145/1645213.1645231","DOIUrl":"https://doi.org/10.1145/1645213.1645231","url":null,"abstract":"In this paper, we describe a scalable interconnection network architecture intended for very large multicore processors implemented on stacked chip 3D integrated circuits (3D-IC). These networks provide fully interconnected, low latency, single hop performance with wiring complexity that scales linearly with the size of the network. The enabling technology for these networks is a novel, fully distributed arbitration and control algorithm that operates solely at the edges of the network without the need for any routers within the network core. This paper is focused on a description of that algorithm. We present simulation results for average, worst-case, and per-node latencies showing that our arbitration algorithm performs efficiently, scales for a wide range of partition sizes, and effectively manages highly non-uniform traffic patterns.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131031170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Breaking adaptive multicast deadlock by virtual channel address/data FIFO decoupling","authors":"Ka-Ming Keung, A. Tyagi","doi":"10.1145/1645213.1645218","DOIUrl":"https://doi.org/10.1145/1645213.1645218","url":null,"abstract":"As computing goes to system-on-chip era, on-chip network becomes an essential infrastructure for on-chip modules (cores) communication. 2D-Mesh is the most common on-chip network topology providing high throughput point-to-point communication due to its simplicity and regularity. A well-designed 2D-Mesh wormhole router should be deadlock free while supporting multicast and adaptive routing. Unfortunately, there exists no router design providing all these characteristics concurrently. In this paper, we propose an on-chip address-data decoupled FIFO wormhole router which supports adaptive routing, native multicast and deadlock free network guarantee. For a network using a 30-flit packet, our wormhole router increases the area efficiency by 49.5% compared with a virtual cut-through router.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123514226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jesús Camacho Villanueva, J. Flich, J. Duato, H. Eberle, N. Gura, W. Olesinski
{"title":"A performance evaluation of 2D-mesh, ring, and crossbar interconnects for chip multi-processors","authors":"Jesús Camacho Villanueva, J. Flich, J. Duato, H. Eberle, N. Gura, W. Olesinski","doi":"10.1145/1645213.1645226","DOIUrl":"https://doi.org/10.1145/1645213.1645226","url":null,"abstract":"As the number of processing nodes on chip multi-processors (CMPs) keeps increasing, providing efficient communication with the on-chip interconnect becomes increasingly critical. With 32-core CMP designs on the drawing table of engineers, there is a demand for accurate simulation models that capture all the complexities and interactions of the different design layers including the application, operating system, cache hierarchy, coherency protocol, and other on-chip resources. These components cannot be modeled anymore in isolation as unpredicted performance anomalies may arise once all the system variables are taken into account. In this paper, we present a simulation framework for CMP systems, focusing our attention on the on-chip network. We show preliminary results for the choice of key network parameters (topology, flit size) with respect to the behavior and performance of applications running on top of different network configurations. This paper tries to convey the need for an overall CMP system simulator as a way to accurately characterize the actual behavior of the on-chip network.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122212632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Matos, C. Concatto, A. Kologeski, L. Carro, F. Kastensmidt, A. Susin, M. Kreutz
{"title":"Adaptive router architecture based on traffic behavior observability","authors":"D. Matos, C. Concatto, A. Kologeski, L. Carro, F. Kastensmidt, A. Susin, M. Kreutz","doi":"10.1145/1645213.1645219","DOIUrl":"https://doi.org/10.1145/1645213.1645219","url":null,"abstract":"A Network-on-Chip with large FIFO size ensures performance during the execution of different traffic flow, but unfortunately, these same buffers are the main responsible for the router total power dissipation. Another aspect is that by sizing buffers to reach higher throughput incurs in extra dissipation for the mean case, which is much more frequent. In this paper we propose the use of an adaptive router with a mechanism that, using a flow sensor, verifies during run time the behavior of the data traffic. From the observability of the data flow, the system uses a control equation that adapts itself to provide an appropriate buffer depth for each channel to sustain performance with minimum power dissipation. As applications show different traffic behavior at run-time, this solution allows one to obtain gains in throughput and latency under rather different communication loads, since the buffers slots are dynamically allocated to increase router efficiency in the NoC. With the proposed architecture the latency was 75% lower and throughput was increased 4.6 times to Xbox application, for the same buffer depth. Moreover, the adaptive router allows up to 28% power savings, while maintain the same performance of the equivalent homogeneous router.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131671809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"System-level exploration of run-time clusterization for energy-efficient on-chip communication","authors":"L. Guang, E. Nigussie, H. Tenhunen","doi":"10.1145/1645213.1645228","DOIUrl":"https://doi.org/10.1145/1645213.1645228","url":null,"abstract":"System-level exploration of run-time power clusterization for energy-efficient on-chip communication is presented. Facilitated by multiple on-chip power-delivery-networks, areas of heavy or low traffics can be dynamically identified and adaptively supplied with new power schemes. This method is superior to design-time voltage island partitioning, in dealing with unpredictable spatial and temporal variations of communication traffics in large NoCs. Architectural design of the platform and online iterative configuration process are presented. The effectiveness of the proposed approach is demonstrated quantitatively on a NoC simulator with 65 nm power models. With synthetic traffic traces characterizing various communication patterns, run-time power clusterization achieves considerable energy benefits compared to existing energy-efficient architectures ( 9%-42% lower). The latency penalty is predictable and moderately bounded with minimal area overhead. The proposed architecture presents an ideal tradeoff, prioritizing energy efficiency, for massively parallel on-chip computing.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121136063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Myong Hyon Cho, Mieszko Lis, Keun Sup Shim, M. Kinsy, S. Devadas
{"title":"Path-based, Randomized, Oblivious, Minimal routing","authors":"Myong Hyon Cho, Mieszko Lis, Keun Sup Shim, M. Kinsy, S. Devadas","doi":"10.1145/1645213.1645220","DOIUrl":"https://doi.org/10.1145/1645213.1645220","url":null,"abstract":"Path-based, Randomized, Oblivious, Minimal routing (PROM) is a family of oblivious, minimal, path-diverse routing algorithms especially suitable for Network-on-Chip applications with n×n mesh geometry. Rather than choosing among all possible paths at the source node, PROM algorithms achieve the same effect progressively through efficient, local randomized decisions at each hop. Routing is deadlock-free in all PROM algorithms when the routers have at least two virtual channels. While the approach we present can be viewed as a generalization of both ROMM and O1TURN routing, it combines the low hardware cost of O1TURN with the routing diversity offered by the most complex n-phase ROMM schemes. As all PROM algorithms employ the same hardware, a wide range of routing behaviors, from O1TURN-equivalent to uniformly path-diverse, can be effected by adjusting just one parameter, even while the network is live and continues to forward packets. Detailed simulation on a set of benchmarks indicates that, on equivalent hardware, the performance of PROM algorithms compares favorably to existing oblivious routing algorithms, including dimension-ordered routing, two-phase ROMM, and O1TURN.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134118409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Yield enhancement by robust application-specific mapping on network-on-chips","authors":"A. Choudhury, G. Palermo, C. Silvano, V. Zaccaria","doi":"10.1145/1645213.1645223","DOIUrl":"https://doi.org/10.1145/1645213.1645223","url":null,"abstract":"The current technological defect densities and production yields are a motivating factor supporting the introduction of design-for-manufacturability techniques during the high-level design of complex, embedded systems based on network-on-chips (NoCs). In this context, we tackle the problem of mapping the IPs of a multi-processing system to the NoC nodes, by taking into account the effective robustness of the system with respect to permanent faults in the interconnection network due to manufacturing defects. In particular, we introduce an application specific methodology for identifying optimal NoCs mappings which minimize the variance of the system power and latency and maximizes the probability that the actual system will work when deployed, even in presence of faulty NoC links. We provide experimental results by comparing the proposed methodology with conventional mapping approaches, by highlighting benefits and drawbacks of both techniques.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132179483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. Teuscher, Neha Parashar, M. Mote, Nolan Hergert, J. Aherne
{"title":"Wire cost and communication analysis of self-assembled interconnect models for networks-on-chip","authors":"C. Teuscher, Neha Parashar, M. Mote, Nolan Hergert, J. Aherne","doi":"10.1145/1645213.1645232","DOIUrl":"https://doi.org/10.1145/1645213.1645232","url":null,"abstract":"Building complex interconnect networks in a bottom-up way, for example by using self-assembling techniques, represents an ultimate challenge for building large-scale emerging computing devices. Due do the general lack of precise control over many self-assembling techniques, such interconnects are expected to be largely unstructured. In this paper we introduce two simple wire growth models for non-classical self-assembled network topologies. The models generate different unstructured and physically plausible network topologies. We then investigate the design trade-offs of such interconnect networks within a network-on-chip (NoC) simulation framework. In particular, we analyze the network's wiring cost and the communication properties by varying the framework's parameters. Our primary goal is to (1) investigate and understand the characteristics of such self-assembled networks and (2) to ultimately use these insights to tune experimental self-assembly process parameters. The quantitative simulation results show that unstructured NoC topologies obtained by the growth models show specific wire-length distributions that are beneficial for the communication and minimize the wiring cost. To support this result, we have also used an evolutionary optimization framework for the evolution of NoC topologies under given cost and communication requirements. Our results and the evaluation framework have implications for the design of interconnect architectures.","PeriodicalId":138993,"journal":{"name":"2009 2nd International Workshop on Network on Chip Architectures","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126937572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}