2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)最新文献_第7页

A knowledge management approach for testing open source software systems 用于测试开源软件系统的知识管理方法

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017022

T. Abdou, Pankaj Kamthan

引用次数: 3

EPPI: An E-cent-based privacy-preserving incentive mechanism for participatory sensing systems EPPI:参与式传感系统中基于e美分的隐私保护激励机制

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017066

Xiaoguang Niu, Meng Li, Qianyuan Chen, Qingqing Cao, Houzhen Wang

{"title":"EPPI: An E-cent-based privacy-preserving incentive mechanism for participatory sensing systems","authors":"Xiaoguang Niu, Meng Li, Qianyuan Chen, Qingqing Cao, Houzhen Wang","doi":"10.1109/PCCC.2014.7017066","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017066","url":null,"abstract":"The proliferation of mobile devices has facilitated the prevalence of participatory sensing applications in which participants collect and share information in their environments. The design of a participatory sensing application confronts two challenges: “privacy” and “incentive” which are two conflicting objectives and deserve deeper attention. Inspired by physical currency circulation system, this paper firstly proposes E-cent, a unit bearer currency. It is exchangeable, and participants can utilize it to participate in tasks anonymously. By employing E-cent, we further propose an E-cent-based privacy-preserving incentive mechanism, called EPPI, which exploits a pledge-based participating protocol to encourage participants to participate without revealing privacy and prohibit participants from sending false data. EPPI also takes advantage of a dynamic reward allocation scheme to maximize the value of the services under a budget constraint. To the best of our knowledge, EPPI is the first attempt to build an incentive mechanism while maintaining the desired privacy-preserving in participatory sensing systems. Extensive simulation and analysis results show that EPPI can achieve high anonymity level and remarkable incentive effects.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129541585","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

Replica placement in content delivery networks with stochastic demands and M/M/1 servers 具有随机需求和M/M/1服务器的内容分发网络中的副本放置

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017098

Chenkai Yang, Liusheng Huang, Bing Leng, Hongli Xu, Xinglong Wang

{"title":"Replica placement in content delivery networks with stochastic demands and M/M/1 servers","authors":"Chenkai Yang, Liusheng Huang, Bing Leng, Hongli Xu, Xinglong Wang","doi":"10.1109/PCCC.2014.7017098","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017098","url":null,"abstract":"Content Delivery Network (CDN) is proposed for replicating data objects at multiple locations in the network and encounters vast potential for future development, as a result of which, a number of replica placement techniques have been proposed over the last decade. However, most of the existing works on replica placement (RP) ignore the statistical property of the demands and the restricted service rate of the servers. In this paper, we investigate the techniques of replica placement in CDNs with stochastic demands and M/M/1 servers to optimize the overall performance in the network. We first model the demands and the servers as independent Poisson streams and simple M/M/1 queueing systems, respectively. Then, a formal definition and formalization of RP problem will be given. We show that RP problem is NP-complete and propose two heuristic algorithms: Greedy Dropping (GD) and Tabu Search (TS). We conduct abundant simulation experiments to evaluate the performance of our proposed algorithms. According to our simulation results, both of the two algorithms are efficient in finding a feasible solution with high probability. Especially, the TS decreases the average delay of the demands about 50% on average.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"41 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114039600","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

ERUPT: Energy-efficient trustworthy provenance trees for wireless sensor networks 爆发:无线传感器网络的节能可靠来源树

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017089

S. Alam, David K. Y. Yau, S. Fahmy

{"title":"ERUPT: Energy-efficient trustworthy provenance trees for wireless sensor networks","authors":"S. Alam, David K. Y. Yau, S. Fahmy","doi":"10.1109/PCCC.2014.7017089","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017089","url":null,"abstract":"Sensor nodes are inherently unreliable and prone to hardware or software faults. Thus, they may report untrustworthy or inconsistent data. Assessing the trustworthiness of sensor data items can allow reliable sensing or monitoring of physical phenomena. A provenance-based trust framework can evaluate the trustworthiness of data items and sensor nodes based on the intuition that two data items with similar data values but with different provenance (i.e., forwarding path) can be considered more trustworthy. Forwarding paths of data items generated from redundantly deployed sensors should consist of trustworthy nodes and remain dissimilar. Unfortunately, operating many sensors with dissimilar paths consumes significant energy. In this paper, we formulate an optimization problem to identify a set of sensor nodes and their corresponding paths toward the base station that achieve a certain trustworthiness threshold, while keeping the energy consumption of the network minimal. We prove the NP-hardness of this problem and propose ERUPT, a simulated annealing solution. Testbed and simulation results show that ERUPT achieves high trustworthiness, while reducing total energy consumption by 32-50% with respect to current approaches.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123229240","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

GPU acceleration of finding LPRs in DNA sequence based on SUA index 基于SUA索引的DNA序列lpr查找GPU加速

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017064

Shufang Du, Longjiang Guo, Chunyu Ai, Meirui Ren, Hao Qu, Jinbao Li

引用次数: 1

Sensitivity analysis of availability of video streaming service in cloud computing 云计算视频流服务可用性敏感性分析

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017029

Rosangela Melo, Maria Clara Bezerra, J. Dantas, Rúbens de Souza Matos Júnior, I. J. M. Filho, P. Maciel

引用次数: 2

Enhancing the I/O system for virtual machines using high performance SSDs 使用高性能ssd增强虚拟机的I/O系统

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017096

Myoungwon Oh, Hyeonsang Eom, H. Yeom

{"title":"Enhancing the I/O system for virtual machines using high performance SSDs","authors":"Myoungwon Oh, Hyeonsang Eom, H. Yeom","doi":"10.1109/PCCC.2014.7017096","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017096","url":null,"abstract":"Storage I/O in VM (Virtual Machine) environments, which requires low latency, becomes problematic as the fast storage such as SSDs (Solid-State Drives) is currently in use. The low performance problem in the VM environment is caused by 1) the presence of additional software layer such as guest OS, 2) context switching between VM and host OS, and 3) scheduling delay for I/O process. These factors do not cause serious problems in the case of using HDD which leads to high latency batching. However, there will be significant performance degradation when fast storage devices are used. To address this problem, we have proposed the following methods to improve the performance of I/O stack in the VM environments by attempting to optimize the I/O stack: one is pipelined polling, and the other is multiple issues and multiple completions. We have found via experiments that our approach leads to increases in the performance of SSDs in a VM environment by up to 50% when multiple VM storage devices are used, and that it leads to improvements in the performance by more than 80% when a single VM storage device is used, with the CPU utilization reduced by up to 25%.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128643267","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}

引用次数: 10

A novel method to estimate performance for a high performance computation workload 一种新的高性能计算负载性能估计方法

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017027

J. Issa

引用次数: 1

Evaluation of a platform for the provisioning of community-contributed web services 评估用于提供社区贡献的web服务的平台

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017057

D. Vijayakumar, Q. Mahmoud

引用次数: 1

Empirical capacity modeling and evaluation of delay tolerant network routing protocols 时延容忍网络路由协议的经验容量建模与评价

2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC) Pub Date : 2014-12-01 DOI: 10.1109/PCCC.2014.7017046

Jeremiah D. Deng

引用次数: 1