2012 12th International Symposium on Pervasive Systems, Algorithms and Networks最新文献

{"title":"EHA: The Extremely Heterogeneous Architecture","authors":"Shaoshan Liu, W. Ro, C. Liu, A. C. Salas, C. Cérin, Jianjun Han, J. Gaudiot","doi":"10.1109/I-SPAN.2012.11","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.11","url":null,"abstract":"The computer industry is moving towards two extremes: extremely high-performance high-throughput cloud computing, and low-power mobile computing. Cloud computing, while providing high performance, is very costly. Google and Microsoft Bing spend billions of dollars each year to maintain their server farms, mainly due to the high power bills. On the other hand, mobile computing is under a very tight energy budget, but yet the end users demand ever increasing performance on these devices. This trend indicates that conventional architectures are not able to deliver high-performance and low power consumption at the same time, and we need a new architecture model to address the needs of both extremes. In this paper, we thus introduce our Extremely Heterogeneous Architecture (EHA) project: EHA is a novel architecture that incorporates both general-purpose and specialized cores on the same chip. The general-purpose cores take care of generic control and computation. On the other hand, the specialized cores, including GPU, hard accelerators (ASIC accelerators), and soft accelerators (FPGAs), are designed for accelerating frequently used or heavy weight applications. When acceleration is not needed, the specialized cores are turned off to reduce power consumption. We demonstrate that EHA is able to improve performance through acceleration, and at the same time reduce power consumption. Since EHA is a heterogeneous architecture, it is suitable for accelerating heterogeneous workloads on the same chip. For example, data centers and clouds provide many services, including media streaming, searching, indexing, scientific computations. The ultimate goal of the EHA project is two-fold: first, to design a chip that is able to run different cloud services on it, and through this design, we would be able to greatly reduce the cost, both recurring and non-recurring, of data centersclouds, second, to design a light-weight EHA that runs on mobile devices, providing end users with improved experience even under tight battery budget constraints.","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123098842","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":"Making High-Speed OQ Switches with QoS Guarantees Practical","authors":"S. Zheng, Jianping Wang, Yaohui Jin","doi":"10.1109/I-SPAN.2012.13","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.13","url":null,"abstract":"A store-and-forward packet switched network consists of switches or routers (nodes) and the links connecting them as shared resources. Ideally, network switches employ output queueing. When a packet arrives at an output-queued (OQ) switch, it is immediately placed in a queue that is dedicated to its output link. Separating switching from scheduling makes it easier to design scheduling algorithms to achieve performance guarantees. Many packet scheduling algorithms for OQ switches have been proposed and shown capable of providing QoS guarantees. Output queueing, however, has been considered either impossible or impractical for high-speed networks, because it requires the switching fabric and memory to run N times as fast as the line rate. Memory with bandwidth sufficient for implementing a high-speed OQ switch with a large number of ports simply does not exist. In practice, input-queued (IQ) switches and combined input and output queued (CIOQ) switches are used. In this paper, we present an innovative framework for implementing a class of high-speed OQ switches with QoS guarantees. Internal speedup is implemented by memory interleaving, and O(1)-time scheduling is realized by special hardware. This shows that for high-speed networks, OQ switch with QoS guarantees is not only possible, but also feasible.","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123808732","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":"Big Data Processing in Cloud Computing Environments","authors":"Changqing Ji, Yu Li, Wenming Qiu, Uchechukwu Awada, Keqiu Li","doi":"10.1109/I-SPAN.2012.9","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.9","url":null,"abstract":"With the rapid growth of emerging applications like social network analysis, semantic Web analysis and bioinformatics network analysis, a variety of data to be processed continues to witness a quick increase. Effective management and analysis of large-scale data poses an interesting but critical challenge. Recently, big data has attracted a lot of attention from academia, industry as well as government. This paper introduces several big data processing technics from system and application aspects. First, from the view of cloud data management and big data processing mechanisms, we present the key issues of big data processing, including cloud computing platform, cloud architecture, cloud database and data storage scheme. Following the Map Reduce parallel processing framework, we then introduce Map Reduce optimization strategies and applications reported in the literature. Finally, we discuss the open issues and challenges, and deeply explore the research directions in the future on big data processing in cloud computing environments.","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121190429","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":"Rethinking Context for Pervasive Computing: Adaptive Shared Perspectives","authors":"C. Julien, A. Petz, E. Grim","doi":"10.1109/I-SPAN.2012.7","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.7","url":null,"abstract":"Mobile and pervasive computing applications depend on environmental awareness, not just of their own local system and immediate surroundings, but increasingly of the network as a whole. Traditional models of context do not sufficiently account for the trade-off between accuracy, availability, and efficiency when considering the mechanisms by which context can be gathered and shared in mobile, ad-hoc networks. Traditional approaches to context remain egocentric, but next generation environments demand coordination among entities and access to shared context resources, and thus context must be treated as a combination of local and shared information. We motivate our perspective on the future of context in mobile pervasive environments staring with historical framing of the problem, and present our recent efforts in adaptive shared context perspectives.","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130226876","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":"Attainability of the Chromatic Number of Functigraphs","authors":"W. Gu, G. Qi, Shenghao Wang","doi":"10.1109/I-SPAN.2012.27","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.27","url":null,"abstract":"Let G' be a copy of a graph G and let f : V (G) → V(G') be a function. A functigraph, denoted by C(G, f), is a graph with V (C(G, f )) = V(G) U V(G') and E(C(G, f )) = E(G) U E(G') U {uv : u ϵ V (G), v ϵ V (G'), v= f (u)}. Let χ(G) be the chromatic number of a graph. Recently, Chen et al. proved that χ(G) ≤ χ(C(G, f)) ≤ [3/2χ(G)]. In this paper we investigate the attainability of the chromatic numbers of functigraphs. We prove that for any two positive integers a and b with a ≤ b ≤ [3/2 a], there exists a graph G and function f on V (G) such that χ(G) = a and χ(C(G, f)) = b. We also characterize functions to determine the values of χ(C(G, f)) for all bipartite graphs and odd wheels. We finally provide some sufficient conditions on f to have χ(C(G, f)) = χ(G).","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131322193","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":"Bandwidth Aggregating over VANET Using the On-Demand Member-Centric Routing Protocol (OMR)","authors":"Chung-Ming Huang, Tzu-Hua Lin, Kuan-Chang Tseng","doi":"10.1109/I-SPAN.2012.20","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.20","url":null,"abstract":"In this paper, we proposed a novel routing protocol called On-Demand Member-Centric Routing (OMR) over a VANET that consists of a platoon of vehicles driving in the highway environment. The goal of OMR is to aggregate 3G/3.5G bandwidth from some vehicles called Helpers to a vehicle called Requester, i.e., it belongs to multiple-source to single-destination transmission, to have cooperative video streaming service in the platoon of vehicles. For providing a better collaborate video streaming service in the platoon scenario, we considered two points in OMR. One is that each vehicle can get a more stable link between vehicles through a cost function, the other one is that the vehicle (destination) can find a set of paths using a proposed algorithm for calculating and selecting maximum node-disjoint paths to aggregate 3G/3.5G bandwidth from Helpers to Requester. According to the simulation results, OMR effectively improves the packet delivery ratio and throughput compared with using others. It also shows that the proposed member-centric routing protocol is more suitable for 3G/3.5G bandwidth aggregation in the platoon scenario over VANET.","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123901835","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":"Computing Capacity and Connectivity in Cognitive Radio Ad-Hoc Networks","authors":"Qiang-Sheng Hua, Haisheng Tan, Yuexuan Wang, Hongxing Li, Dongxiao Yu, F. Lau, Chuan Wu","doi":"10.1109/I-SPAN.2012.8","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.8","url":null,"abstract":"We present some unique challenges in cognitive radio ad-hoc networks (CRAHNs) that are not present in conventional single-channel or multi-channel wireless ad-hoc networks. We first briefly survey these challenges and their potential impact on the design of efficient algorithms for several fundamental problems in CRAHNs. Then, we describe our recent contributions to the capacity maximization problem [29] and the connectivity problem [32]. The capacity maximization problem is to maximize the overall throughput utility among multiple unicast sessions; the connectivity problem is to find a connected subgraph from the given cognitive radio network where each secondary node is equipped with multiple radios. By assuming the physical interference model and asynchronous communications, we reformulate the above two problems where the capacity maximization problem is to find the maximum number of simultaneously transmitting links in secondary networks, and the connectivity problem is to construct a spanning tree over secondary networks using the fewest timeslots. We discuss the challenging issues for designing distributed approximation algorithms and give a preliminary framework for solving these two problems.","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133093185","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":"Extremal Functions on Cayley Digraphs of Finite Cyclic Groups","authors":"J. Blocher, S. M. Hampton, C. E. Linden","doi":"10.1109/I-SPAN.2012.14","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.14","url":null,"abstract":"For positive integers d and k we define m(d, k) to be the maximum positive integer m such that the Cayley digraph of the finite cyclic group of order m, generated by a set of k positive integers has diameter less than or equal to d. In this paper we establish a new lower bound for m(2, k). We also use this lower bound to obtain a lower bound for m(d, k) for any given positive integer d and sufficiently large k.","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129944348","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":"Generalizing Fourier Calculus on Evolutionary Trees to Splits Networks","authors":"C. D. McBee","doi":"10.1109/I-SPAN.2012.28","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.28","url":null,"abstract":"Biologists have been interested in Phylogenetics, the study of evolutionary relatedness among various groups of organisms, for more than 140 years. In spite of this, it has only been in the last 40 years that advances in technology and the availability of DNA sequences have led to statistical, computational and algorithmic work on determining evolutionary relatedness between organisms. One method of determining historical relationships between organisms is to assume a group based evolutionary model and use a discrete Fourier transform. The 1993 paper \"Fourier Calculus on Evolutionary Trees\" by L.A. Szekely, M.A. Steel and P.L. Erdos outlines this process. The transform presented in Szekely et al provides an invertible relationship between phylogenetic trees and expected frequencies of nucleotide patterns in nucleotide sequences. This implies that given a set of nucleotide sequences from various organisms it is possible to construct a phylogenetic tree that represents the historical relationships of those organisms. Some scenarios are poorly described by phylogenetic trees and there are biological and statistical reasons for using networks to model phylogenetic relationships. Given this motivation I have generalized Szekely et al's result to apply to a specific type of phylogenetic network known as a splits network.","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130748611","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":"StopWatcher: A Stop Sign Awareness Mobile Application for Driving Safety","authors":"C. Tucker, R. Tucker, Jun Zheng","doi":"10.1109/I-SPAN.2012.24","DOIUrl":"https://doi.org/10.1109/I-SPAN.2012.24","url":null,"abstract":"Stop signs are a part of everyday traffic for drivers around the world. However, due to their smaller size, lack of lighting and the fact that they can become visually obscured from the road, stop signs have a tendency to be much less effective than traffic lights. To solve this problem, we developed an Android application: Stop Watcher, which is designed to alert a driver when they are approaching a stop sign using a Voice Notification System (VNS). We conducted a field test in a snowy environment. The test results demonstrate that the application can correctly detect all stop signs, even when some of them were obstructed by the snow.","PeriodicalId":215120,"journal":{"name":"2012 12th International Symposium on Pervasive Systems, Algorithms and Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126161891","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}