David Szczesny, Anas Showk, S. Hessel, A. Bilgic, Uwe Hildebrand, V. Frascolla
{"title":"Performance analysis of LTE protocol processing on an ARM based mobile platform","authors":"David Szczesny, Anas Showk, S. Hessel, A. Bilgic, Uwe Hildebrand, V. Frascolla","doi":"10.1109/SOCC.2009.5335678","DOIUrl":"https://doi.org/10.1109/SOCC.2009.5335678","url":null,"abstract":"In this paper we present detailed profiling results and identify the time critical algorithms of the Long Term Evolution (LTE) layer 2 (L2) protocol processing on an ARM based mobile hardware platform. Furthermore, we investigate the applicability of a single ARM processor combined with a traditional hardware acceleration concept for the significantly increased computational demands in LTE and future mobile devices. A virtual prototyping approach is adopted in order to simulate a state-of-the-art mobile phone platform which is based on an ARM1176 core. Moreover a physical layer and base station emulator is implemented that allows for protocol investigations on transport block level at different transmission conditions. By simulating LTE data rates of 100 Mbit/s and beyond, we measure the execution times in a protocol stack model which is compliant to 3GPP Rel.8 specifications and comprises the most processing intensive downlink (DL) part of the LTE L2 data plane. We show that the computing power of a single embedded processor at reasonable clock frequencies is not enough to cope with the L2 requirements of next generation mobile devices. Thereby, Robust Header Compression (ROHC) processing is identified as the major time critical software algorithm, demanding half of the entire L2 DL execution time. Finally, we illustrate that a conventional hardware acceleration approach for the encryption algorithms fails to offer the performance required by LTE and future mobile phones.","PeriodicalId":389625,"journal":{"name":"2009 International Symposium on System-on-Chip","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122757512","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. Kammler, Bastian Bauwens, E. M. Witte, G. Ascheid, R. Leupers, H. Meyr, A. Chattopadhyay
{"title":"Automatic generation of memory interfaces","authors":"D. Kammler, Bastian Bauwens, E. M. Witte, G. Ascheid, R. Leupers, H. Meyr, A. Chattopadhyay","doi":"10.1109/SOCC.2009.5335674","DOIUrl":"https://doi.org/10.1109/SOCC.2009.5335674","url":null,"abstract":"With the growing market for multi-processor system-on-chip (MPSoC) solutions, application-specific instruction-set processors (ASIPs) gain importance as they allow for a wide tradeoff between flexibility and efficiency in such a system. Their development is aided by architecture description languages (ADLs) supporting the automatic generation of architecture specific tool sets as well as synthesizable register transfer level (RTL) implementations from a single architecture model. However, these generated implementations have to be manually adapted to the interfaces of dedicated memories or memory controllers, slowing down the design space exploration regarding the memory architecture. In order to overcome this drawback, this work extends RTL code generation from ADL models with the automatic generation of memory interfaces. This is accomplished by introducing a new abstract and versatile description format for memory interfaces and their timing protocols.","PeriodicalId":389625,"journal":{"name":"2009 International Symposium on System-on-Chip","volume":"0 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130066112","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}
Jari Nikara, E. Aho, Petri A. Tuominen, Kimmo Kuusilinna
{"title":"Performance analysis of multi-channel memories in mobile devices","authors":"Jari Nikara, E. Aho, Petri A. Tuominen, Kimmo Kuusilinna","doi":"10.1109/SOCC.2009.5335661","DOIUrl":"https://doi.org/10.1109/SOCC.2009.5335661","url":null,"abstract":"Multi-channel memories can be organized in a variety of ways to optimize for different kinds of memory loads. However, their efficient configuration and management in mobile environment is not obvious. In this paper, a SystemC model of a multi-channel memory is constructed out of low-power double data rate SDRAMs. The model is simulated with sketchy load in order to gain understanding how memory access size and number of channels affect access times and power figures. The simulations confirm that applications with large data accesses benefit from the multi-channel memories. When used properly, multi-channel memories provide the capability for high throughput but do not introduce excessive overhead compared to single-channel memories in terms of energy consumption. The experiments also reveal that relatively small accesses can be extremely expensive if the memory is not properly configured. In future systems, novel policies, advanced control mechanisms, and reorganization of traditional memory management are needed to keep the power consumption manageable.","PeriodicalId":389625,"journal":{"name":"2009 International Symposium on System-on-Chip","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131483464","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}
Ewerson Carvalho, C. Marcon, Ney Laert Vilar Calazans, F. Moraes
{"title":"Evaluation of static and dynamic task mapping algorithms in NoC-based MPSoCs","authors":"Ewerson Carvalho, C. Marcon, Ney Laert Vilar Calazans, F. Moraes","doi":"10.1109/SOCC.2009.5335672","DOIUrl":"https://doi.org/10.1109/SOCC.2009.5335672","url":null,"abstract":"Task mapping is an important issue in MPSoC design. Most recent mapping algorithms perform them at design time, an approach known as static mapping. Nonetheless, applications running in MPSoCs may execute a varying number of simultaneous tasks. In some cases, applications may be defined only after system design, enforcing a scenario that requires the use of dynamic task mapping. Static mappings have as main advantage the global view of the system, while dynamic mappings normally provide a local view, which considers only the neighborhood of the mapping task. This work aims to evaluate the pros and cons of static and dynamic mapping solutions. Due to the global system view, it is expected that static mapping algorithms achieve superior performance (w.r.t. latency, congestion, energy consumption). As dynamic scenarios are a trend in present MPSoC designs, the cost of dynamic mapping algorithms must be known, and directions to improve the quality of such algorithms should be provided without increasing execution time. This quantitative comparison between static and dynamic mapping algorithms is the main contribution of this work.","PeriodicalId":389625,"journal":{"name":"2009 International Symposium on System-on-Chip","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120988089","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}
F. Campi, Ralf König, M. Dreschmann, M. Neukirchner, Damien Picard, M. Jüttner, Eberhard Schüler, A. Deledda, D. Rossi, A. Pasini, M. Hübner, J. Becker, R. Guerrieri
{"title":"RTL-to-layout implementation of an embedded coarse grained architecture for dynamically reconfigurable computing in systems-on-chip","authors":"F. Campi, Ralf König, M. Dreschmann, M. Neukirchner, Damien Picard, M. Jüttner, Eberhard Schüler, A. Deledda, D. Rossi, A. Pasini, M. Hübner, J. Becker, R. Guerrieri","doi":"10.1109/SOCC.2009.5335665","DOIUrl":"https://doi.org/10.1109/SOCC.2009.5335665","url":null,"abstract":"This paper describes the RTL-to-layout implementation of the PACT XPP-III coarse-grained reconfigurable architecture (CGRA). The implementation activity was strictly based on a hierarchical approach in order to exploit performance optimization at all levels, as well as guarantee maximum scalability and provide a portfolio of IP-blocks that could be reused to build different configurations and embodiments of the same CGRA template. The final result can be seamlessly introduced in any SoC design flow as embedded accelerator. It is designed in STMicroelectronics 90nm GP technology, occupies 42.5 mm2, delivers 13 16-bit GOPS (0.8 GOPS/mW, 10 MOPS/mW) and has a measured max frequency of 150 MHZ, requiring a measured 13 mW/MHz dynamic power, 93 mW static. A silicon prototype was also produced embedding XPP-III in a complex system-on-chip including an ARM processor as system controller as well as different ASIC blocks.","PeriodicalId":389625,"journal":{"name":"2009 International Symposium on System-on-Chip","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129611928","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}