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

Performance and energy evaluation of RESTful web services in Raspberry Pi 树莓派中RESTful web服务的性能和能量评估

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

L. H. Nunes, L. H. Nakamura, H. Vieira, R. M. D. O. Libardi, E. M. Oliveira, J. C. Estrella, S. Reiff-Marganiec

{"title":"Performance and energy evaluation of RESTful web services in Raspberry Pi","authors":"L. H. Nunes, L. H. Nakamura, H. Vieira, R. M. D. O. Libardi, E. M. Oliveira, J. C. Estrella, S. Reiff-Marganiec","doi":"10.1109/PCCC.2014.7017086","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017086","url":null,"abstract":"Green computing has emerged as a hot topic leading to a need to understand energy consumption of computations. This need also extends to devices with limited resources as are common in the internet of things. RESTful services have shown their potential on such devices, but there are many choices of frameworks for their development and execution. Current research has analysed performance of the frameworks but no attention has been given to systematically studying their power consumption. In this paper we analyse the execution behaviour and power consumption of web services on devices with limited resources and make initial observations that should influence future development of web service frameworks. Specifically, we conduct experiments comparing web services in the Axis2 and CXF frameworks analysing the respective performance and power consumption. Bringing together the best features of small devices and SoC, it is possible to provide diverse, mobile and green applications - however careful selection of development environments can make significant differences in performance and energy consumption.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130710774","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

Proximity-driven social interactions and their impact on the throughput scaling of wireless networks 近距离驱动的社会互动及其对无线网络吞吐量扩展的影响

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

A. Dabirmoghaddam, J. Garcia-Luna-Aceves

引用次数: 1

A domain-specific language to facilitate software defined radio parallel executable patterns deployment on heterogeneous architectures 促进在异构架构上部署软件定义无线电并行可执行模式的特定领域语言

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

L. Mohapi, S. Winberg, M. Inggs

{"title":"A domain-specific language to facilitate software defined radio parallel executable patterns deployment on heterogeneous architectures","authors":"L. Mohapi, S. Winberg, M. Inggs","doi":"10.1109/PCCC.2014.7017083","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017083","url":null,"abstract":"In this paper, we present a domain-specific language, referred to as OptiSDR, that matches high level digital signal processing (DSP) routines for software defined radio (SDR) to their generic parallel executable patterns targeted to heterogeneous computing architectures (HCAs). These HCAs includes a combination of hybrid GPU-CPU and DSP-FPGA architectures that are programmed using different programming paradigms such as C/C++, CUDA, OpenCL, and/or VHDL. OptiSDR presents an intuitive single high-level source code and near specification-level approach for optimization and facilitation of HCAs. OptiSDR uses an optimized embedded domain-specific language (DSL) compiler framework called Delite. Our focus is on the programming language expressiveness for parallel programming and optimization of typical DSP algorithms for deployment on SDR HCAs. We demonstrate the capability of OptiSDR to express the solution to the issues of parallel DSP low-level implementation complexities in the closest way to the original parallel programming of SDR systems. This paper will achieve these by focusing on three generic parallel executable patterns suitable for DSP routines such as cross-correlation, convolution in FIR filter based Hilbert transformers, and fast Fourier transforms for spectral analysis. This paper concludes with a performance analysis using DSP algorithms that tests automatically generated code against hand-crafted solutions.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"49 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":"128217110","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

An efficient certificate revocation scheme for large-scale AMI networks 一种有效的大规模AMI网络证书撤销方案

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

Mohamed Mahmoud, K. Akkaya, Khaled Rabieh, Samet Tonyali

{"title":"An efficient certificate revocation scheme for large-scale AMI networks","authors":"Mohamed Mahmoud, K. Akkaya, Khaled Rabieh, Samet Tonyali","doi":"10.1109/PCCC.2014.7017076","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017076","url":null,"abstract":"Given the large geographic deployment and scalability of the Advanced Metering Infrastructure (AMI) networks, it is inefficient to create one large certificate revocation list (CRL) for all the networks. It is also inefficient to create a CRL for each meter having the certificates it needs because too many CRLs will be required. It is beneficial to balance the size of the CRLs and the overhead of forming and distributing them. In this paper, the certificate authority (CA) groups the AMI networks and composes one CRL for each group. We use Bloom filter to reduce the number of CRLs by increasing the groups size with acceptable overhead on the meters. However, Bloom filters suffer from false positives which is not acceptable in AMI networks because meters may miss important messages. We propose a novel scheme to identify and mitigate the false positives by making use of the fact that Bloom filters are free of false negatives. The meters should contact the gateway to resolve the false positives. We use Merkle tree to enable the gateway to provide efficient proof for certificate revocation without contacting the CA. We derive a mathematical formula to the probability of contacting the gateway as a function of the filter's parameters. We will show that this probability can be low by properly designing the Bloom filter. In order to assess the performance and the applicability of the proposed scheme, we use ns-3 network simulator to implement the scheme in a IEEE 802.11s-based mesh AMI networks. The results demonstrate that our scheme can be used efficiently for AMI networks.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"156 1 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":"128719243","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}

引用次数: 13

Delay-impact-based local deadline assignment for online scheduling of distributed soft real-time applications 分布式软实时应用在线调度中基于延迟影响的本地截止时间分配

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

Miao Song, Shuhui Li, Shangping Ren, Gang Quan

{"title":"Delay-impact-based local deadline assignment for online scheduling of distributed soft real-time applications","authors":"Miao Song, Shuhui Li, Shangping Ren, Gang Quan","doi":"10.1109/PCCC.2014.7017061","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017061","url":null,"abstract":"Distributed soft real-time applications often involve multiple jobs that are executed on different processing units. Hence, resource competitions among these applications can be on any processing unit in the system. However, due to distributed nature of these applications, each processing unit may not have the knowledge about the workload on other processing units. Therefore, scheduling decisions made by individual processing units about their local job execution orders may not be optimal for the applications to which the jobs belong with respect to meeting the applications' end-to-end deadlines. In this paper, we first introduce a metric to measure, at a local processing unit, the risk of a distributed soft real-time application missing its end-to-end deadline. Second, based on the metric, we develop a local deadline assignment algorithm, i.e., the delay-impact-based (DIB) local deadline assignment algorithm. With the DIB algorithm, distributed processing units can independently schedule their local job sets based on the assigned job deadlines with maximized successful ratio of meeting distributed real-time applications' end-to-end deadlines. We empirically compare the DIB algorithm with three commonly used local deadline assignment algorithms, i.e., the OLDA, Pure, and Norm algorithms. The experimental results show that the DIB algorithm has clear advantage over the OLDA, Pure, and Norm approaches - it results in up to 50%, 35%, and 35% higher successful ratio than the OLDA, Pure, and Norm approaches with respect to meeting application's end-to-end deadlines, respectively. Furthermore, for those applications that do miss their end-to-end deadlines, the application execution delay ratio resulted by the DIB algorithm is also up to 300%, 50%, and 150% smaller comparing to the other three approaches.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"50 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":"128631342","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

Analyzing I/O patterns for the design of energy-efficient image servers 分析I/O模式，设计节能映像服务器

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

Jaemyoun Lee, Kyungtae Kang, Changlai Song

引用次数: 4

POLA: A privacy-preserving protocol for location-based real-time advertising POLA:基于位置的实时广告的隐私保护协议

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

Yiming Pang, Yichen Chen, Peiyuan Liu, Fudong Qiu, Fan Wu, Guihai Chen

{"title":"POLA: A privacy-preserving protocol for location-based real-time advertising","authors":"Yiming Pang, Yichen Chen, Peiyuan Liu, Fudong Qiu, Fan Wu, Guihai Chen","doi":"10.1109/PCCC.2014.7017108","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017108","url":null,"abstract":"The increasing popularity of smartphones, equipped with GPS, provides new opportunities for location-based service (LBS). Among all kinds of LBSs, targeted advertising based on users' locations takes great advantage of the rich location data to improve the accuracy of advertising and thus potentially increase the sellers' profits. However, location-based advertising (LBA) has raised significant privacy concerns, since the location information used in such kinds of services is private information, which the users may not be willing to expose. In this paper, we present POLA, which is a Privacy-preserving prOtocol for Location-based real-time Advertising. In this protocol, we not only preserve the privacy of the location data, we also take the values of advertisers into consideration which is also regarded as private information. We show the privacy-preserving properties of POLA in details. Furthermore, we have conducted simulations to evaluate the performance of POLA. Evaluation results show that POLA achieves privacy preserving LBA with relatively low overhead.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"24 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113964135","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

TMODF: Trajectory-based multi-objective optimal data forwarding in vehicular networks 基于轨迹的车辆网络多目标最优数据转发

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

Mao-Bao Fu, Xin Li, Fan Li, Xinyu Guo, Zhi-Li Wu

{"title":"TMODF: Trajectory-based multi-objective optimal data forwarding in vehicular networks","authors":"Mao-Bao Fu, Xin Li, Fan Li, Xinyu Guo, Zhi-Li Wu","doi":"10.1109/PCCC.2014.7017077","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017077","url":null,"abstract":"Vehicular networks have been increasingly used for applications like road infrastructure monitoring and traffic jam detection, etc. Data forwarding is a well-known challenging problem in vehicular networks, which suffers from delay and error due to the frequent network disruption and fast topological change. The minimizations of the delivery delay and network cost are both central to data forwarding in vehicular networks. However, previous works usually focus on only one of the two objectives and most of them do not make good use of vehicle trajectory information. In this paper, we formulate the V2V (vehicle to vehicle) data forwarding problem as a novel multi-objective Markov Decision Process (MDP). We exploit the vehicle trajectory information and traffic statistics to estimate the parameters of the MDP (i.e., transition probabilities, rewards). The optimal routing policy is then developed by solving the multi-objective MDP. We conduct extensive simulations on a taxi network in a mega-city, the experimental results validate the effectiveness of our proposed mechanism.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"160 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":"131965069","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

QGrid: Q-learning based routing protocol for vehicular ad hoc networks QGrid:基于q学习的车辆自组织网络路由协议

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

Ruiling Li, Fan Li, Xin Li, Yu Wang

{"title":"QGrid: Q-learning based routing protocol for vehicular ad hoc networks","authors":"Ruiling Li, Fan Li, Xin Li, Yu Wang","doi":"10.1109/PCCC.2014.7017079","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017079","url":null,"abstract":"In Vehicular Ad Hoc Networks (VANETs), moving vehicles are considered as mobile nodes in the network and they are connected to each other via wireless links when they are within the communication radius of each other. Efficient message delivery in VANETs is still a very challenging research issue. In this paper, a Q-learning based routing protocol (i.e., QGrid) is introduced to help to improve the message delivery from mobile vehicles to a specific location. QGrid considers both macroscopic and microscopic aspects when making the routing decision, while the traditional routing methods focus on computing meeting information between different vehicles. QGrid divides the region into different grids. The macroscopic aspect determines the optimal next-hop grid and the microscopic aspect determines the specific vehicle in the optimal next-hop grid to be selected as next-hop vehicle. QGrid computes the Q-values of different movements between neighboring grids for a given destination via Q-learning. Each vehicle stores Q-value table learned offline, then selects optimal next-hop grid by querying Q-value table. Inside the selected next-hop grid, we either greedily select the nearest neighboring vehicle to the destination or select the neighboring vehicle with highest probability of moving to the optimal next-hop grid predicted by the two-order Markov chain. The performance of QGrid is evaluated by using real life trajectory GPS data of Shanghai taxies. Simulation comparison among QGrid and other existing position-based routing protocols confirms the advantages of proposed QGrid routing protocol for VANETs.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"40 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":"133229654","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}

引用次数: 30

Cloud-assisted dynamic spectrum access for VANET in transportation cyber-physical systems 交通网络物理系统中VANET的云辅助动态频谱接入

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

D. Rawat, S. Lenkala, Nimish Sharma, S. Shetty

引用次数: 4