2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献

筛选
英文 中文
Bandwidth Modeling in Large Distributed Systems for Big Data Applications 面向大数据应用的大型分布式系统带宽建模
B. Javadi, Boyu Zhang, M. Taufer
{"title":"Bandwidth Modeling in Large Distributed Systems for Big Data Applications","authors":"B. Javadi, Boyu Zhang, M. Taufer","doi":"10.1109/PDCAT.2014.12","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.12","url":null,"abstract":"The emergence of Big Data applications provides new challenges in data management such as processing and movement of masses of data. Volunteer computing has proven itself as a distributed paradigm that can fully support Big Data generation. This paradigm uses a large number of heterogeneous and unreliable Internet-connected hosts to provide Peta-scale computing power for scientific projects. With the increase in data size and number of devices that can potentially join a volunteer computing project, the host bandwidth can become a main hindrance to the analysis of the data generated by these projects, especially if the analysis is a concurrent approach based on either in-situ or in-transit processing. In this paper, we propose a bandwidth model for volunteer computing projects based on the real trace data taken from the Docking@Home project with more than 280,000 hosts over a 5-year period. We validate the proposed statistical model using model-based and simulation-based techniques. Our modeling provides us with valuable insights on the concurrent integration of data generation with in-situ and in-transit analysis in the volunteer computing paradigm.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129371201","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
Joint Convergecast and Power Allocation in Wireless Sensor Networks 无线传感器网络中的联合收敛和功率分配
Yaoxin Duan, Wendi Nie, Kai Liu, Qingfeng Zhuge, E. Sha, V. Lee
{"title":"Joint Convergecast and Power Allocation in Wireless Sensor Networks","authors":"Yaoxin Duan, Wendi Nie, Kai Liu, Qingfeng Zhuge, E. Sha, V. Lee","doi":"10.1109/PDCAT.2014.24","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.24","url":null,"abstract":"Converge cast is a critical communication paradigm for data collection in wireless sensor networks, where both energy and bandwidth are scarce resources. Previous converge cast algorithms only focused on minimizing the energy cost without considering the constraint of wireless bandwidth. This article shows that constructing a congestion-free converge cast tree cannot ignore the bandwidth constraint. Considering the adjustable transmission power of sensor nodes, it will affect not only the topology of networks but also the bandwidth of wireless links. In this paper, we formulate the Minimum Total Transmission Power (MTTP) problem, which aims to address the issue of constructing a congestion-free converge cast tree in WSNs with adjustable transmission power of sensor nodes. We transform MTTP to an Integer Linear Programming (ILP) model, by which the optimal solution to MTTP is derived. To strike a balance between scheduling overhead and system performance, we propose a heuristic algorithm called Nearest-to-Sink, which searches viable paths in a greedy way and achieves near optimal performance. We build the simulation model and give a comprehensive performance evaluation, which demonstrates the feasibility and the effectiveness of the proposed algorithm.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"30 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116310964","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
Access-Efficient QoS-Aware Data Replication to Maximize User Satisfaction in Cloud Computing Environments 访问高效的qos感知数据复制,以最大限度地提高云计算环境中的用户满意度
Mohammad Shorfuzzaman
{"title":"Access-Efficient QoS-Aware Data Replication to Maximize User Satisfaction in Cloud Computing Environments","authors":"Mohammad Shorfuzzaman","doi":"10.1109/PDCAT.2014.11","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.11","url":null,"abstract":"Cloud computing infrastructures capable of providing scalable storage and computing resources can efficiently be used for big data storage and processing. There are growing trends in developing data-intensive (big data) applications in this computing environment that need to access massive datasets. Hence, effective data management such as data availability and efficient accesses has become critical requirements in these applications. This can be achieved by using data replication, which offers reduced data access latency, higher data availability and improved system load balancing. Moreover, different applications may have different quality-of-service (QoS) requirements. To continuously support the QoS requirement of an application, we propose a highly distributed QoS-aware replication technique that computes the optimal data center locations for the replicas so that the overall replication cost is minimized. Further, the replication strategy aims at maximizing QoS satisfaction to improve data availability and reduce access latency. The problem is formulated using dynamic programming. Finally, simulation experiments are performed using widely observed data access patterns to demonstrate the effectiveness of the proposed technique.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131775230","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
PUF-Based RFID Ownership Transfer Protocol in an Open Environment 开放环境下基于puf的RFID所有权转移协议
Qingshan Li, Xiaolin Xu, Zhong Chen
{"title":"PUF-Based RFID Ownership Transfer Protocol in an Open Environment","authors":"Qingshan Li, Xiaolin Xu, Zhong Chen","doi":"10.1109/PDCAT.2014.25","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.25","url":null,"abstract":"In the supply chain, RFID tags are deployed more widely. In the life of the supply chain, the owner of the tag will change frequently. Ownership transfer protocol can achieve the purpose that the access rights of the tag are transferred from the original owner to the new owner, and protect the privacy of the original owner and the new owner. To resist cloning attack and side channel analysis attack, physical unclonable function (PUF) has been proposed to enhance the security of the tags. Since the PUF of each tag is unique and different, it is difficult to be forged. However, most of PUF-based authentication protocols need the response value previously stored in the readers. On the other hand, most of the ownership transfer protocols assume the original owner and the new owner has a secure channel. However, in an open environment, due to time and space constraints, such a channel is often unable to quickly established. In this paper, we studied the ownership transfer protocols in an open environment and proposed a PUF-based RFID ownership transfer protocols, PROTP. The new protocol is the first ownership transfer protocol based on the PUF in an open environment. The new protocol does not need to store the respond values of the PUF. To utilize the randomness of the PUF, it replaces the pseudo-random generator. Meanwhile, PROTP can protect the privacy of the original owner and the new owner. In terms of efficiency, since the protocol is designed to satisfy the requirement in an open environment, the total cost of the computation is more than others protocols. However, due to the new protocol utilizes the PUF to replace the pseudo-random generator, the each step of the authentication messages achieves a better optimization in computational cost.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115122473","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
Fast ICA on Modern GPU Architectures 现代GPU架构上的快速ICA
Max Plauth, Frank Feinbube, Peter Tröger, A. Polze
{"title":"Fast ICA on Modern GPU Architectures","authors":"Max Plauth, Frank Feinbube, Peter Tröger, A. Polze","doi":"10.1109/PDCAT.2014.19","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.19","url":null,"abstract":"Blind Signal Separation is an algorithmic problem class that deals with the restoration of original signal data from a signal mixture. Implementations, such as Fast ICA, are optimized for parallelization on CPU or first-generation GPU hardware. With the advent of modern, compute centered GPU hardware with powerful features such as dynamic parallelism support, these solutions no longer leverage the available hardware performance in the best-possible way. We present an optimized implementation of the FastICA algorithm, which is specifically tailored for next-generation GPU architectures such as Nvidia Kepler. Our proposal achieves a two digit factor of speedup in the prototype implementation, compared to a multithreaded CPU implementation. Our custom matrix multiplication kernels, tailored specifically for the use case, contribute to the speedup by delivering better performance than the state-of-the-art CUBLAS library.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"57 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132463788","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
Fault-Tolerant Routing in (n, k) - Star Graphs (n, k)中的容错路由-星图
Takara Ito, Manabu Myojin, Y. Hirai, K. Kaneko
{"title":"Fault-Tolerant Routing in (n, k) - Star Graphs","authors":"Takara Ito, Manabu Myojin, Y. Hirai, K. Kaneko","doi":"10.1109/PDCAT.2014.27","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.27","url":null,"abstract":"An (n, k)-star graph Sn, k is a promising topology for interconnection networks of parallel processing systems because it inherits the merits of a star graph while providing various network sizes. In this study, we propose a fault-tolerant routing algorithm that establishes a fault-free path between any pair of non-faulty nodes in an Sn, k with faulty nodes by using limited global information called safety vectors. In addition, we carried out a computer experiment to verify its effectiveness.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126620584","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 High-Level Parallel Patterns in OpenCL 面向OpenCL的高级并行模式
J. Dokulil, S. Benkner
{"title":"Towards High-Level Parallel Patterns in OpenCL","authors":"J. Dokulil, S. Benkner","doi":"10.1109/PDCAT.2014.39","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.39","url":null,"abstract":"Parallel pattern libraries (e.g., Intel TBB) are popular and useful tools for developing applications in SMP environments at a higher level of abstraction. Such libraries execute user-provided code efficiently on shared memory parallel architectures in accordance with well-defined execution patterns like parallel for-loops or pipelines. For heterogeneous architectures comprised of CPUs and accelerators, OpenCL has gained a lot of momentum. Since accelerated architectures do not provide a shared memory, it is not possible to directly use the approach taken in pattern libraries for SMP systems for OpenCL as well. In this paper, we are exploring issues and opportunities encountered by attempts to provide such patterns in the context of OpenCL. Based on a set of experiments with a scientific application on diverse OpenCL devices, we point out major pitfalls and insights, and outline directions for further efforts in developing pattern libraries for OpenCL.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"160 1-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116635039","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
Practical Anonymization for Protecting Privacy in Combinatorial Maps 组合映射中保护隐私的实用匿名化
Dandan Chu, Yidong Li, Tao Wang, Lei Zhang, Hong Shen
{"title":"Practical Anonymization for Protecting Privacy in Combinatorial Maps","authors":"Dandan Chu, Yidong Li, Tao Wang, Lei Zhang, Hong Shen","doi":"10.1109/PDCAT.2014.28","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.28","url":null,"abstract":"Combinatorial Map (CM) is becoming increasingly popular due to its power in modeling topological structures with subdivided objects, which is widely used in the fields of social network, computer vision, social media and so on. However, due to its specific structural properties, an unprotected release of a combinatorial map may cause the identity disclosure problem, which is a major privacy breach revealing the identification of entities with certain background knowledge known by an adversary. In this paper, we discuss the privacy preserving problem in publishing private combinatorial maps. We first formalize a specific anonymizing model to deal with dart-related attacks, and discuss an efficient metric to quantify information loss incurred in the perturbation. Then we propose an efficient method for the dart anonymization problem to prevent a CM from the attack. Our approaches are efficient and practical, and have been validated by extensive experiments on two sets of synthetic data.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129693683","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
Energy-Aware Scheduling for Sensor Node Platforms 传感器节点平台的能量感知调度
S. Tak, H. Kim, Donglyul Kim, Yougyung Kim
{"title":"Energy-Aware Scheduling for Sensor Node Platforms","authors":"S. Tak, H. Kim, Donglyul Kim, Yougyung Kim","doi":"10.1109/PDCAT.2014.18","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.18","url":null,"abstract":"This paper primarily presents a technique to integrate energy-aware real-time scheduling into battery-powered sensor node platforms. The proposed scheduling technique attempts to achieve energy savings while meeting timing requirements of real-time tasks as well as improving the response time of non-real-time tasks. The proposed energy-aware real-time scheduling technique is addressed from two perspectives: a dynamic voltage scaling (DVS)-based scheduling approach and a combined real-time and non-real-time scheduling approach. From the perspective of DVS-based scheduling approach, it reduces the processor frequency and still ensures that no tasks miss their timing constraints. From the perspective of a combined real-time and non-real-time scheduling scheme, tasks are allowed to have timing constraints. Consequently, real-time tasks need to be processed in a timely fashion and delivered to meet their timing constraints, and non-real-time tasks need to be quickly processed to deliver a fast response. An experimental evaluation shows that the proposed scheduling technique yields efficient performance in terms of low energy consumption and a fast average response time for non-real-time tasks, whilst meeting the timing constraints of real-time tasks.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128126461","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
Comparison of Binding Approaches of Scheduled Multiphase Application onto Linear Multicore Architecture 线性多核架构中调度多相应用的绑定方法比较
Sahil Kumar, Nitesh Singal, A. Sahu
{"title":"Comparison of Binding Approaches of Scheduled Multiphase Application onto Linear Multicore Architecture","authors":"Sahil Kumar, Nitesh Singal, A. Sahu","doi":"10.1109/PDCAT.2014.23","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.23","url":null,"abstract":"As almost all applications run-time characteristics exhibit time varying phase behavior. So scheduling and binding strategy considering this behavior of applications plays an important role in achieving high throughput and less power consumption. In this paper, we have considered binding of already scheduled multiphase application on to linear multicore architecture. This approaches bind the scheduled applications on nearby cores and hence reduces the overall data movement. We have modeled over all data communication overhead of application on a linear architecture and use this model in binding. Also we have proposed and evaluated four different approaches for binding the multi-phase applications on linear multicore architecture. The proposed approach are (a) random iterative refinement, (b) biggest block left-right approach (c) biggest block center-center approach and (d) hierarchical binding using perfect minimum cost matching. Result shows that hierarchical binding using minimum cost perfect matching based approach outperform rest of the approaches.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126629955","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
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学术官方微信
小红书