2013 International Conference on Parallel and Distributed Systems最新文献_第7页

Towards Multi-way Join Evaluating with Indexing Partition Support in Map-Reduce Map-Reduce中支持索引分区的多路连接评价

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.51

Yunpeng Li, Wenhai Li, Biren Chen, Wei Song, Weidong Wen, Wanghong Li

{"title":"Towards Multi-way Join Evaluating with Indexing Partition Support in Map-Reduce","authors":"Yunpeng Li, Wenhai Li, Biren Chen, Wei Song, Weidong Wen, Wanghong Li","doi":"10.1109/ICPADS.2013.51","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.51","url":null,"abstract":"In the era of \"big data\", the emergence and increasing adoptions of the related enabling technologies make it possible for Map-Reduce to accommodate DSS (Decision Support Systems) load, which is commonly targeted for high-performance Data Warehouse analyses in the context of RDBMS. However, the non-predetermined mapping of the Map-Reduce tasks to the physical machines makes it difficult to utilize the pre-partitioned and indexing techniques of DBMS to improve the data locality. In this paper, towards multi-way join evaluating OLAP (Online Analysis Processing) workloads, we introduce table partitioning by reference to Map-Reduce. For avoiding the dispersion of the initial tuples that belong to the same segment keys, we present a detailed description of the data organization model that partitions the dominated tables by cascade reference constraints. In order to push multiple joins on these clustered partitions down to the map task, we design a one-pass multi-way join algorithm along with its optimization implementations for the major Map-Reduce stages. We conduct an empirically study with TPCH benchmark on different scales of clusters, and experimentally verify the high efficiency of the proposed optimization model.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"102 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":"124559976","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

Cost Optimization for Scientific Workflow Execution on Cloud Computing 基于云计算的科学工作流执行成本优化

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.118

Tanyaporn Tirapat, Orachun Udomkasemsub, Xiaorong Li, T. Achalakul

引用次数: 8

Evaluating Optimization Strategies for HMMer Acceleration on GPU 基于GPU的hmm加速优化策略评估

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.21

Samuel Ferraz, N. Moreano

{"title":"Evaluating Optimization Strategies for HMMer Acceleration on GPU","authors":"Samuel Ferraz, N. Moreano","doi":"10.1109/ICPADS.2013.21","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.21","url":null,"abstract":"Comparing a biological sequence to a family of sequences is an important task in Bioinformatics, commonly performed using tools such as HMMer. The Viterbi algorithm is applied as HMMer main step to compute the similarity between the sequence and the family. Due to the exponential growth of biological sequence databases, implementations of the Viterbi algorithm on several high performance platforms have been proposed. Nevertheless, few implementations of the Viterbi algorithm use GPUs as main platform. In this paper, we present the development and optimization of an accelerator for the Viterbi algorithm applied to biological sequence analysis on GPUs. Some of the optimizations analyzed are applied to the sequence comparison problem for the first time in the literature and others are evaluated in more depth than in related works. Our main contributions are: (a) an accelerator that achieves speedups up to 102.90 and 60.46, with respect to HMMer2 and HMMer3 execution on a general purpose computer, respectively, (b) the use of the multi-platform OpenCL programming model for the accelerator, (c) a detailed evaluation of several optimizations such as memory, control flow, execution space, instruction scheduling, and loop optimizations, and (d) a methodology of optimizations and evaluation that can also be applied to other sequence comparison algorithms, such as the HMMer3 MSV.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"47 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":"125399354","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}

引用次数: 2

A Distributed Cache Framework for Metadata Service of Distributed File Systems 面向分布式文件系统元数据服务的分布式缓存框架

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.20

Yao Sun, Jie Liu, Dan Ye, Hua Zhong

引用次数: 2

A Service Path Selection and Adaptation Algorithm in Service-Oriented Network Virtualization Architecture 面向服务的网络虚拟化体系结构中的服务路径选择与自适应算法

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.93

Kwonyong Lee, Haerim Yoon, Sungyong Park

{"title":"A Service Path Selection and Adaptation Algorithm in Service-Oriented Network Virtualization Architecture","authors":"Kwonyong Lee, Haerim Yoon, Sungyong Park","doi":"10.1109/ICPADS.2013.93","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.93","url":null,"abstract":"With the advances of networking and cloud computing technologies, many web services are often implemented as cloud services by different service providers, and some SPs compose those services to create an end-to-end network service. In this service-oriented network virtualization environment, two important but somehow contradictory technical challenges are 1) how to select an optimal service path in order to meet the QoS requirements by users, and 2) how to balance the loads to fully utilize the whole systems. In this paper, we present an adaptive service path selection algorithm in service-oriented network virtualization environment, which assures QoS and balances the load at the same time. The proposed algorithm selects appropriate component services from multiple candidate service instances running on virtual machines and creates an optimal service path satisfying the users' QoS requirements. Our algorithm also dynamically adapts to the optimal service path based on various changes. Since the proposed algorithm handles a variation of the multi-constrained path selection problem known as NP-complete, we formulate the problem using ant colony optimization algorithm. The experimental results show that our algorithm guarantees the maximal QoS to the users while balancing the load at the same time, and adapts to the optimal service path based on the situational changes.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"15 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":"125801787","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}

引用次数: 5

A Feasibility Study on Developing IoT/M2M Applications over ETSI M2M Architecture 基于ETSI M2M架构开发物联网/M2M应用的可行性研究

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.100

F. Lin, Yi Ren, Eduardo Cerritos

引用次数: 20

Privacy Vulnerability Analysis on Routing in Mobile Social Networks 移动社交网络路由隐私漏洞分析

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.82

Yan Sun, Lihua Yin, Shuang Xin

引用次数: 0

Virtual Coordinate Based Co-moving Detection in Wireless Sensor Networks 基于虚拟坐标的无线传感器网络共移检测

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.106

Wei-Hua Chen, Guey-Yun Chang, Jen-Feng Huang

引用次数: 0

Bi-direction Adjust Heuristic for Workflow Scheduling in Clouds 云环境下工作流调度的双向调整启发式算法

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.25

Zhicheng Cai, Xiaoping Li, Long Chen, J. Gupta

引用次数: 9

PipeFlow Engine: Pipeline Scheduling with Distributed Workflow Made Simple PipeFlow引擎:管道调度与分布式工作流简单

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.31

Yin Li, Chuang Lin

引用次数: 0