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

{"title":"LocalSense: An Infrastructure-Mediated Sensing Method for Locating Appliance Usage Events in Homes","authors":"Hung-Yuan Chen, Chien-Liang Lai, Huan Chen, Lun-Chia Kuo, Hsi-Chuan Chen, Jyh-Shyan Lin, Yao-Chung Fan","doi":"10.1109/ICPADS.2013.105","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.105","url":null,"abstract":"In this paper, we introduce a novel technique called Local Sense for detecting appliance usage events in a household by leveraging existing home power infrastructure. Specifically, the Local Sense technique works by purely analyzing the records taken from the main power meter. The main power meter is installed in a household to measure the overall real time aggregated power consumption in terms of wattage and voltage for the whole load of appliances in a household. The Local Sense technique requires no additional apparatuses being installed in existing household power infrastructure, which significantly reduces the cost for enabling the location-aware power usage information over existing techniques. The idea behind the Local Sense system is to reflect the fact that different outlets are with different power line impedances, which causes different power dissipation even for the same appliance usage. By identifying the additional power dissipation, detecting the appliance usage events at outlet levels is therefore possible. The proposed technique is validated in a research lab and preliminary results demonstrate the effectiveness of the proposed system.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"1 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":"130845528","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}

{"title":"Parallel molecular computation of modular-multiplication based on tile assembly model","authors":"Yongnan Li, Limin Xiao, Li Ruan","doi":"10.1109/ICPADS.2013.115","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.115","url":null,"abstract":"DNA computing is a new method for computation using the technology in molecular biology. The enormous parallel computing ability of DNA computing brings new opportunities and challenges to the development of cryptography. DNA cryptography is a cutting-edge sciences which combines classical cryptogram and molecular computing. Finite field GF(2n) is one of the most commonly used mathematic sets for cryptography. This paper proposes a parallel molecular computing system to compute the modular-multiplication, an operation combining multiplication and reduction, over finite field GF(2n). The operation of reduction is executed after the completion of the operation of multiplication. An instance of computing modular-multiplication is introduced to show the details of our system. The time complexity is Θ(n) and the space complexity is Θ(n2).","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"1 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":"130873006","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}

{"title":"SoMed: A Hybrid DHT Framework towards Scalable Decentralized Microblogging Services","authors":"Jinzhou Huang, Hai Jin","doi":"10.1109/ICPADS.2013.96","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.96","url":null,"abstract":"Microblogging services have experienced unprecedented growth. They serve more as news media outlets than online social networks, which can predict the H1N1 virus emergency, detect earthquakes, and live major events. These kinds of burst events will cause peak access. Servers will suffer from large amount of concurrent access and lead to single point of failures. Furthermore, divergent behaviors of two categories of users, social users and media users, will lead to asymmetric workloads. For some media users, such as Lady Gaga, who accounts for over 20 million followers, will generate a huge amount of traffic and make the centralized mechanism hard to scale. To address these problems together, we present SoMed, a hybrid DHT framework towards scalable, decentralized microblogging services. We also conduct a simulation with real traces of Twitter. The results show significantly bandwidth saving and response time reducing with high reliability and availability.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"28 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":"123869896","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}

