2015 44th International Conference on Parallel Processing最新文献_第5页

Energy-Aware Cost-Effective Cooperative Mobile Streaming on Smartphones over Hybrid Wireless Networks 基于混合无线网络的智能手机节能高效协同移动流媒体

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.33

Zhihao Qu, Baoliu Ye, Bin Tang, Sanglu Lu, Song Guo

{"title":"Energy-Aware Cost-Effective Cooperative Mobile Streaming on Smartphones over Hybrid Wireless Networks","authors":"Zhihao Qu, Baoliu Ye, Bin Tang, Sanglu Lu, Song Guo","doi":"10.1109/ICPP.2015.33","DOIUrl":"https://doi.org/10.1109/ICPP.2015.33","url":null,"abstract":"The ever-increasing demands on mobile streaming over smartphones make the cellular networks always occupied by heavy load under traditional base-station-to-device (B2D) based streaming architecture, and even degrade the quality of service (QoS) seriously. To offload the traffic of cellular networks and provide scalable mobile streaming services with guaranteed QoS, in this paper we propose a device-to-device (D2D) communication motivated cooperative streaming framework by exploiting the capacity of both WiFi interface and cellular interface equipped with smartphones. Specifically, under the energy constraint of individual smartphone, we develop technique to minimize the over traffic of the cellular network by efficiently disseminating video over the D2D network with multi-hop routing supported. We formulate such an energy-aware cost-effective video dissemination problem as an integer linear programming problem, and show it to be NP-hard and even hard to approximate. We further present an energy allocation based algorithm and a simulated annealing heuristic algorithm which provide a trade-off between the performance and complexity to support the dissemination scheduling of cooperative mobile streaming. We evaluate the performance effectiveness of our proposal via both theoretical analysis and extensive simulation.","PeriodicalId":423007,"journal":{"name":"2015 44th International Conference on Parallel Processing","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133502291","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

Assessing the Impact of Partial Verifications against Silent Data Corruptions 评估部分验证对静默数据损坏的影响

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.53

Aurélien Cavelan, S. Raina, Y. Robert, Hongyang Sun

{"title":"Assessing the Impact of Partial Verifications against Silent Data Corruptions","authors":"Aurélien Cavelan, S. Raina, Y. Robert, Hongyang Sun","doi":"10.1109/ICPP.2015.53","DOIUrl":"https://doi.org/10.1109/ICPP.2015.53","url":null,"abstract":"Silent errors, or silent data corruptions, constitute a major threat on very large scale platforms. When a silent error strikes, it is not detected immediately but only after some delay, which prevents the use of pure periodic check pointing approaches devised for fail-stop errors. Instead, check pointing must be coupled with some verification mechanism to guarantee that corrupted data will never be written into the checkpoint file. Such a guaranteed verification mechanism typically incurs a high cost. In this paper, we assess the impact of using partial verification mechanisms in addition to a guaranteed verification. The main objective is to investigate to which extent it is worthwhile to use some light cost but less accurate verifications in the middle of a periodic computing pattern, which ends with a guaranteed verification right before each checkpoint. Introducing partial verifications dramatically complicates the analysis, but we are able to analytically determine the optimal computing pattern (up to the first-order approximation), including the optimal length of the pattern, the optimal number of partial verifications, as well as their optimal positions inside the pattern. Performance evaluations based on a wide range of parameters confirm the benefit of using partial verifications under certain scenarios, when compared to the baseline algorithm that uses only guaranteed verifications.","PeriodicalId":423007,"journal":{"name":"2015 44th International Conference on Parallel Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130499349","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

Spatial Locality-Aware Cache Partitioning for Effective Cache Sharing 空间位置感知缓存分区，实现有效的缓存共享

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.24

Saurabh Gupta, Huiyang Zhou

{"title":"Spatial Locality-Aware Cache Partitioning for Effective Cache Sharing","authors":"Saurabh Gupta, Huiyang Zhou","doi":"10.1109/ICPP.2015.24","DOIUrl":"https://doi.org/10.1109/ICPP.2015.24","url":null,"abstract":"In modern multi-core processors, last-level caches (LLCs) are typically shared among multiple cores. Previous works have shown that such sharing is beneficial as different workloads have different needs for cache capacity, and logical partitioning of capacity can improve system performance. However, what is missing in previous works on partitioning shared LLCs is that the heterogeneity in spatial locality among workloads has not been explored. In other words, all the cores use the same block/line size in shared LLCs. In this work, we highlight that exploiting spatial locality enables much more effective cache sharing. The fundamental reason is that for many memory intensive workloads, their cache capacity requirements can be drastically reduced when a large block size is employed, therefore they can effectively donate more capacity to other workloads. To leverage spatial locality for cache partitioning effectively, we first propose a simple yet effective mechanism to measure both spatial and temporal locality at run-time. The locality information is then used to determine both the proper block size and the capacity assigned to each workload. Our experiments show that our Spatial Locality-aware Cache Partitioning (SLCP) significantly outperforms the previous works. We also present several case studies that dissect the effectiveness of SLCP compared to the existing approaches.","PeriodicalId":423007,"journal":{"name":"2015 44th International Conference on Parallel Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126201393","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}

引用次数: 17

Joint Wireless Charging and Sensor Activity Management in Wireless Rechargeable Sensor Networks 无线可充电传感器网络中的联合无线充电和传感器活动管理

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.88

Yuanxiunan Gao, Cong Wang, Yuanyuan Yang

{"title":"Joint Wireless Charging and Sensor Activity Management in Wireless Rechargeable Sensor Networks","authors":"Yuanxiunan Gao, Cong Wang, Yuanyuan Yang","doi":"10.1109/ICPP.2015.88","DOIUrl":"https://doi.org/10.1109/ICPP.2015.88","url":null,"abstract":"Recent studies show that the novel wireless charging technology can extend the lifetime of Wireless Sensor Networks (WSNs) towards perpetual operations. Recharging Vehicles (RVs) can be applied in WSNs to recharge sensors conveniently via wireless charging devices. Most of existing work focused only on energy replenishment whereas ignored sensor activity management. In this paper, we propose a new framework that can jointly schedule sensor activity and recharging to save the traveling energy of RVs. First, we propose two schemes to manage sensor activity: balanced clustering and distributed sensor activation schemes. We further introduce a new metric so that the energy demand in each cluster can be managed. Then we formulate the recharging problem into a Traveling Salesman Problem with Profits, which is NP-hard. For the recharging route schedule, we first study the case of a single RV by coordinating sensor activity and energy replenishment, and then extend it to multiple RVs using two different schemes. The first scheme focuses on reducing traveling distance of RVs by confining their moving scopes and the second one improves the overall system performance by giving RVs a global view over the entire network. Finally, we validate the correctness and evaluate the performance of the sensor activity management schemes along with the recharging algorithms by extensive simulations. Our results indicate that significant reduction on system cost can be achieved. The sensor activity management schemes can save traveling energy of RVs by 16% while maintaining a reliable detection on targets. Compared with a simple greedy algorithm, the first and the second recharging schemes can save 41% and 13% traveling distance of RVs, and reduce nonfunctional nodes by 23% and 52%, respectively.","PeriodicalId":423007,"journal":{"name":"2015 44th International Conference on Parallel Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126325989","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

Characterizing Multi-media Retrieval Applications 多媒体检索应用的特征

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.36

Yunping Lu, Xin Wang, Weihua Zhang, Yi Li, Wenyun Zhao

{"title":"Characterizing Multi-media Retrieval Applications","authors":"Yunping Lu, Xin Wang, Weihua Zhang, Yi Li, Wenyun Zhao","doi":"10.1109/ICPP.2015.36","DOIUrl":"https://doi.org/10.1109/ICPP.2015.36","url":null,"abstract":"Multimedia data, especially image and video data, have become one of the most overwhelming data types on the Internet recently. Considering the user experience and real application requirements, multimedia data always demand a real-time processing speed. As a result, the huge amount of such data make retrieving useful information from them not only data-intensive, but also computation-intensive, which poses significant challenges to current system and architecture designs. Unfortunately, most prior studies focus only on text based retrieval systems or traditional multimedia processing applications. As far as we know, there is no systematic study on analyzing the characteristics of multimedia retrieval applications and how they might impact system and architecture designs. In this paper, we make the first attempt to construct a multimedia retrieval benchmark suite (called MMR Bench) to evaluate the corresponding system and architecture designs. To embody diverse multimedia retrieval applications, we collect eight state-of-the-art multimedia retrieval algorithms which cover the whole retrieval stages, including feature extraction, feature matching, and spatial verification. To satisfy diverse evaluation purposes, we implement multiple versions for each algorithm, including sequential version, pthread version for multi-core evaluation and data-parallel (i.e., Map-reduce) version for data-center evaluation. Moreover, MMR Bench provides flexible interfaces through retrieval stages, as well as a tool to adjust parameters and regenerating different scales of reasonable input. With such a flexible design, the algorithms in MMR Bench may be not only suitable for individual kernel-level evaluation, but also capable to be integrated into a complete infrastructure for system-level evaluation. Based on MMR Bench, we further analyze the inherent architectural characteristics, such as input size sensitivity and workload balance, which provides some insights into system and architecture design for multimedia retrieval applications.","PeriodicalId":423007,"journal":{"name":"2015 44th International Conference on Parallel Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124439736","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

DiMP: Architectural Support for Direct Message Passing on Shared Memory Multi-cores DiMP:在共享内存多核上传递直接消息的架构支持

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.22

Rubén Titos-Gil, Oscar Palomar, O. Unsal, A. Cristal

引用次数: 2

Automatic Performance Tuning of Stencil Computations on GPUs gpu上模板计算的自动性能调优

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.39

Joseph Garvey, T. Abdelrahman

引用次数: 24

MAMS: A Highly Reliable Policy for Metadata Service MAMS:元数据服务的高可靠策略

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.82

Jiang Zhou, Yong Chen, Weiping Wang, Dan Meng

{"title":"MAMS: A Highly Reliable Policy for Metadata Service","authors":"Jiang Zhou, Yong Chen, Weiping Wang, Dan Meng","doi":"10.1109/ICPP.2015.82","DOIUrl":"https://doi.org/10.1109/ICPP.2015.82","url":null,"abstract":"Most mass data processing applications nowadays often need long, continuous, and uninterrupted data access. Parallel/distributed file systems often use multiple metadata servers to manage the global namespace and provide a reliability guarantee. With the rapid increase of data amount and system scale, the probability of hardware or software failures keeps increasing, which easily leads to multiple points of failures. Metadata service reliability has become a crucial issue as it affects file and directory operations in the event of failures. Existing reliable metadata management mechanisms can provide fault tolerance but have disadvantages in system availability, state consistence, and performance overhead. This paper introduces a new highly reliable policy called MAMS (multiple actives multiple standbys) to ensure multiple metadata service reliability in file systems. Different from traditional strategies, the MAMS divides metadata servers into different replica groups and maintains more than one standby node for failover in each group. Combining the global view with distributed protocols, the MAMS achieves an automatic state transition and service takeover. We have implemented the MAMS policy in a prototyping file system and conducted extensive tests to validate and evaluate it. The experimental results confirm that the MAMS policy can achieve a faster transparent fault tolerance in different error scenarios with less influence on metadata operations. Compared with typical designs in Hadoop Avatar, Hadoop HA, and Boom-FS file systems, the mean time to recovery (MTTR) with the MAMS was reduced by 80.23%, 65.46% and 28.13%, respectively.","PeriodicalId":423007,"journal":{"name":"2015 44th International Conference on Parallel Processing","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115847199","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

Enhancing Garbage Collection Synchronization Using Explicit Bit Barriers 使用显式位屏障增强垃圾收集同步

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.86

J. Hollmann, J. Gil, P. Stenström

引用次数: 0

LCIndex: A Local and Clustering Index on Distributed Ordered Tables for Flexible Multi-dimensional Range Queries LCIndex:用于灵活多维范围查询的分布式有序表的局部和聚类索引

2015 44th International Conference on Parallel Processing Pub Date : 2015-09-01 DOI: 10.1109/ICPP.2015.81

Chen Feng, Xi Yang, Fan Liang, Xian-He Sun, Zhiwei Xu

引用次数: 12