{"title":"How Much Does a VM Cost? Energy-Proportional Accounting in VM-Based Environments","authors":"Mascha Kurpicz-Briki, Anne-Cécile Orgerie, Anita Sobe","doi":"10.1109/PDP.2016.70","DOIUrl":"https://doi.org/10.1109/PDP.2016.70","url":null,"abstract":"The costs of current data centers are mostly driven by their energy consumption (specifically by the air conditioning, computing and networking infrastructure). Yet, current pricing models are usually static and rarely consider the facilities' energy consumption per user. The challenge is to provide a fair and predictable model to attribute the overall energy costs per virtual machine (VM). Current pay-as-you-go models of Cloud providers allow users to easily know how much their computing will cost. However, this model is not fully transparent as to where the costs come from (e.g., energy). In this paper we introduce EPAVE, a model for Energy-Proportional Accounting in VM-based Environments. EPAVE allows transparent, reproducible and predictive cost calculation for users and for Cloud providers. We show these characteristics of EPAVE by a number of use cases in heterogeneous data centers and discuss the applicability of EPAVE.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123432111","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":"Distributed Differentially Private Stochastic Gradient Descent: An Empirical Study","authors":"István Hegedüs, Márk Jelasity","doi":"10.1109/PDP.2016.19","DOIUrl":"https://doi.org/10.1109/PDP.2016.19","url":null,"abstract":"In fault-prone large-scale distributed environments stochastic gradient descent (SGD) is a popular approach to implement machine learning algorithms. Data privacy is a key concern in such environments, which is often addressed within the framework of differential privacy. The output quality of differentially private SGD implementations as a function of design choices has not yet been thoroughly evaluated. In this study, we examine this problem experimentally. We assume that every data record is stored by an independent node, which is a typical setup in networks of mobile devices or Internet of things (IoT) applications. In this model we identify a set of possible distributed differentially private SGD implementations. In these implementations all the sensitive computations are strictly local, and any public information is protected by differentially private mechanisms. This means that personal information can leak only if the corresponding node is directly compromised. We then perform a set of experiments to evaluate these implementations over several machine learning problems with both logistic regression and support vector machine (SVM) loss functions. Depending on the parameter setting and the choice of the algorithm, the performance of the noise-free algorithm can be closely approximated by differentially private variants.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114893403","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 Cluster-Based Method to Detect and Correct Anomalies in Sensor Data of Embedded Systems","authors":"Roghayeh Mojarad, Hossain Kordestani, H. Zarandi","doi":"10.1109/PDP.2016.104","DOIUrl":"https://doi.org/10.1109/PDP.2016.104","url":null,"abstract":"This paper presents a method to detect and correct anomalies in embedded systems. The proposed method consists of three phases: 1) Training, 2) Anomaly detection, and 3) Anomaly Correction. In the training phase, the method constructs different clusters so that each cluster has a number of similar members, similarity values of the members for a cluster to each others are not less than a predefined similarity threshold. The similarity values are calculated by various similarity functions. During detection phase, if an event in testing data does not belong to any cluster, an anomaly is detected. In correction phase, some similarity functions are used which select a suitable sequence that meets the required constrains to be a normal sequence. Evaluation of the proposed method has been done based on correction coverage and hardware overheads such as power consumption, area, and delay overhead. The window size of corrector and the number of injected anomalies varied between 3 and 5, 1 and 7, respectively. The results of experiments on 7000 benchmarks show that this correction method can correct 70.36% of anomalies on the average. Power consumption, area, and delay overhead in cluster-based method are on average 318.47μw, 2.98μm2, and 0.09 ns, respectively.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129509915","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":"QuLa: Service Selection and Forwarding Table Population in Service-Centric Networking Using Real-Life Topologies","authors":"Pieter Smet, B. Dhoedt, P. Simoens","doi":"10.1109/PDP.2016.11","DOIUrl":"https://doi.org/10.1109/PDP.2016.11","url":null,"abstract":"The amount of services located in the network has drastically increased over the last decade which is why more and more datacenters are located at the network edge, closer to the users. In the current Internet it is up to the client to select a destination using a resolution service (Domain Name System, Content Delivery Networks). In the last few years, research on Information-Centric Networking (ICN) suggests to put this selection responsibility at the network components, routers find the closest copy of a content object using the content name as input. We extend the principle of ICN to services, service routers forward requests to service instances located in datacenters spread across the network edge. To solve this problem, we first present a service selection algorithm based on both server and network metrics. Next, we describe a method to reduce the state required in service routers while minimizing the performance loss caused by this data reduction. Simulation results based on real-life networks show that we are able to find a near-optimal load distribution with only minimal state required in the service routers.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128760067","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}
Alexandra Rivero-García, Iván Santos-González, P. Caballero-Gil, C. Caballero-Gil
{"title":"VANET Event Verification Based on User Trust","authors":"Alexandra Rivero-García, Iván Santos-González, P. Caballero-Gil, C. Caballero-Gil","doi":"10.1109/PDP.2016.13","DOIUrl":"https://doi.org/10.1109/PDP.2016.13","url":null,"abstract":"The main objective of this paper is to present a real-time system to improve road safety through the use of event alerts. A collaborative community where users can share traffic warnings to help other users is here proposed. The method is based both on the verification votes of the users, and on their profiles and trust levels. Each user is assigned a trust level depending on its previous behavior. The proposal is based on the assumption that the system will be run in every driver mobile device. Thus, smartphones are the connectors between users and the community, using the cloud, and between the system and the users, using audio notifications.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"301 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115887382","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 Study of the Dynamic Characteristics of Software Implementation as an Essential Part for a Universal Description of Algorithm Properties","authors":"A. Antonov, V. Voevodin, V. Voevodin, A. Teplov","doi":"10.1109/PDP.2016.24","DOIUrl":"https://doi.org/10.1109/PDP.2016.24","url":null,"abstract":"The AlgoWiki open encyclopedia of parallel algorithmic features enables the entire computing community to work together to describe the properties of a multitude of mathematical algorithms and their implementation for various software and hardware platforms. As part of the AlgoWiki project, a structure has been suggested for providing universal descriptions of algorithm properties. Along with the first part of the description, dedicated to machine-independent properties of the algorithms, it is extremely important to study and describe the dynamic characteristics of their software implementation. By studying fundamental algorithm properties such as execution time, performance, data locality, efficiency and scalability, we can give some estimate of the potential implementation quality for a given algorithm on a specific computer and lay the foundation for comparative analysis of various computing platforms with regards to the algorithms presented in AlgoWiki.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132426727","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":"Dimension Reduction Methods for Collaborative Mobile Gossip Learning","authors":"Árpád Berta, István Hegedüs, Márk Jelasity","doi":"10.1109/PDP.2016.20","DOIUrl":"https://doi.org/10.1109/PDP.2016.20","url":null,"abstract":"Decentralized learning algorithms are very sensitive to the size of the raw data records due to the resulting large communication cost. This can, in the worst case, even make decentralized learning infeasible. Dimension reduction is a key technique to compress data and to obtain small models. In this paper, we propose a number of robust and efficient decentralized approaches to dimension reduction in the system model where each network node holds only one data record. These algorithms build on searching for good random projections. We present a thorough experimental comparison of the proposed algorithms and compare them with a variant of distributed singular value decomposition (SVD), a state-of-the-art algorithm for dimension reduction. We base our experiments on a trace of real mobile phone usage. We conclude that our method based on selecting good random projections is preferable and provides good quality results when the output is required on a very short timescale, within tens of minutes. We also present a hybrid method that combines the advantages of random projections and SVD. We demonstrate that the hybrid method offers good performance over all timescales.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134357652","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}
Iván Santos-González, P. Caballero-Gil, Alexandra Rivero-García, C. Hernández-Goya
{"title":"Distributed Communication System for Emergencies","authors":"Iván Santos-González, P. Caballero-Gil, Alexandra Rivero-García, C. Hernández-Goya","doi":"10.1109/PDP.2016.12","DOIUrl":"https://doi.org/10.1109/PDP.2016.12","url":null,"abstract":"Nowadays, most communications are centralized. In emergency or catastrophic situations, this could be a problem because common communication infrastructures could collapse or become unavailable. This is exactly the case of mobile communications because they depend on network infrastructures that can fail due to natural disasters, terrorist attacks or huge people agglomerations. This work proposes a secure distributed communication system based on cooperative peer to peer communications through the Wi-Fi Direct technology to solve this problem. A beta version of the system is already implemented in the Android platform and the obtained results are promising.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117285377","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}
Konstantina Konstantara, Nikolaos I. Dourvas, I. Georgoudas, G. Sirakoulis
{"title":"Parallel Implementation of a Cellular Automata-Based Model for Simulating Assisted Evacuation of Elderly People","authors":"Konstantina Konstantara, Nikolaos I. Dourvas, I. Georgoudas, G. Sirakoulis","doi":"10.1109/PDP.2016.133","DOIUrl":"https://doi.org/10.1109/PDP.2016.133","url":null,"abstract":"This paper presents the principles of a Cellular Automata (CA) based model that focuses on assisted evacuation processes of elderly people and its parallel implementation. It is vital in venues that it is ensured punctual and safe evacuation of all people irrespective of their physical or mental condition. Obviously, in cases of emergency, such groups of people need special care in order to abandon an area. They themselves form a special category of moving people but they can be further subcategorized regarding their mobility capabilities, according to their different ailments (mobility disabilities, vision incapabilities, hearing weaknesses or even mental difficulties). The proposed model incorporates such parameters matching elderly people to different mobility groups that are assisted by specialized personnel. Multiple simulation scenarios have been performed that validate the response of the model qualitatively and quantitatively. Moreover, due to the inherent parallelism of CA, the solution of Graphic Processing Unit (GPU) is preferred to further speed up and proceed with the parallel implementation of the presented computational CA model. The aim of such a high performance computing implementation is to transform the proposed CA model to the basic module of an elderly crowd management anticipative system. Consequently, the model leads also to useful conclusions regarding proper venue layouts for efficient evacuation response.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117221265","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}
Hana Krichene, M. Baklouti, P. Marquet, J. Dekeyser, M. Abid
{"title":"SCAC-Net: Reconfigurable Interconnection Network in SCAC Massively Parallel SoC","authors":"Hana Krichene, M. Baklouti, P. Marquet, J. Dekeyser, M. Abid","doi":"10.1109/PDP.2016.94","DOIUrl":"https://doi.org/10.1109/PDP.2016.94","url":null,"abstract":"Parallel communication plays a critical role in massively parallel systems, especially in distributed memory systems executing parallel programs on shared data. Therefore, integrating an interconnection network in these systems becomes essential to ensure data inter-nodes exchange. Choose the most effective communication structure must meet certain criteria: speed, size and power consumption. Indeed, the communication phase should be as fast as possible to avoid compromising parallel computing, using small and low power consumption modules to facilitate the interconnection network extensibility in a scalable system. To meet these criteria and based on a module reuse methodology, we chose to integrate a reconfigurable SCAC-Net interconnection network to communicate data in SCAC Massively parallel SoC. This paper presents the detailed hardware implementation and discusses the performance evaluation of the proposed reconfigurable SCAC-Net network.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117227584","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}