{"title":"Optimizing Event Polling for Network-Intensive Applications: A Case Study on Redis","authors":"Xingbo Wu, Xiang Long, Lei Wang","doi":"10.1109/ICPADS.2013.122","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.122","url":null,"abstract":"In today's data centers supporting Internet-scale computing and I/O services, increasingly more network-intensive applications are deployed on the network as a service. To this end, it is critical for the applications to quickly retrieve requests from the network and send their responses to the network. To facilitate this network function, operating system usually provides an event notification mechanism so that the applications (or the library) know if the network is ready to supply data for them to read or to receive data for them to write. As a widely used and representative notification mechanism, epoll in Linux provides a scalable and high-performance implementation by allowing applications to specifically indicate which connections and what events on them need to be watched. As epoll has been used in some major systems, including KV systems, such as Redis and Memcached, and web server systems such as NGINX, we have identified a substantial performance issue in its use. For the sake of efficiency, applications usually use epoll's system calls to inform the kernel exactly of what events they are interested in and always keep the information up-to-date. However, in a system with demanding network traffic, such a rigid maintenance of the information is not necessary and the excess number of system calls for this purpose can substantially degrade the system's performance. In this paper, we use Redis as an example to explore the issue. We propose a strategy of informing the kernel of the interest events in a manner adaptive to the current network load, so that the epoll system calls can be reduced and the events can be efficiently delivered. We have implemented the strategy, named as FlexPoll, in Redis without modifying any kernel code. Our evaluation on Redis shows that the query throughput can be improved by up to 46.9% on micro benchmarks, and even up to 67.8% on workloads emulating real-world access patterns. FlexPoll can be extended to other applications and event libraries built on the epoll mechanism in a straightforward manner.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"49 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":"126418093","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}

{"title":"A Data-Aware Partitioning and Optimization Method for Large-Scale Workflows in Hybrid Computing Environments","authors":"Rubing Duan, Xiaorong Li","doi":"10.1109/ICPADS.2013.29","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.29","url":null,"abstract":"While hybrid computing environments provide good potential for achieving high performance and low economic cost, it also introduces a broad set of unpredictable overheads especially for running data-intensive applications. This paper describes a novel approach which refines workflow structures and optimizes intermediate data transfers for large-scale scientific workflows containing thousands (or even millions) of tasks. The proposed method includes pre- and post-partitioning of workflows and data-flow optimization. Firstly, it partitions a workflow by identifying the critical path of the task graph. Secondly, it controls the granularity of partitions to reduce the complexity of task graph in order to process large-scale workflows. Thirdly, it optimizes the data-flow based on the scheduling to minimize its communication overheads. Our proposed approach is able to handle complex data flows and significantly reduce data transfer by replacing individual tasks according to data dependencies. We conducted experiments using real applications such as Montage and Broadband, and the results demonstrated the effectiveness of our methods in achieving low execution time with low communication overhead in a hybrid computing environments.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"21 10 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":"125777118","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}

{"title":"Coexistence of Heterogeneous and Homogeneous Wireless Technologies in Smart Grid-Home Area Network","authors":"M. Sarijari, A. Lo, Mohd Sharil Abdullah, S. Groot, I. Niemegeers, R. Rashid","doi":"10.1109/ICPADS.2013.103","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.103","url":null,"abstract":"In a home environment, a Smart Grid Home Area Network (SG-HAN) platform facilitates collection and delivery of power consumption information for load profiling and informed decisions on energy management. However, one of the main challenges in HAN is the overcrowded unlicensed 2.4-GHz ISM frequency band, occupied by several types of radio technologies such as ZigBee, Bluetooth, and WiFi. It is crucial that those technologies coexist peacefully to allow each user of the radio technology to fulfill their communication goals. In this paper, we present a potential coexistence scenario in SG-HAN for homogeneous and heterogeneous wireless technologies. The coexistence impact on SG-HAN performance is then modeled and analyzed. The numerical results show significant performance degradation due to the interference for devices in close proximity with the interfering sources in a spectrum sharing environment where in the worst case scenario, SG-HAN communication is almost impossible.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"46 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":"132936364","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}

