2015 14th International Symposium on Parallel and Distributed Computing最新文献

Rethinking HBase: Design and Implementation of an Elastic Key-Value Store over Log-Structured Local Volumes 重新思考HBase:基于日志结构本地卷的弹性键值存储的设计与实现

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.33

Giorgos Saloustros, K. Magoutis

{"title":"Rethinking HBase: Design and Implementation of an Elastic Key-Value Store over Log-Structured Local Volumes","authors":"Giorgos Saloustros, K. Magoutis","doi":"10.1109/ISPDC.2015.33","DOIUrl":"https://doi.org/10.1109/ISPDC.2015.33","url":null,"abstract":"HBase is a prominent NoSQL system used widely in the domain of big data storage and analysis. It is structured as two layers: a lower-level distributed file system (HDFS)supporting the higher-level layer responsible for data distribution, indexing, and elasticity. Layered systems have in many occasions proven to suffer from overheads due to the isolation between layers, HBase is increasingly seen as an instance of this. To overcome this problem we designed, implemented, and evaluated HBase-BDB, an alternative to HBase that replaces the HDFS store with a thinner layer of a log-structured B+ tree key value store (Berkeley DB) operating over local volumes. We show that HBase-BDB overcomes HBase's performance bottlenecks (while retaining compatibility with HBase applications) without losing on elasticity features. We evaluate the performance of HBase and HBase-BDB using the Yahoo! Cloud Serving Benchmark (YCSB) and online transaction processing(OLTP) workloads on a commercial public Cloud provider. We find that HBase-BDB outperforms a tuned HBase configuration by up to 85% under a write-intensive workload due to HBase-BDB's reduced background-write activity. HBase-BDB's novel elasticity mechanisms operating over local volumes are shown to be as perform ant as HBase's equivalent features when stress-tested under TPC-C workloads.","PeriodicalId":123757,"journal":{"name":"2015 14th International Symposium on Parallel and Distributed Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121818662","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}

引用次数: 6

BOLAS: Bipartite-Graph Oriented Locality-Aware Scheduling for MapReduce Tasks 面向两部分图的MapReduce任务位置感知调度

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.12

Ruini Xue, Shengli Gao, Lixiang Ao, Z. Guan

{"title":"BOLAS: Bipartite-Graph Oriented Locality-Aware Scheduling for MapReduce Tasks","authors":"Ruini Xue, Shengli Gao, Lixiang Ao, Z. Guan","doi":"10.1109/ISPDC.2015.12","DOIUrl":"https://doi.org/10.1109/ISPDC.2015.12","url":null,"abstract":"Task scheduling is critical to reduce the make span of MapReduce jobs. It is an effective approach for scheduling optimization by improving the data locality, which involves attempting to locate a task and its related data block on the same node. However, recent studies have been insufficient in addressing the locality issue. This paper proposes BOLAS, a MapReducetask scheduling algorithm, which models the scheduling processes a bipartite-graph matching problem trying best to assign data block to the nearest task. By considering the divergence of node performance of distribution of data blocks in MapReduce cluster, BOLAS can achieve a high degree of data locality, guarantee minimal data transfer during execution, and reduces a job's makespan subsequently. As a dynamic algorithm, BOLAS solves the model using Kuhn-Munkres optimal matching algorithm, and can be deployed in either homogeneous or heterogeneous environments. In this study, BOLAS was implemented as a plug in for Hadoop, and the experimental results indicate that BOLAScan localize nearly 100% of the map tasks and reduce the execution time by up to 67.1%.","PeriodicalId":123757,"journal":{"name":"2015 14th International Symposium on Parallel and Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121359910","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}

引用次数: 15

Optimizing Data Accesses for Breadth-First Search on Shared Memory Computers 基于广度优先搜索的共享内存计算机数据访问优化

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.25

Z. Hu, Huashan Yu

{"title":"Optimizing Data Accesses for Breadth-First Search on Shared Memory Computers","authors":"Z. Hu, Huashan Yu","doi":"10.1109/ISPDC.2015.25","DOIUrl":"https://doi.org/10.1109/ISPDC.2015.25","url":null,"abstract":"Breadth-first search (BFS) is a widely used graph algorithm. It is data-intensive, and the data accesses are random and discontinuous. The data-accessing latency plays an important role in the algorithm's time consumption on shared memory computers, since it can hardly be reduced with processor technologies like dynamic execution of instructions and prefect of data. This work focuses on partitioning computation for BFS on shared memory computers. The goal is to improve data-accessing efficiency and optimize load balance among processors. A data-centric parallel computing model is presented. The model provides a partitioned and hierarchical data-view for each processor, and automatically assigns the computation on each data partition to a set of processors that have same data-view. This computation partitioning mechanism allows applications to minimize data accessing collisions among processors. A BFS equipped with the data-centric computation partitioning mechanism has been implemented. Two strategies are introduced to improve our BFS's performance further. One is to improve vertex -- accessing efficiency by representing status of vertices with bitmap. Another is to improve load balance by adjusting every processor's workload dynamically. The model and the strategies have been evaluated with both real graphs and synthetic graphs. Comparing with the BFS without the data-centric computation partitioning mechanism, the new BFS has achieved 1.8-2.6× speedup. We believe this mechanism is also applicable to other graph applications.","PeriodicalId":123757,"journal":{"name":"2015 14th International Symposium on Parallel and Distributed Computing","volume":"323 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116435717","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}

引用次数: 0

The Distributed Mobile Cloud Supporting the Internet of Things 支持物联网的分布式移动云

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.9

D. Grigoras, P. Gepner

引用次数: 2

A New Secure Virtual Connector Approach for Communication within Large Distributed Systems 一种用于大型分布式系统通信的安全虚拟连接器新方法

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.28

Gabriel Risterucci, T. Muntean, Léon Mugwaneza

{"title":"A New Secure Virtual Connector Approach for Communication within Large Distributed Systems","authors":"Gabriel Risterucci, T. Muntean, Léon Mugwaneza","doi":"10.1109/ISPDC.2015.28","DOIUrl":"https://doi.org/10.1109/ISPDC.2015.28","url":null,"abstract":"Communicating entities in distributed systems and large scale applications require specific message exchange protocols which can be adjusted for multiple networks. Some secure networking protocols exist and provide different security properties. Such protocols include Transport Layer Security (TLS) and Secure Shell (SSH). We propose here a more specific approach for constructing a new model of distribution using connectors which implement a protocol as a support for securing exchanges over heterogeneous networks used for distributed applications. The Secure Virtual Connector (SVC) protocol provides enhanced security for exchanges between components of distributed applications. This protocol avoids existing shortcomings within existing secure communications protocols which have been designed to fit a wide variety of situations. This flexibility leads to potential vulnerabilities, most of which are avoidable. We consider here a full set of essential security properties for large distributed application such as confidentiality, authenticity, and a certain form of privacy. Other considerations include the use of heterogeneous networks, as well as the mobility of users using secure virtual connectors. The SVC protocol proposed here provides all the required security properties while keeping a low performance overhead which makes it efficient for both fixed and mobile networks. As such SVC is a suitable alternative to existing secure communication protocols.","PeriodicalId":123757,"journal":{"name":"2015 14th International Symposium on Parallel and Distributed Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114714926","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}

引用次数: 1

Soil Management Services in CLUeFARM CLUeFARM的土壤管理服务

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.30

Adil Serrouch, M. Mocanu, Florin Pop

引用次数: 8

A Simulator for Analysis of Opportunistic Routing Algorithms 机会路由算法分析模拟器

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.11

C. Chilipirea, Andreea-Cristina Petre, C. Dobre, Florin Pop, G. Suciu

{"title":"A Simulator for Analysis of Opportunistic Routing Algorithms","authors":"C. Chilipirea, Andreea-Cristina Petre, C. Dobre, Florin Pop, G. Suciu","doi":"10.1109/ISPDC.2015.11","DOIUrl":"https://doi.org/10.1109/ISPDC.2015.11","url":null,"abstract":"When mobile devices are unable to establish direct communication, or when communication should be offloaded to cope with large throughputs, mobile collaboration can be used to facilitate communication through opportunistic networks. These types of networks are formed when mobile devices communicate only using short-range transmission protocols, usually when users are close, can help applications exchange data. Routes are built dynamically, since each mobile device is acting according to the store-carry-and-forward paradigm. Thus, contacts are seen as opportunities to move data towards the destination. In such networks the routing protocol is of vital importance -- and today we witness quite a number of routing algorithms that have been proposed to maximize the success rate of message delivery whilst minimizing the communication cost. Such protocols take advantage of the devices' history of contacts, or information about users carrying the mobile devices, to make their forwarding decision. Our contribution in this paper is two-fold: First, we present a new simplified, fast simulator, designed to minimize the work needed to conduct extensive tests for opportunistic routing algorithm on multiple traces, next we present an extensive analysis of several of the most popular routing algorithms through extensive simulations conducted using our simulation platform. We highlight their pros and cons in different scenarios, considering different real-world mobility data traces.","PeriodicalId":123757,"journal":{"name":"2015 14th International Symposium on Parallel and Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130428393","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}

引用次数: 4

GPU-Accelerated Digital Halftoning by the Local Exhaustive Search 局部穷举搜索的gpu加速数字半调

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.17

H. Koge, Yasuaki Ito, K. Nakano

引用次数: 0

DART-CUDA: A PGAS Runtime System for Multi-GPU Systems DART-CUDA:多gpu系统的PGAS运行时系统

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.20

Lei Zhou, K. Fürlinger

{"title":"DART-CUDA: A PGAS Runtime System for Multi-GPU Systems","authors":"Lei Zhou, K. Fürlinger","doi":"10.1109/ISPDC.2015.20","DOIUrl":"https://doi.org/10.1109/ISPDC.2015.20","url":null,"abstract":"The Partitioned Global Address Space (PGAS) approach is a promising programming model in high performance parallel computing that combines the advantages of distributed memory systems and shared memory systems. The PGAS model has been used on a variety of hardware platforms in the form of PGAS programming languages like Unified Parallel C (UPC), Chapel and Fortress. However, in spite of the increasing adoption in distributed and shared memory systems, the extension of the PGAS model to accelerator platforms is still not well supported. To exploit the immense computational power of multi-GPU systems, this work is concerned with the design and implementation of a Partitioned Global Address Space model for multi-GPU systems. Several issues related to the combination of logically separate GPU memories on multiple graphic cards are addressed. Furthermore, the execution model of modern GPU architectures is studied and a task creation mechanism with load balancing is proposed. Our work is implemented in the context of the DASH project, a C++ template library that realizes PGAS semantics through operator overloading. Experimental results suggest promising performance of the design and its implementation.","PeriodicalId":123757,"journal":{"name":"2015 14th International Symposium on Parallel and Distributed Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125127319","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}

引用次数: 3

XFOR: Filling the Gap between Automatic Loop Optimization and Peak Performance XFOR:填补自动循环优化和峰值性能之间的差距

2015 14th International Symposium on Parallel and Distributed Computing Pub Date : 2015-06-29 DOI: 10.1109/ISPDC.2015.19

I. Fassi, P. Clauss

引用次数: 11