{"title":"A QoS-aware Web Service Selection Method Based on Credibility Evaluation","authors":"Lianyong Qi, Rutao Yang, Wenmin Lin, Xuyun Zhang, Wanchun Dou, Jinjun Chen","doi":"10.1109/HPCC.2010.20","DOIUrl":"https://doi.org/10.1109/HPCC.2010.20","url":null,"abstract":"There exist so many web services that share same or similar functional properties, so it is often a challenging effort to select a credible and optimal web service based on their various history QoS records. In view of this challenge, in this paper, a novel QoS-aware web service selection method is put forward, based on credibility evaluation associated with negotiated QoS dimensions. More specifically, the historical empirical data, i.e., execution logs of a service, are used for evaluation purpose. At last, a case study is employed for illustration purpose, and the evaluations are presented to demonstrate the feasibility of our method.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132327460","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":"The Energy Cost of Control Packets in Hybrid MAC Protocols","authors":"Qian Dong, W. Dargie, A. Schill","doi":"10.1109/HPCC.2010.118","DOIUrl":"https://doi.org/10.1109/HPCC.2010.118","url":null,"abstract":"This paper investigates the energy cost of control packets in contention-based medium access control protocols in wireless sensor networks. Control packets are useful to avoid collision and overhearing, but cost a significant amount of energy. Therefore, whether or not to apply control packets is a trade-off. It will be shown that this trade-off mainly depends on the packet arrival rate at individual nodes, the transmission rate, the duty cycle and the average number of active neighbors in the network.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130038251","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":"Option Pricing on the GPU","authors":"Steven Solomon, R. Thulasiram, P. Thulasiraman","doi":"10.1109/HPCC.2010.54","DOIUrl":"https://doi.org/10.1109/HPCC.2010.54","url":null,"abstract":"In recent years, Graphics Processing Units (GPUs) have been opened to general purpose programming. As a result, researchers and developers have access to the massively parallel GPU architecture for applications beyond that of graphics rendering and gaming. We first investigate a design and implementation of the trinomial lattice strategy for the pricing of simple European options on the GPU. This implementation serves to allow a comparison to be made to an existing, alternative implementation on the GPU. Following this introduction, we design an algorithm for pricing an exotic American look back option and analyze its pricing performance on the GPU. This look back option pricing algorithm showcases tremendous speedup over a sequential CPU implementation and hence suitable for real-time application.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131022925","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":"Exploiting Parallelism in Iterative Irregular Maxflow Computations on GPU Accelerators","authors":"Steven Solomon, P. Thulasiraman, R. Thulasiram","doi":"10.1109/HPCC.2010.44","DOIUrl":"https://doi.org/10.1109/HPCC.2010.44","url":null,"abstract":"The Graphics Processing Unit (GPU) is an asymmetric, heterogeneous multi-core architecture that can be used for high performance parallel computing applications. However, a significant level of interest has been focused on algorithms for solving regular problems, as these applications typically map well to the GPU. Irregular applications, which rely on pointer or graph-based data structures, have not been as extensively studied and are significantly more difficult to implement or map in an efficient fashion on the GPU. In this paper, we consider a graph-based maximum ???ow algorithm that has applications in network optimization problems. In the literature, the push-relabel maximum ???ow algorithm has been considered on the GPU. We believe that Malhotra, Pramodh Kumar and Maheshwari’s algorithm is better suited for the GPU due to the synchronous, iterative nature of the algorithm. As a result, we choose this algorithm for our study. We show that the performance of the GPU algorithm far exceeds that of a sequential CPU algorithm.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132731223","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":"Regional Clustering Scheme in Densely Deployed Wireless Sensor Networks for Weather Monitoring Systems","authors":"Dongmin Choi, S. Moh, I. Chung","doi":"10.1109/HPCC.2010.52","DOIUrl":"https://doi.org/10.1109/HPCC.2010.52","url":null,"abstract":"Clustering protocol that is used in wireless sensor network is an efficient method that extends the lifetime of the entire network. However, when this method is applied to an environment in which collected data of the sensor node easily overlap, sensor nodes unnecessarily consumes so much energy. In the case of clustering technique that use a threshold, the lifetime of the network is extended but the degree of accuracy of collected data is low. Therefore it is hard to trust the data and improvement is needed. In addition, it is hard for the clustering protocol that uses multi-hop transmission to normally collect data because the selection of a cluster head node occurs at random and therefore the link of nodes is often disconnected. Considering the whole networks, nodes nearer the sink have to take heavier traffic load. Therefore, nodes around the sink would deplete their energy faster, leading to what is called an energy hole around the sink. Accordingly this paper suggested a cluster-formation algorithm that reduces unnecessary energy consumption and that works with an alleviated link disconnection. According to the result of performance analysis that used environment data, the suggested method lets the nodes consume less energy than the existing clustering method and the transmission efficiency is increased and the entire lifetime is prolonged by about 30%.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"34 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133106754","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 Distributed Slot Assignment Algorithm with Minimum Jitter and Delay Guarantee for Real Time Applications for Wireless Sensor Networks","authors":"Liqiang Tao, Fengqi Yu","doi":"10.1109/HPCC.2010.112","DOIUrl":"https://doi.org/10.1109/HPCC.2010.112","url":null,"abstract":"This work presents a distributed time slot assignment algorithm which adopts TDMA as Medium Access Control, specially suited to support applications with strict delay, jitter and throughput requirements characterized by convergecast traffic patterns in sensor networks. (E.g. wireless video surveillance sensor networks). Our algorithm has three characteristics: (1) Every node is guaranteed a path to the base station for its data delivery. In the path, sufficient resource is reserved and weighted fairness can be achieved. (2) It uses cascading time slot assignment and jitter minimization algorithm in each node to minimize jitter and end to end delay (3) Nodes are only active during their scheduled slots and sleep otherwise. This offers energy saving by reducing idle listening and avoiding overhearing. The performance of the proposed algorithm is evaluated over simulations and analyzed theoretically in comparison with FlexiTP which is a recently proposed delay aware MAC protocol. The results show that our algorithm provides lower end-to-end delay, jitter and higher throughput.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130789657","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}
Tyng-Yeu Liang, P. Lo, Min-Jyun Chen, Ti-Hsin Wang, Jyh-Biau Chang
{"title":"An Adaptive Remote Paging System on Computational Grids","authors":"Tyng-Yeu Liang, P. Lo, Min-Jyun Chen, Ti-Hsin Wang, Jyh-Biau Chang","doi":"10.1109/HPCC.2010.80","DOIUrl":"https://doi.org/10.1109/HPCC.2010.80","url":null,"abstract":"This paper is aimed at developing a novel remote-paging system called Adaptive Grid Remote Pager (AGRP) on computational grids. Different to related work, this system is able to promise the effectiveness of remote paging. To achieve this goal, the resource broker of AGRP allocates only the grid nodes which are helpful for the performance of user programs to play the memory servers of remote paging. On the other hand, the memory servers automatically adapt their memory utilization through page migration to avoid the negative impact of memory competition from the local jobs at their execution nodes. Moreover, the memory clients always select the best one from their corresponding memory servers for each page-out request to minimize the latency of remote paging. We have implemented the proposed system in this paper. Our experimental results show that the proposed system indeed can dramatically improve the execution performance of the test program due to a significant reduction of the remote-paging latency and the avoidance in memory competition.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132487457","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 Feasible Localization Algorithm for Wireless Sensor Networks Using Directional Antenna","authors":"Baoli Zhang, Fengqi Yu","doi":"10.1109/HPCC.2010.93","DOIUrl":"https://doi.org/10.1109/HPCC.2010.93","url":null,"abstract":"Recent years, directional antenna has been extensively used in designing protocols for wireless sensor networks. It provides many advantages over classical omni-directional antenna, such as increased spatial reuse ratio and reduced energy consumption. In wireless sensor networks, location estimation is necessary for sensor nodes to provide meaningful information about their surrounding environment. Numerous localization schemes using anchor nodes equipped with low gain omni-directional antenna have been proposed. Since the omni-directional antenna radiate energy in all directions, wanted signal is easily interfered with wide range of environment noise, leading to big localization error. In contrast, a directional antenna concentrates its energy in a particular direction. The reduction in interference of surrounding sensor nodes increases localization accuracy. In this paper, we tackle the problems in estimating location of randomly deployed sensor nodes with a low gain omni-directional antenna. We propose a novel localization scheme using a mobile anchor node equipped with a directional antenna. Our localization scheme is verified by OPNET simulation software. The result shows that the proposed localization algorithm has higher accuracy and energy efficiency than other localization schemes.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132141995","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 Utilization of WLAN Networks in the Next-Generation Heterogeneous Environments","authors":"Ammar Haider, I. Gondal, J. Kamruzzaman, B. Qiu","doi":"10.1109/HPCC.2010.57","DOIUrl":"https://doi.org/10.1109/HPCC.2010.57","url":null,"abstract":"Wireless local area networks (WLANs) offer a promising role in the fourth-generation heterogeneous wireless networks. This requires efficient and timely switching of a mobile node’s connection (called vertical handover) from cellular network to WLAN. Existing methods to initiate vertical handover do not fully utilize the WLAN potential and result in switching to cellular networks even when a WLAN network is available. We propose a hybrid approach to determine vertical handover timing with a goal to maximize the utilization of WLAN resources, while maintaining a low probability of handover failure. Simulation results indicate the proposed technique showing better performance in terms of number of ping-pong events and handover dropping probability as compared to existing techniques which are based on mean RSS, FFT and adaptive threshold.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126583423","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}
Kai Wang, Fei Chen, Zheng Cao, Xuejun An, Ninghui Sun
{"title":"Adding an Expressway to Accelerate the Neighborhood Communication","authors":"Kai Wang, Fei Chen, Zheng Cao, Xuejun An, Ninghui Sun","doi":"10.1109/HPCC.2010.16","DOIUrl":"https://doi.org/10.1109/HPCC.2010.16","url":null,"abstract":"The blade system is very popular in high performance computing. In a blade system, the blade is a fundamental element in which are symmetric multi-processors (SMP). About ten blades constitute a blade box, several blade boxes constitute a cabinet and some cabinets constitute a blade system at last. The blades in a blade box are neighbors because they have relatively short distance. Programmers always try to place the tightly related processes into the same blade box. However, there’s seldom any optimization made by hardware to accelerate the communication in a blade box. Thus, a single chip design called hyper-node controller is presented to provide ultra low latency and high bandwidth which resembles an expressway between neighbors. All the nodes in a blade box can act as a single hyper node by using the hyper-node controller. It is apparent that the additional controller is a useful supplement to efficiently enhance the communication in a blade box and finally enhance the entire blade system. A FPGA prototype of the hyper-node controller has been implemented and it can connect five blades simultaneously. In the preliminary performance evaluation, the latency for an 8-byte payload between two blades is less than 1us, 1.33GB/s which is nearly 94% of the peak effective bandwidth can be obtained by transferring messages with a payload of only 256 bytes.","PeriodicalId":290454,"journal":{"name":"2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131112692","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}