M. Ferroni, A. Cazzola, F. Trovò, D. Sciuto, M. Santambrogio
{"title":"On Power and Energy Consumption Modeling for Smart Mobile Devices","authors":"M. Ferroni, A. Cazzola, F. Trovò, D. Sciuto, M. Santambrogio","doi":"10.1109/EUC.2014.47","DOIUrl":"https://doi.org/10.1109/EUC.2014.47","url":null,"abstract":"In nowadays life, mobile phones are becoming a cheaper and smaller alternative to laptops for simple, everyday tasks. They experienced an astonishing growth in functionalities and, because of their constant presence in our life, mobile phones became fundamental for the interaction with information coming from the environment. Nevertheless, their resources are limited, both in terms of performance and power, and their availability can greatly vary over time. Especially when dealing with power consumption, mobile devices cannot disregard environment conditions and user habits. Both internal and external conditions are rapidly changing and may influence the response of the entire system, e.g., switching between network types may causes an unpredictable power consumption. In order to puzzle out all these issues, we regard the definition of a power/energy model for mobile devices as a first mandatory step. In literature, several attempts to do so are present, basing their approaches on techniques coming from different computer science fields. They differ in the way they consider hardware components, in the operating system they are suitable for and in the scope of their tests and experiments. Within this paper, we categorize techniques presented in the major works in the field, in order to be able to compare different methods, highlight open issues and give suggestions on future works.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116708791","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}
Essayas Gebrewahid, Mingkun Yang, Gustav Cedersjo, Z. Abdin, Verónica Gaspes, J. Janneck, B. Svensson
{"title":"Realizing Efficient Execution of Dataflow Actors on Manycores","authors":"Essayas Gebrewahid, Mingkun Yang, Gustav Cedersjo, Z. Abdin, Verónica Gaspes, J. Janneck, B. Svensson","doi":"10.1109/EUC.2014.55","DOIUrl":"https://doi.org/10.1109/EUC.2014.55","url":null,"abstract":"Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model of the actors that provides an ordering for testing of conditions and firing of actions. We then generate an Action Execution Intermediate Representation that is closer to a sequential imperative language like C and Java. We describe our two intermediate representations and show the feasibility and portability of our approach by compiling a CAL implementation of the Two-Dimensional Inverse Discrete Cosine Transform on a general purpose processor, on the Epiphany manycore architecture and on the Ambric massively parallel processor array.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126045395","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":"Trimming Approach of Robust Clustering for Smartphone Behavioral Analysis","authors":"Ali El Attar, R. Khatoun, Marc Lemercier","doi":"10.1109/EUC.2014.54","DOIUrl":"https://doi.org/10.1109/EUC.2014.54","url":null,"abstract":"Nowadays, smart phones get increasingly popular which also attracted hackers. With the increasing capabilities of such phones, more and more malicious softwares targeting these devices have been developed. Malwares can seriously damage an infected device within seconds. In this paper, we propose to use the trimming approaches for automatic clustering (trimmed k-means, Tclust) of smartphone's applications. They aim to identify homogenous groups of applications exhibiting similar behavior and allow to handle a proportion of contaminating data to guarantee the robustness of clustering. Then, a clustering-based detection technique is applied to compute an anomaly score for each application, leading to discover the most dangerous among them. Initial experiments results prove the efficiency and the accuracy of the used clustering methods in detecting abnormal smartphone's applications and that with a low false alerts rate.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121872829","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}
I. Christoforakis, Othon Tomoutzoglou, Dimitrios Bakoyiannis, Georgios Kornaros
{"title":"Runtime Adaptation of Embedded Tasks with A-Priori Known Timing Behavior Utilizing On-Line Partner-Core Monitoring and Recovery","authors":"I. Christoforakis, Othon Tomoutzoglou, Dimitrios Bakoyiannis, Georgios Kornaros","doi":"10.1109/EUC.2014.10","DOIUrl":"https://doi.org/10.1109/EUC.2014.10","url":null,"abstract":"As the development of heterogeneous embedded Systems-on-Chip with a multitude of hardware accelerator coprocessors creates new possibilities for evolution in aerospace, medicine, communications and consumer eras, improving reliable performance of systems is therefore increasingly important and challenging. Our contributions pertaining to this context are two-fold. We focus on enhancing reliability in the execution of coprocessor tasks with a priori known execution times by allowing an embedded system to identify anomalous software behaviors and additionally to provide rapid online reconfiguration and re-execution in run-time. We present an innovative methodology that combines hardware and software techniques for flexibility, through essentially employing low-cost on-line monitoring, debugging and real-time replacement of the failing sections of software algorithms in an embedded multi-core system. The proposed mechanisms introduce negligible performance degradation, reduced hardware cost and require minimum code instrumentation.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116726693","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 HLS-Based Toolflow to Design Next-Generation Heterogeneous Many-Core Platforms with Shared Memory","authors":"P. Burgio, A. Marongiu, P. Coussy, L. Benini","doi":"10.1109/EUC.2014.27","DOIUrl":"https://doi.org/10.1109/EUC.2014.27","url":null,"abstract":"This work describes how we use High-Level Synthesis to support design space exploration (DSE) of heterogeneous many-core systems. Modern embedded systems increasingly couple hardware accelerators and processing cores on the same chip, to trade specialization of the platform to an application domain for increased performance and energy efficiency. However, the process of designing such a platform is complex and error-prone, and requires skills on algorithmic aspects, hardware synthesis, and software engineering. DSE can partially be automated, and thus simplified, by coupling the use of HLS tools and virtual prototyping platforms. In this paper we enable the design space exploration of heterogeneous many-cores adopting a shared-memory architecture template, where communication and synchronization between the hardware accelerators and the cores happens through L1 shared memory. This communication infrastructure leverages a \"zero-copy\" scheme, which simplifies both the design process of the platform and the development of applications on top of it. Moreover, the shared-memory template perfectly fits the semantics of several high-level programming models, such as OpenMP. We provide programmers with simple yet powerful abstractions to exploit accelerators from within an OpenMP application, and propose a low-cost implementation of the necessary runtime support. An HLS-based automatic design flow is set up, to quickly explore the design space using a cycle-accurate virtual platform.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130628071","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":"pRoot: An Adaptable Wireless Sensor-Actuator Hardware Platform","authors":"H. Yi̇ği̇tler, R. Jäntti, R. Virrankoski","doi":"10.1109/EUC.2014.48","DOIUrl":"https://doi.org/10.1109/EUC.2014.48","url":null,"abstract":"The relative significance of available processing/memory resources and cost/power constraints for wireless sensor-actuator nodes depends on the application and use-case scenario. As an example, wireless automation applications usually have diverse processing/memory resource demands and energy constraints, and they bring forth development feasibility as one of the important decision criteria. For similar applications, adaptable platforms, supporting scaling between processing-memory resources and power consumption, and providing flexibility in use-case dependent hardware modifications are preferable. To the best of our knowledge, the available node platforms cannot be easily modified to support resource scaling and hardware flexibility simultaneously. In this paper, an adaptable node hardware architecture is introduced. The proposed platform can be utilized in several of roles for applications with diverse requirements, lowering the development-effort compared to alternative implementations. The practical problems of the architecture are elaborated and the details of their solutions are given. The feasibility of the introduced architecture is shown through an example implementation using off-the-shelf components, the pRoot node.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114321402","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":"Platform Device Assignment to KVM-on-ARM Virtual Machines via VFIO","authors":"Antonios Motakis, A. Rigo, D. Raho","doi":"10.1109/EUC.2014.32","DOIUrl":"https://doi.org/10.1109/EUC.2014.32","url":null,"abstract":"VFIO (Virtual Function I/O) is a Linux kernel infrastructure that allows to leverage the capabilities of modern IOMMUs to drive a device directly from user space without any additional specialized kernel driver being involved. When used by QEMU/KVM, a device can be assigned to a guest VM, allowing to transparently handle all aspects of communication with the device, including DMA mapping, MMIO range mapping, and interrupts. To support a given hardware architecture and device, VFIO will need to be able to support the type of IOMMU that is in front of the device, and the discovery and configuration mechanisms of the bus that the device is connected to. However, often no auto configuration interface is exposed on ARM, as opposed to devices on a PCI bus, commonly used on x86. In order to support VFIO on ARM, in this work platform devices support is being implemented as a VFIO_PLATFORM driver. Additionally, VFIO is being extended to support common IOMMUs found on ARM systems, such as the ARM SMMU. In this paper, we highlight the challenges met while implementing the required components, and extensions to VFIO and KVM in order to fully support device assignment to Virtual Machines on modern ARM systems.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114717676","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}
R. Braojos, I. Beretta, J. Constantin, A. Burg, David Atienza Alonso
{"title":"A Wireless Body Sensor Network for Activity Monitoring with Low Transmission Overhead","authors":"R. Braojos, I. Beretta, J. Constantin, A. Burg, David Atienza Alonso","doi":"10.1109/EUC.2014.46","DOIUrl":"https://doi.org/10.1109/EUC.2014.46","url":null,"abstract":"Activity recognition has been a research field of high interest over the last years, and it finds application in the medical domain, as well as personal healthcare monitoring during daily home- and sports-activities. With the aim of producing minimum discomfort while performing supervision of subjects, miniaturized networks of low-power wireless nodes are typically deployed on the body to gather and transmit physiological data, thus forming a Wireless Body Sensor Network (WBSN). In this work, we propose a WBSN for online activity monitoring, which combines the sensing capabilities of wearable nodes and the high computational resources of modern smart phones. The proposed solution provides different tradeoffs between classification accuracy and energy consumption, thanks to different workloads assigned to the nodes and to the mobile phone in different network configurations. In particular, our WBSN is able to achieve very high activity recognition accuracies (up to 97.2%) on multiple subjects, while significantly reducing the sampling frequency and the volume of transmitted data with respect to other state-of-the-art solutions.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124458842","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}
Florian Adamsky, S. A. Khayam, Rudolf Jäger, M. Rajarajan
{"title":"Who Is Going to Be the Next BitTorrent Peer Idol?","authors":"Florian Adamsky, S. A. Khayam, Rudolf Jäger, M. Rajarajan","doi":"10.1109/EUC.2014.50","DOIUrl":"https://doi.org/10.1109/EUC.2014.50","url":null,"abstract":"Active measurement studies show that the Peer-to-Peer (P2P) file sharing protocol Bit Torrent is highly under attack. Moreover, malicious peers can easily exploit the original seeding algorithm and therefore reduce the efficiency of this protocol. In this paper, we propose a novel seeding algorithm that requests peers to vote for their best sharing peers. Our results show that this incentive mechanism makes Bit Torrent harder to exploit without losing performance. In some situations our algorithm even outperform other seeding algorithms. The peer exchange - that comes as a side effect - reduces the dependency on a centralized tracker and increases the robustness and the efficiency. We studied the effectiveness of our approach in a real testbed comprising 32 peers.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129304327","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}
Mohamad Hammam Alsafrjalani, A. Gordon-Ross, Pablo Viana
{"title":"Minimum Effort Design Space Subsetting for Configurable Caches","authors":"Mohamad Hammam Alsafrjalani, A. Gordon-Ross, Pablo Viana","doi":"10.1109/EUC.2014.19","DOIUrl":"https://doi.org/10.1109/EUC.2014.19","url":null,"abstract":"Configurable caches can significantly reduce energy consumption by adapting the system's cache configuration to the applications' specific requirements to meet system design and optimization goals. However, large configuration design spaces require prohibitive design space exploration time (e.g., due to lengthy design space analyses, simulations, and/or evaluations) to determine the best configuration given these requirements and goals. To significantly reduce design space exploration time, we evaluate a design space subsetting method that removes energy-redundant configurations (i.e., configurations that provide similar energy savings as other configurations), thus significantly reducing the design space while still providing high-quality, energy-saving configurations. Prior work verified design space subsetting's efficacy, however, prior work required extensive design-time effort and complete a priori knowledge of the system's anticipated applications. In this work, we alleviate these limitations and significantly broaden the usability of design space subsetting. Results show that complete a priori knowledge of the anticipated applications is not necessary, and only a small set of applications representative of the anticipated applications' general domains (or applications with similar requirements) is sufficient to provide energy savings within 5.6% of the complete, unsubsetted design space.","PeriodicalId":331736,"journal":{"name":"2014 12th IEEE International Conference on Embedded and Ubiquitous Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134324767","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}