{"title":"Efficient Bulk Loading to Accelerate Spatial Keyword Queries","authors":"Dongsheng Li, Jinkun Pan, Jiaxin Li, K. Tan, Dongxiang Zhang","doi":"10.1109/ICPADS.2013.87","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.87","url":null,"abstract":"With the fast development of location-based services and geo-tagging, spatial keyword queries that retrieve objects satisfying both spatial and keyword conditions are gaining in prevalence. A hybrid index that integrates a spatial index (e.g., the R-tree or its variations) with a keyword filter offers a promising approach for processing such queries efficiently. However, it is still an open problem on how a hybrid index can be effectively constructed from scratch. The state-of-the-art bulk loading algorithms for the R-tree consider only spatial relationship, and cannot be employed for the hybrid index. In this paper, we propose a new bulk loading algorithm, named TPA, which constructs a hybrid index top-down. TPA utilizes a two-phase method to construct the children of nodes at each level of the hybrid index, taking both spatial and keyword information into consideration, and thus optimizes the hybrid index for spatial keyword queries. We analyze and evaluate its performance using both real and synthetic datasets. Comprehensive experiments show that TPA can achieve good performance and space utilization, reducing the construction time, the query latency and the index size remarkably.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221661","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}

{"title":"OutFlank Routing: Increasing Throughput in Toroidal Interconnection Networks","authors":"F. Versaci","doi":"10.1109/ICPADS.2013.40","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.40","url":null,"abstract":"We present a new, deadlock-free, routing scheme for toroidal interconnection networks, called OutFlank Routing (OFR). OFR is an adaptive strategy which exploits non-minimal links, both in the source and in the destination nodes. When minimal links are congested, OFR deroutes packets to carefully chosen intermediate destinations, in order to obtain travel paths which are only an additive constant longer than the shortest ones. Since routing performance is very sensitive to changes in the traffic model or in the router parameters, an accurate discrete-event simulator of the toroidal network has been developed to empirically validate OFR, by comparing it against other relevant routing strategies, over a range of typical real-world traffic patterns. On the 16×16×16 (4096 nodes) simulated network OFR exhibits improvements of the maximum sustained throughput between 14% and 114%, with respect to Adaptive Bubble Routing.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114525515","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}

{"title":"Towards Improving MapReduce Task Scheduling Using Online Simulation Based Predictions","authors":"Guanying Wang, Aleksandr Khasymski, K. Krish, A. Butt","doi":"10.1109/MASCOTS.2013.44","DOIUrl":"https://doi.org/10.1109/MASCOTS.2013.44","url":null,"abstract":"MapReduce is the model of choice for processing emerging big-data applications, and is facing an ever increasing demand for higher efficiency. In this context, we propose a novel task scheduling scheme that uses current task and system state information to drive online simulations concurrently within Hadoop, and predict with high accuracy future events, e.g., when a job would complete, or when task-specific data-local nodes would be available. These predictions can then be used to make more efficient resource scheduling decisions. Our framework consists of two components: (i) Task Predictor that predicts task-level execution times based on historical data of the same type of tasks, and (ii) Job Simulator that instantiates the real task scheduler in a simulated environment, and predicts expected scheduling decisions for all the tasks comprising a MapReduce job. Evaluation shows that our framework can achieve high prediction accuracy - 95% of the predicted task execution times are within 10% of the actual times - with negligible overhead (1.29%). Finally, we also present two realistic use cases, job data prefetching and a multi-strategy dynamic scheduler, which can benefit from integration of our prediction framework in Hadoop.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"33 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114115202","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}

{"title":"Policies for Efficient Data Replication in P2P Systems","authors":"João Paiva, L. Rodrigues","doi":"10.1109/icpads.2013.63","DOIUrl":"https://doi.org/10.1109/icpads.2013.63","url":null,"abstract":"This paper addresses the problem of maintaining replicated data in large scale P2P systems. Although this topic has been extensively studied in the literature, to maintain replicated data in this setting, in an efficient manner, still remains a significant challenge. This paper proposes novel policies to address this problem and evaluates their performance against different criteria, such as monitoring costs, data transfer costs, and load unbalance costs. We show that one of these new policies significantly outperforms previous work. Interestingly, this policy is based on a somehow counter-intuitive approach, that uses less reliable nodes to store the most accessed data items. The insights to derive this policy were obtained from an in depth analysis of existing solutions, that is also captured in the paper.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123739432","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}