2013 International Conference on Parallel and Distributed Systems最新文献

筛选
英文 中文
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
{"title":"Cost Optimization for Scientific Workflow Execution on Cloud Computing","authors":"Tanyaporn Tirapat, Orachun Udomkasemsub, Xiaorong Li, T. Achalakul","doi":"10.1109/ICPADS.2013.118","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.118","url":null,"abstract":"Scientific workflow applications generally require various levels of computing power over the course of execution. The applications then often take advantage of Cloud computing due to its cost-effective, pay-as-you-go pricing model. However, the scientific workflow executions must be planned wisely in order to minimize total cost of the resource usage. In addition, lateness of completing some workflows may result in high penalty cost. In this paper, the scheduling algorithm based on GA and PSO is proposed for optimizing the workflow execution. The experiment to evaluate the scheduling efficiency is performed on the simple workflow engine developed by the authors. The result is then compared to the existing algorithms including HEFT, GA, PSO, and PSO-SA. The result shows that the proposed GAPSO algorithm has a good potential to give the minimum cost when execution time is restricted.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"81 3 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":"123213241","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}
引用次数: 8
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
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
{"title":"Privacy Vulnerability Analysis on Routing in Mobile Social Networks","authors":"Yan Sun, Lihua Yin, Shuang Xin","doi":"10.1109/ICPADS.2013.82","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.82","url":null,"abstract":"Mobile social networks (MSNs) are a kind of delay tolerant network that consists of lots of mobile nodes with social characteristics. Recently, many social-aware algorithms have been proposed to address routing problems in MSNs. Because of the social properties introduced to routing, this results in node privacy disclosure. In this paper, analyzing social-based routing strategies, we propose a privacy attack tree model taking all the possible attack on social-based routing into account. This model describes all of the possibilities and approaches of privacy disclosure, and quantifies their the occurrence probability.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"76 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":"125062775","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
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
{"title":"A Distributed Cache Framework for Metadata Service of Distributed File Systems","authors":"Yao Sun, Jie Liu, Dan Ye, Hua Zhong","doi":"10.1109/ICPADS.2013.20","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.20","url":null,"abstract":"Most recent distributed file systems have adopted architecture with an independent metadata server cluster. However, potential multiple hotspots and flash crowds access patterns often cause a metadata service that violates performance Service Level Objectives. To maximize the throughput of the metadata service, an adaptive request load balancing framework is critical. We present a distributed cache framework above the distributed metadata management schemes to manage hotspots rather than managing all metadata to achieve request load balancing. This benefits the metadata hierarchical locality and the system scalability. Compared with data, metadata has its own distinct characteristics, such as small size and large quantity. The cost of useless metadata prefetching is much less than data prefetching. In light of this, we devise a time period-based prefetching strategy and a perfecting-based adaptive replacement cache algorithm to improve the performance of the distributed caching layer to adapt constantly changing workloads. Finally, we evaluate our approach with a hadoop distributed file system cluster.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"16 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":"126980079","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
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
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
{"title":"A Feasibility Study on Developing IoT/M2M Applications over ETSI M2M Architecture","authors":"F. Lin, Yi Ren, Eduardo Cerritos","doi":"10.1109/ICPADS.2013.100","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.100","url":null,"abstract":"A common service platform is considered as the key enabler to catalyze the development of IoT/M2M applications for a large variety of vertical markets such as smart energy, smart transportation, home and industry automation, eHealth and connected vehicles. This paper reports an initial effort at National Chiao Tung University in Taiwan with such an experimental approach. We first train our graduate students with an ETSI M2M architecture-compliant service platform OpenMTC from FOKUS, and then charter them with the tasks of developing diverse M2M applications. The effort is used as a feasibility study to investigate how useful the notion of a common service platform for IoT/M2M is and how urgent an international standard is required in defining such a platform. We intend to use the result of the study to create a suitable IoT/M2M curriculum for our students.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"40 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":"131689791","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}
引用次数: 20
RFID Vehicle Plate Number (E-Plate) for Tracking and Management System 用于跟踪和管理系统的RFID车辆车牌号码(E-Plate)
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.109
Evizal, T. A. Rahman, S. Rahim
{"title":"RFID Vehicle Plate Number (E-Plate) for Tracking and Management System","authors":"Evizal, T. A. Rahman, S. Rahim","doi":"10.1109/ICPADS.2013.109","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.109","url":null,"abstract":"Nowadays, internet are used almost in any application and field, even small item registered with code and update in database then can buy it by online system. Numbers of vehicles are significant increase every year and many cases of vehicle theft and missing thus internet of things (IoT) is a technology can be use to overcome the issues. This paper presents on the use of RFID vehicle plate number (e-plate) for tracking and management system. Started by design RFID e-plate antenna based and vehicle plate number size to achieve optimum performance by utilization of plate number size then an RFID chip attached to the plate. Proposed antenna of e-plate design using a low cost FR4 material and antenna band works at 902-928 MHz frequency for UHF RFID application, with result 3.8 dbi antenna gains there is performance improvement compared to the current tag antenna. The shape of antenna is rectangular and has a dimension of 300 mm x 100 mm, which is usually the typical size of the conventional vehicle registration plate number. Since vehicle e-plate used RFID chip and some information stored inside the tag then when RFID readers install at strategic point able capture vehicle information. All information collected by readers can be analyzed for vehicle tracking, monitoring and transportation management system.","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":"124940694","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}
引用次数: 16
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
{"title":"Bi-direction Adjust Heuristic for Workflow Scheduling in Clouds","authors":"Zhicheng Cai, Xiaoping Li, Long Chen, J. Gupta","doi":"10.1109/ICPADS.2013.25","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.25","url":null,"abstract":"This paper considers the workflow scheduling problem in Clouds with the hourly charging model and data transfer times. It deals with the allocation of tasks to suitable VM instances while maintaining the precedence constraints on one hand and meeting the workflow deadline on the other. A bi-direction adjust heuristic (BDA) is proposed for the considered problem. Matching of tasks and the VM types is modeled as Mixed Integer Linear programming (MILP) problem and solved using CPLEX at the first stage of BDA. In the second stage, forward and backward scheduling procedures are applied to allocate tasks to VM instances according to the result of the first stage. In the backward scheduling procedure, a priority rule considering the finish time, wasted time fractions and added hours is developed to make appropriate matches of tasks and free time slots. Extensive experimental results show that the proposed BDA heuristic outperforms the existing state-of-the-art heuristic ICPCP in all cases. Further, compared with ICPCP, about 80% percentage of VM renting cost is saved for instances with 900 tasks at most.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"25 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":"127139443","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}
引用次数: 9
Social Web of Things: A Survey 社会物联网:一项调查
T. Chung, Ibrahim Mashal, Osama Alsaryrah, Van Huy, Wen-Hsing Kuo, D. Agrawal
{"title":"Social Web of Things: A Survey","authors":"T. Chung, Ibrahim Mashal, Osama Alsaryrah, Van Huy, Wen-Hsing Kuo, D. Agrawal","doi":"10.1109/.101","DOIUrl":"https://doi.org/10.1109/.101","url":null,"abstract":"Recently, Wireless Sensor Networks (WSNs) are spread all over the world, and are commonly used to collect physical information from the surrounding world. WSNs play a central role in the Internet of Things (IoT) vision. IoT is a new paradigm that aims to integrate and connect anything at anytime, anyplace, with anything and by anyone. However, addressing objects is the main challenge for IoT. IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) has been introduced to cope with this issue. The emerging paradigm Social web of thing (SWoT) enables users to manage, access, share, and integrate smart objects with Social Network Site (SNS). This paper investigates different SWoT platforms and architectures, provides an overview of the current state-of-the-art on WSN communication standards.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"51 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":"127424686","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}
引用次数: 36
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信