{"title":"The Future of Accelerator Programming: Abstraction, Performance or Can We Have Both?","authors":"K. Rocki, Martin Burtscher, R. Suda","doi":"10.1145/2554850.2555029","DOIUrl":"https://doi.org/10.1145/2554850.2555029","url":null,"abstract":"In a perfect world, code would only be written once and would run on different devices with high efficiency. A programmer's time would primarily be spent on thinking about the algorithms and data structures, not on implementing them. To a degree, that used to be the case in the era of frequency scaling on a single core. However, due to power limitations, parallel programming has become necessary to obtain performance gains. But parallel architectures differ substantially from each other, often require specialized knowledge, and typically necessitate reimplementation and fine tuning of application code. These slow tasks frequently result in situations where most of the time is spent reimplementing old rather than writing new code. The goal of our research is to find new programming techniques that increase productivity, maintain high performance, and provide abstraction to free the programmer from these unnecessary and time-consuming tasks. However, such techniques usually come at the cost of substantial performance degradation. This paper investigates current approaches to portable accelerator programming, seeking to answer whether they make it possible to combine high efficiency with sufficient algorithm abstraction. It discusses OpenCL as a potential solution and presents three approaches of writing portable code: GPU-centric, CPU-centric and combined. By applying the three approaches to a real-world program, we show that it is at least sometimes possible to run exactly the same code on many different devices with minimal performance degradation using parameterization. The main contributions of this paper are an extensive review of the current state-of-the-art regarding the stated problem and our original approach of addressing this problem with a generalized excessive-parallelism approach.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117120325","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":"Genetic Algorithm Based Weight Optimization for Minimizing Sidelobes in Distributed Random Array Beamforming","authors":"S. Jayaprakasam, S. Rahim, C. Leow, K. Ramanathan","doi":"10.1109/ICPADS.2013.111","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.111","url":null,"abstract":"This paper proposes solution to optimize the peak side lobes level (PSLL) in a distributed random antenna array (RAA) when locations of the nodes in the array cannot be manipulated. Using the conventional beam forming method, RAA produces a poor beam pattern with high side lobe level, which greatly reduces the performance and the efficiency of the antenna. Existing literature focuses on finding the best position of antenna placement in RAA to lower the side lobes. This is not feasible when the user has no autonomy over the position of the antenna elements. Our proposed solution achieves beam pattern with much lower PSLL regardless of the array size and number of nodes in the array. The proposed method also enables up to 40% of energy savings when the size of array is small and 20% of savings when bigger array size is considered.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115117131","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":"Peer-to-Peer Group k-Nearest Neighbours in Mobile Ad-Hoc Networks","authors":"Thao P. Nghiem, D. Green, D. Taniar","doi":"10.1109/ICPADS.2013.34","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.34","url":null,"abstract":"The increasing use of location-based services has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Group k-Nearest Neighbour (GkNN). A typical example of a GkNN query is finding one or many nearest meeting places for a group of people. Existing methods mostly rely on a centralised base station. However, mobile P2P systems offer many benefits, including self-organization, fault-tolerance and load-balancing. In this study, we propose and evaluate a novel P2P algorithm focusing on GkNN queries, in which mobile query objects and static objects of interest are of two different categories. The algorithm is evaluated in the MiXiM simulation framework with both real and synthetic datasets. The results show the practical feasibility of the P2P approach for solving GkNN queries for mobile networks.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115504098","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}
Shangguang Wang, Zhipiao Liu, Zibin Zheng, Qibo Sun, Fangchun Yang
{"title":"Particle Swarm Optimization for Energy-Aware Virtual Machine Placement Optimization in Virtualized Data Centers","authors":"Shangguang Wang, Zhipiao Liu, Zibin Zheng, Qibo Sun, Fangchun Yang","doi":"10.1109/ICPADS.2013.26","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.26","url":null,"abstract":"A critical research issue is to lower the energy consumption of a virtualized data center by means of virtual machine placement optimization while satisfying the resource requirements of the cloud services. In this paper, we focus on different existing schemes and on the energy-aware virtual machine placement optimization problem of a heterogeneous virtualized data center. We attempt to explore a better alternative approach to minimizing the energy consumption, and we observe that particle swarm optimization (PSO) has considerable potential. However, the PSO must be improved to solve an optimization problem. The improvement includes redefining the parameters and operators of the PSO, adopting an energy-aware local fitness first strategy and designing a novel coding scheme. Using the improved PSO, an optimal virtual machine replacement scheme with the lowest energy consumption can be found. Experimental results indicate that our approach significantly outperforms other approaches, and can lessen 13%-23% energy consumption in the context of this paper.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127306723","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}
Ao Zhou, Shangguang Wang, Qibo Sun, Hua Zou, Fangchun Yang
{"title":"Dynamic Virtual Resource Renting Method for Maximizing the Profits of a Cloud Service Provider in a Dynamic Pricing Model","authors":"Ao Zhou, Shangguang Wang, Qibo Sun, Hua Zou, Fangchun Yang","doi":"10.1109/ICPADS.2013.28","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.28","url":null,"abstract":"With an increasing number of cloud service providers (CSP) delivering services to customers from the cloud, maximizing the profits of CSPs becomes a critical problem. Existing methods are difficult to solve the problem because they do not make full use of temporal price differences. This paper introduces a dynamic virtual resource renting method that attempts to dynamically adjust the virtual resource rental strategy according to price distribution and task urgency. We first pretreat the historical price series and adopt the outlier detection technique to filter the extreme price. Then, considering task urgency and price distribution, we design a weak equilibrium operator to calculate the acceptable price for each type of virtual resource. All types of virtual resources that are at an acceptable price are inserted into a set. Finally, we design a novel rental decision-making algorithm to select the most profitable resource from the set. We provide an extensive evaluation of our method using Amazon EC2 spot price dataset and normally distributed price dataset. The results demonstrate the effectiveness of our method.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"391 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131865879","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}
Mohammad Roohitavaf, Reza Entezari-Maleki, A. Movaghar
{"title":"Availability Modeling and Evaluation of Cloud Virtual Data Centers","authors":"Mohammad Roohitavaf, Reza Entezari-Maleki, A. Movaghar","doi":"10.1109/.119","DOIUrl":"https://doi.org/10.1109/.119","url":null,"abstract":"Availability of the service delivered by cloud providers is one of the most important QoS factors of the service level agreements between providers and customers. Since current Infrastructure-as-a-Service providers use virtualization technology to manage data centers, virtual data centers (VDCs) have become a popular infrastructure for cloud computing. In order to study the service availability, a stochastic activity network (SAN) model is presented in this paper. The proposed SAN model can be appropriately used to investigate the impact of different characteristics and policies on service availability of VDCs.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116887729","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}
K. Krommydas, Muhsen Owaida, C. Antonopoulos, Nikolaos Bellas, Wu-chun Feng
{"title":"On the Portability of the OpenCL Dwarfs on Fixed and Reconfigurable Parallel Platforms","authors":"K. Krommydas, Muhsen Owaida, C. Antonopoulos, Nikolaos Bellas, Wu-chun Feng","doi":"10.1109/ICPADS.2013.71","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.71","url":null,"abstract":"The proliferation of heterogeneous computing systems presents the parallel computing community with the challenge of porting legacy and emerging applications to multiple processors with diverse programming abstractions. OpenCL is a vendor-agnostic and industry-supported programming model that offers code portability on heterogeneous platforms, allowing applications to be developed once and deployed \"anywhere.\" In this paper, we use the OpenCL implementation of the Open Dwarfs, a benchmark suite that captures patterns of computation and communication common to classes of important applications, as delineated by Berkeley's Dwarfs. We evaluate portability across multicore CPU, GPU, APU (CPUs+GPUs on a die), the Intel Xeon Phi co-processor, and the FPGA. To realize FPGA portability, we exploit SOpenCL (Silicon OpenCL), a CAD tool that automatically converts OpenCL kernels to customizable hardware accelerators. We show that a single, unmodified OpenCL code base, i.e., Open Dwarfs, can be effectively used to target multiple, architecturally diverse platforms.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"78 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120856133","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":"Feature Reduction for Anomaly Detection in Manufacturing with MapReduce GA/kNN","authors":"Sikana Tanupabrungsun, T. Achalakul","doi":"10.1109/ICPADS.2013.114","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.114","url":null,"abstract":"Manufacturing data is an important source of knowledge that can be used to enhance the production capability. The detection of the causes of defects may possibly lead to an improvement in production. However, the production records generally contain an enormous set of features. It is almost impossible in practice to monitor all features at once. This research proposes the feature reduction technique, which is designed to identify a subset of informative features that are representatives of the whole dataset. In our methodology, manufacturing data are pre-processed and adopted as inputs. Subsequently, the feature selection process is performed by wrapping Genetic Algorithm (GA) with the k-Nearest Neighborhood (kNN) classifier. To improve the performance, the proposed technique was parallelized with MapReduce. The results show that the number of features can be reduced by 50% with 83.12% accuracy. In addition, with MapReduce on the cloud, the performance can be increased by 17.5 times.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132509099","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. Boito, Rodrigo Kassick, P. Navaux, Y. Denneulin
{"title":"AGIOS: Application-Guided I/O Scheduling for Parallel File Systems","authors":"F. Boito, Rodrigo Kassick, P. Navaux, Y. Denneulin","doi":"10.1109/ICPADS.2013.19","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.19","url":null,"abstract":"In this paper, we improve the performance of server-side I/O scheduling on parallel file systems by transparently including information about the applications' access patterns. Server-side I/O scheduling is a valuable tool on multiapplication scenarios, where the applications' spatial locality suffers from interference caused by concurrent accesses to the file system. We present AGIOS, an I/O scheduling library for parallel file systems. We guide scheduler's decisions by including information about the applications' future requests. This information is obtained from traces generated by the scheduler itself, without changes in application or file system. Our approach shows performance improvements under different workloads of 46.3% on average when compared to a scenario without an I/O scheduler, and of 25.1% when compared to a scheduler which does not use information about future accesses.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127844694","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}
Yao-Chung Fan, Wei Hong Lee, Cheng Teng Iam, Gia Hao Syu
{"title":"Indoor Place Name Annotations with Mobile Crowd","authors":"Yao-Chung Fan, Wei Hong Lee, Cheng Teng Iam, Gia Hao Syu","doi":"10.1109/ICPADS.2013.98","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.98","url":null,"abstract":"With the popularity of mobile devices, numerous mobile applications have been and will continue to be developed for various interesting usage scenarios. Riding this trend, recent research community envisions a novel information retrieving and information-sharing platform, which views the users with mobile devices and being willing to accept crowd sourcing tasks as crowd sensors. With the neat idea, a set of crowd sensors applications have emerged. Among the applications, the geospatial information systems based on crowd sensors show significant potentials beyond traditional ones by providing real time geospatial information. In the applications, user positioning is of great importance. However, existing positioning techniques have their own disadvantages. In this paper, we study using pervasive Wi-Fi access point as a position indicator. The major challenge for using Wi-Fi access point is that there is no mechanism for mapping observed Wi-Fi signals to human-defined places. To this end, our idea is to employ crowd sourcing model to perform place name annotations by mobile participants to bridge the gap between signals and human-defined places. In this paper, we propose schemes for effectively enabling based-based place name annotation, and conduct real trials with recruited participants to study the effectiveness of the proposed schemes. The experiment results demonstrate the effectiveness of the proposed schemes over existing solutions.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126470362","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}