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

筛选
英文 中文
Challenges of Using Edge Devices in IoT Computation Grids 在物联网计算网格中使用边缘设备的挑战
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.101
Swarnava Dey, A. Mukherjee, H. Paul, A. Pal
{"title":"Challenges of Using Edge Devices in IoT Computation Grids","authors":"Swarnava Dey, A. Mukherjee, H. Paul, A. Pal","doi":"10.1109/ICPADS.2013.101","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.101","url":null,"abstract":"Internet of Things (IoT) has the potential to become a technology revolution with a vision of creating very large scale network, comprising of unprecedented number of connected devices. These devices, often referred to as smart items or intelligent things can be home appliances, healthcare devices, vehicles, buildings, factories and almost anything networked and fitted with sensors, actuators, embedded computers. There has been sustained research work and standardization effort from different IoT perspectives like integration of sensor and RFID devices to the Internet. With the increasing trend of gathering business insights from unstructured data, the high volume of data generated by such devices is also of interest. Cloud based data mining platforms are suitable for analyses of such data and researchers have proposed architectures where personal mobile phones can act as Edge Gateway between the sensor network and cloud analytics platform. It seems that the surge in the volume of data generated by huge number of Smart Items can only be matched if a large percentage of mobile users start sharing the computation capability of their personal devices and work together towards true Participatory Computing in the IoT systems. In this work we try to understand the challenges associated with running computation jobs on the mobile devices using different types of workload often observed in IoT applications. Based on the insights gained from experiments performed by us, we propose a scheme where mobile phones, residential gateways and other edge devices offer free slots to servers in a cloud based data analytics system. Based on the free time slots offered by the mobile phones, if commensurately sized computational jobs can be scheduled, the unpredictability associated with using mobile phones as grid resources can be solved.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"38 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":"129728570","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}
引用次数: 29
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
{"title":"PipeFlow Engine: Pipeline Scheduling with Distributed Workflow Made Simple","authors":"Yin Li, Chuang Lin","doi":"10.1109/ICPADS.2013.31","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.31","url":null,"abstract":"Distributed computing system is considered as a fundamental architecture to extend resources such as computation speed, storage capacity, and network bandwidth, which are limited for a single processor. Emerging big data processing techniques like Hadoop take advantages of distributed servers to accomplish scalable parallel computations. Large-scale processing jobs can run on different servers or even different clusters interdependently and be combined together as a workflow to provide meaningful outputs. In this paper, we analyze the common demands of big-data processing and distributed big-data workflow processing. According to that, we design Pipe Flow Engine that has the matching features to meet each of these demands. It orchestrates all involved jobs and schedules them in a batched pipeline mode. We also present two online ranking algorithms that make use of the Pipe Flow, sharing the experience and best practice of using Pipe Flow.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"2007 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":"128586523","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
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
{"title":"Virtual Coordinate Based Co-moving Detection in Wireless Sensor Networks","authors":"Wei-Hua Chen, Guey-Yun Chang, Jen-Feng Huang","doi":"10.1109/ICPADS.2013.106","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.106","url":null,"abstract":"In mobile wireless sensor networks, it is important to understand the moving pattern of sensor nodes. There are a lot of application that need sensors nearby to co-work, such as data centric applications. Thus, knowing the co-moving nodes will be helpful to these applications. In this paper, we propose a co-moving sensor nodes detection algorithm based on virtual coordinate system. We use the geometric property of independent set to build our virtual coordinate system. The computation cost of building a virtual coordinate in this way is low and the result is relative accurate - just a coordinate rotation will it matches true coordinates. With the aids of virtual coordinate system, we can find out co-moving sensor node pairs efficiently and no precise localization scheme needed (for each sensor) in our works.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"4 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":"128855950","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
Accelerating De Bruijn Graph-Based Genome Assembly for High-Throughput Short Read Data 加速基于De Bruijn图的高通量短读数据基因组组装
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.68
Kun Zhao, Weiguo Liu, G. Voss, W. Müller-Wittig
{"title":"Accelerating De Bruijn Graph-Based Genome Assembly for High-Throughput Short Read Data","authors":"Kun Zhao, Weiguo Liu, G. Voss, W. Müller-Wittig","doi":"10.1109/ICPADS.2013.68","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.68","url":null,"abstract":"Emerging next-generation sequencing technologies have opened up exciting new opportunities for genome sequencing by generating read data with a massive throughput. However, the generated reads are significantly shorter compared to the traditional Sanger shotgun sequencing method. This poses challenges for de novo assembly algorithms in terms of both accuracy and efficiency. And due to the continuing explosive growth of short read databases, there is a high demand to accelerate the often repeated long-runtime assembly task. In this paper, we present a scalable parallel algorithm to accelerate the de Bruijn graph-based genome assembly for high-throughput short read data.","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":"122217279","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
Edge Detection for Hyperspectral Images Using the Bhattacharyya Distance 基于Bhattacharyya距离的高光谱图像边缘检测
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.127
S. Youn, Chulhee Lee
{"title":"Edge Detection for Hyperspectral Images Using the Bhattacharyya Distance","authors":"S. Youn, Chulhee Lee","doi":"10.1109/ICPADS.2013.127","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.127","url":null,"abstract":"In this paper, we proposed a new edge detection algorithm for hyper spectral images using the Bhattacharyya distance. First, the principal component analysis is applied to hyper spectral images and then dominant eigenimages are selected. To compute the Bhattacharyya distance, four block pairs of each pixel are extracted: up-down, left-right, diagonal-left down and diagonal-right-down. From each pair of blocks, we compute the Bhattacharyya distance, which was used as edge information. Experiments show promising results compared to the conventional Sobel filter.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"19 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":"120819409","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}
引用次数: 14
Using GPUs to Crack Android Pattern-Based Passwords 利用gpu破解Android模式密码
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.80
Jaewoo Pi, Pradipta De, Klaus Mueller
{"title":"Using GPUs to Crack Android Pattern-Based Passwords","authors":"Jaewoo Pi, Pradipta De, Klaus Mueller","doi":"10.1109/ICPADS.2013.80","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.80","url":null,"abstract":"We investigate the strength of patterns as secret signatures in Android's pattern based authentication mechanism. Parallelism of GPU is exploited to exhaustively search for the secret pattern. Typically, searching for a pattern, composed of a number of nodes and edges, requires an exhaustive search for the pattern. In this work, we show that the use of GPU can speed up the graph search, hence the pattern password, through parallelization. Preliminary results on cracking the Android pattern based passwords shows that the technique can be used as the basis to implement a tool that can check the strength of a pattern based password and thereby recommend strong patterns to the user.","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":"127651959","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
Wideband Channelization for Software-Defined Radio via Mobile Graphics Processors 基于移动图形处理器的软件无线电宽带信道化
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.24
Vignesh Adhinarayanan, Wu-chun Feng
{"title":"Wideband Channelization for Software-Defined Radio via Mobile Graphics Processors","authors":"Vignesh Adhinarayanan, Wu-chun Feng","doi":"10.1109/ICPADS.2013.24","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.24","url":null,"abstract":"Wideband channelization is a computationally intensive task within software-defined radio (SDR). To support this task, the underlying hardware should provide high performance and allow flexible implementations. Traditional solutions use field-programmable gate arrays (FPGAs) to satisfy these requirements. While FPGAs allow for flexible implementations, realizing a FPGA implementation is a difficult and time-consuming process. On the other hand, multicore processors while more programmable, fail to satisfy performance requirements. Graphics processing units (GPUs) overcome the above limitations. However, traditional GPUs are power-hungry and can consume as much as 350 watts, making them ill-suited for many SDR environments, particularly those that are battery-powered. Here we explore the viability of low-power mobile graphics processors to simultaneously overcome the limitations of performance, flexibility, and power. Via execution profiling and performance analysis, we identify major bottlenecks in mapping the wideband channelization algorithm onto these devices and adopt several optimization techniques to achieve multiplicative speed-up over a multithreaded implementation. Overall, our approach delivers a speedup of up to 43-fold on the discrete AMD Radeon HD 6470M GPU and 27-fold on the integrated AMD Radeon HD 6480G GPU, when compared to a vectorized and multithreaded version running on the AMD A4-3300M CPU.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"238 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":"116171636","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}
引用次数: 7
On Deploying IoT Indoor: An Incremental Approach 在室内部署物联网:一种渐进的方法
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.99
Nguyen Vo Quang Dong, C. King, Cheng Chih Liu
{"title":"On Deploying IoT Indoor: An Incremental Approach","authors":"Nguyen Vo Quang Dong, C. King, Cheng Chih Liu","doi":"10.1109/ICPADS.2013.99","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.99","url":null,"abstract":"Deploying radio-connected Internet-of-Things in an indoor environment is challenging. Most deployment methods are based on the radio range to determine the density or distance to place the nodes. Unfortunately, the surrounding obstacles such as walls and furniture make the communication pattern unpredictable. It follows that a well-planned IoT deployment plan that guarantees full connectivity on the drawing board may result in disconnected system when deployed on-site. A practical IoT deployment tool must cope with the difference in offline planning and on-site deployment. In this paper, a practical tool is introduced that deploys a network of IoT incrementally for indoor environments. The tool ensures node connectivity in the field despite environmental obstacles. The deployment process is divided into three main phases: offline deployment, online deployment and optimization. Each phase of the tool aims to place as few relay nodes as possible but always ensure full connectivity. The effectiveness of the tool is evaluated through real deployment.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"7 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":"128914103","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
Towards a Scalable PaaS for Service Oriented Software 面向服务软件的可伸缩PaaS
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.94
Hailong Sun, Xu Wang, Minzhi Yan, Yu Tang, Xudong Liu
{"title":"Towards a Scalable PaaS for Service Oriented Software","authors":"Hailong Sun, Xu Wang, Minzhi Yan, Yu Tang, Xudong Liu","doi":"10.1109/ICPADS.2013.94","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.94","url":null,"abstract":"Software developers with service oriented technologies usually put a lot of efforts to deploy and manage supporting middleware and tools. Meanwhile PaaS in cloud computing aims at provide efficient support for software developers. In the light of this consideration, we have designed and implemented Service4All, a service cloud platform targeting at improve productivity of service oriented software developers. In this paper, we describe the design of SAE, a key component in Service4All, in terms of scalability. First, we present the key technical issues and architecture design of SAE. Second, we describe a software appliance based mechanism for elastic middleware management. Third, we describe a micro-kernel based AppEngine core for efficient coordination of various components. Finally, through a real application deployed on Service4All, we demonstrate the effectiveness of our solution.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"185 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":"123737637","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
Energy Saving Data Abstraction and Reformation Algorithms for Human Movement Monitoring 面向人体运动监测的节能数据提取与改造算法
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.107
Toni, H. Goh, S. Liew
{"title":"Energy Saving Data Abstraction and Reformation Algorithms for Human Movement Monitoring","authors":"Toni, H. Goh, S. Liew","doi":"10.1109/ICPADS.2013.107","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.107","url":null,"abstract":"Detecting human movement is an important issue in monitoring and studying human activities especially for elderly and patients. The availability of wireless sensor network eases the monitoring work. Generally, a wireless sensor node for movement detection is embedded with an accelerometer and powered by batteries. The sensor node needs to transmit the sensed data from accelerometer wirelessly to other nodes or directly to a base station. If there are more data to be transmitted, it consumes more energy and thus the batteries drain out more quickly. Thus, an energy saving scheme, called Data Abstraction and Reformation (DAR), is proposed in this paper to reduce data transmission. Through data abstraction, sensor nodes filter out insignificant sensed data but only report those significant to a base station, and with data reformation, the complete data will be reconstructed at the base station with only the received data. We show that with a good selection of data abstraction and data reformation criteria, a movement detecting sensor node will only need to report 10%~30% of the sensed data in order to provide full human movement monitoring at a base station.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"58 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":"128626958","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学术官方微信