Subayal Khan, Jukka Saastamoinen, J. Huusko, J. Soininen, J. Nurmi
{"title":"Application Workload Modelling via Run-Time Performance Statistics","authors":"Subayal Khan, Jukka Saastamoinen, J. Huusko, J. Soininen, J. Nurmi","doi":"10.4018/JERTCS.2013040101","DOIUrl":"https://doi.org/10.4018/JERTCS.2013040101","url":null,"abstract":"Modern mobile nomadic devices for example internet tablets and high end mobile phones support diverse distributed and stand-alone applications that were supported by single devices a decade back. Furthermore the complex heterogeneous platforms supporting these applications contain multi-core processors, hardware accelerators and IP cores and all these components can possibly be integrated into a single integrated circuit chip. The high complexity of both the platform and the applications makes the design space very complex due to the availability of several alternatives. Therefore the system designer must be able to quickly evaluate the performance of different application architectures and implementations on potential platforms. The most popular technique employed nowadays is termed as system-level-performance evaluation which uses abstract workload and platform capacity models. The platform capacity models and application workload models reside at a higher abstraction-level. The platform and application workload models can be instantiated with reduced modeling effort and also operate at a higher simulation speed. This article presents a novel run-time statistics based application workload model extraction and platform configuration technique. This technique is called platform COnfiguration and woRkload generatIoN via code instrumeNtation and performAnce counters CORINNA which offers several advantages over compiler based technique called ABSINTH, and also provides automatic configuration of the platform processor models for example cache-hits and misses obtained during the application execution.","PeriodicalId":359507,"journal":{"name":"Int. J. Embed. Real Time Commun. Syst.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122678671","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":"A Buffered Dual-Access-Mode Scheme Designed for Low-Power Highly-Associative Caches","authors":"Y. Chu, M. Calagos","doi":"10.4018/jertcs.2013040103","DOIUrl":"https://doi.org/10.4018/jertcs.2013040103","url":null,"abstract":"This paper proposes a buffered dual-access-mode cache to reduce power consumption for highly-associative caches in modern embedded systems. The proposed scheme consists of a MRU most recently used buffer table and a single cache structure to implement two accessing modes, phased mode and way-prediction mode. The proposed scheme shows better access time and lower power consumption than two popular low-power caches, phased cache and way-prediction cache. The authors used Cacti and SimpleScalar simulators to evaluate the proposed cache scheme by using SPEC benchmark programs. The experimental results show that the proposed cache scheme improves the EDP energy delay product up to 40% for instruction cache and up to 42% for data cache compared to way-prediction cache, which performs better than phased cache.","PeriodicalId":359507,"journal":{"name":"Int. J. Embed. Real Time Commun. Syst.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126247356","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":"Power and Latency Optimized Deadlock-Free Routing Algorithm on Irregular 2D Mesh NoC using LBDRe","authors":"R. Verma, Mohammad Ayoub Khan, Amit Zinzuwadiya","doi":"10.4018/jertcs.2013040102","DOIUrl":"https://doi.org/10.4018/jertcs.2013040102","url":null,"abstract":"Efficient routing is challenging and crucial problem in the irregular mesh NoC topologies because of increasing hardware cost and routing tables. In this paper, the authors propose an efficient deadlock-free routing algorithm for irregular mesh NoCs which reduces the latency and power consumption significantly. The problem with degree priority based routing algorithm is that it cannot remove deadlocks in irregular mesh topologies. Therefore, the authors use the extended Logic Based Distributed Routing LBDRe to remove deadlock situations without using any virtual channel in the degree priority based routing algorithm. The proposed LBDRe based technique also removes the dependency on routing tables. The authors further apply odd-Even routing algorithm to LBDRe to ensure that some turns are prohibited to remove deadlocks. Experimental results show that the proposed routing algorithm reduces power consumption by 9-22% and overall average latency by 8-12% with the minimum hardware cost for the irregular mesh NoC topologies.","PeriodicalId":359507,"journal":{"name":"Int. J. Embed. Real Time Commun. Syst.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131345748","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":"International Symposium on System-on-Chip 2011","authors":"J. Nurmi","doi":"10.4018/JERTCS.2012100105","DOIUrl":"https://doi.org/10.4018/JERTCS.2012100105","url":null,"abstract":"","PeriodicalId":359507,"journal":{"name":"Int. J. Embed. Real Time Commun. Syst.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122130499","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}
Fabrício Alves Barbosa da Silva, D. Moura, J. F. Galdino
{"title":"Classes of Attacks for Tactical Software Defined Radios","authors":"Fabrício Alves Barbosa da Silva, D. Moura, J. F. Galdino","doi":"10.4018/jertcs.2012100104","DOIUrl":"https://doi.org/10.4018/jertcs.2012100104","url":null,"abstract":"This survey presents a classification of attacks that Software Communications Architecture (SCA) compliant Software Defined Radios (SDR) can suffer. This paper also discusses how attack mitigation strategies can impact the development of a SCA-compliant software infrastructure and identifies several research directions related to SDR security. The SCA standard was originally proposed by the Joint Tactical Radio System program (JTRS), which is a program for the development of military tactical radios sponsored by the US Department of Defense. The classification presented in this paper is based on attack results on the radio set, which can also be associated with the adversary’s objectives when planning an intrusion. The identification of classes of attacks on a radio, along with the associated threats and vulnerabilities, is the first step in engineering a secure SDR system. It precedes the identification of security requirements and the development of security mechanisms. Therefore, the identification of classes of attacks is a necessary step for the definition of realistic and relevant security requirements.","PeriodicalId":359507,"journal":{"name":"Int. J. Embed. Real Time Commun. Syst.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117280789","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":"A Simulation Tool for Real-Time Hybrid-Cooperative Positioning Algorithms","authors":"F. Sottile, Mauricio A. Caceres, M. Spirito","doi":"10.4018/jertcs.2012070105","DOIUrl":"https://doi.org/10.4018/jertcs.2012070105","url":null,"abstract":"The authors propose a simulation tool ST able to test real-time hybrid GNSS/terrestrial and cooperative positioning algorithms that fuse both pseudorange measurements from satellites and terrestrial range measurements based on radio frequency communication performed between nodes of a wireless network. In particular, the ST simulates devices belonging to a peer-to-peer P2P wireless network where peers, equipped also with a GNSS receiver, cooperate among them by exchanging aiding data in order to improve both positioning accuracy and availability. Furthermore, the authors propose a method to increase the robustness of cooperative algorithms based on the estimated position covariance matrix. In particular, the proposed approach assures a faster estimation convergence and improved accuracy while lowering computational complexity and network traffic. Finally, the authors tested the sensitivity of the implemented positioning algorithms through the ST in two different scenarios, first in presence of high level of pseudorange noise and then in presence of a malicious peer in the P2P network.","PeriodicalId":359507,"journal":{"name":"Int. J. Embed. Real Time Commun. Syst.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114456274","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":"Recent Trends in Interference Mitigation and Spoofing Detection","authors":"F. Dovis, L. Musumeci, N. Linty, M. Pini","doi":"10.4018/jertcs.2012070101","DOIUrl":"https://doi.org/10.4018/jertcs.2012070101","url":null,"abstract":"This paper gives a classification of intentional and unintentional threats, such as interference, jamming and spoofing, and discusses some of the recent trends concerning techniques for their detection and mitigation. Despite the fact that these phenomena have been studied since the early stages of Global Positioning System GPS, they were mainly addressed for military applications of Global Navigation Satellite Systems GNSS. However, a wide range of recent civil applications related to user's safety or featuring financial implications would be deeply affected by interfering or spoofing signals intentionally created. For such a reason, added value processing algorithms are being studied and designed, in order to improve accuracy and robustness of the receiver and to assure the reliability of the estimated position and time solution.","PeriodicalId":359507,"journal":{"name":"Int. J. Embed. Real Time Commun. Syst.","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127525078","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}