Leveraging computation sharing and parallel processing in location-dependent query processing

Cazalas, Jonathan; Guha, Ratan
July 2012
Journal of Supercomputing;Jul2012, Vol. 61 Issue 1, p215
Academic Journal
A variety of research exists for the processing of continuous queries in large, mobile environments. Each method tries, in its own way, to address the computational bottleneck of constantly processing so many queries. In this paper, we introduce an efficient and scalable system for monitoring continuous queries by leveraging the parallel processing capability of the Graphics Processing Unit. We examine a naive CPU-based solution for continuous range-monitoring queries, and we then extend this system using the GPU. Additionally, with mobile communication devices becoming commodity, location-based services will become ubiquitous. To cope with the very high intensity of location-based queries, we propose a view oriented approach of the location database, thereby reducing computation costs by exploiting computation sharing amongst queries requiring the same view. Our studies show that by exploiting the parallel processing power of the GPU, we are able to significantly scale the number of mobile objects, while maintaining an acceptable level of performance.


Related Articles

  • A Multi-Level WEB Based Parallel Processing System A Hierarchical Volunteer Computing Approach. Mohamed Osman, Abdelrahman Ahmed // Enformatika;2006, Vol. 13, p66 

    Over the past few years, a number of efforts have been exerted to build parallel processing systems that utilize the idle power of LAN's and PC's available in many homes and corporations. The main advantage of these approaches is that they provide cheap parallel processing environments for those...

  • Non-Strict Execution in Parallel and Distributed Computing. Cristobal-Salas, Alfredo; Tchernykh, Andrei; Gaudiot, Jean-Luc; Lin, Wen-Yen // International Journal of Parallel Programming;Apr2003, Vol. 31 Issue 2, p77 

    This paper surveys and demonstrates the power of non-strict evaluation in applications executed on distributed architectures. We present the design, implementation, and experimental evaluation of single assignment, incomplete data structures in a distributed memory architecture and Abstract...

  • A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays. Emoto, Kento; Hu, Zhenjiang; Kakehi, Kazuhiko; Takeichi, Masato // International Journal of Parallel Programming;Dec2007, Vol. 35 Issue 6, p615 

    Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, but development of efficient parallel programs on two-dimensional arrays is known to be hard. In this paper, we...

  • Efficient parallel processing with spin-wave nanoarchitectures. Eshaghian-Wilner, Mary; Navab, Shiva // Journal of Supercomputing;Aug2009, Vol. 49 Issue 2, p248 

    In this paper, we study the algorithm design aspects of three newly developed spin-wave architectures. The architectures are capable of simultaneously transmitting multiple signals using different frequencies, and allow for concurrent read/write operations. Using such features, we show a number...

  • Parallel processing of multicomponent seismic data. Falfushinsky, V. V. // Cybernetics & Systems Analysis;Mar2011, Vol. 47 Issue 2, p330 

    n algorithm for processing multicomponent seismic data is proposed. It is implemented in and its performance is measured on the Inparcom cluster. Several improvements are applied to speed up the program and to reduce the filesystem load, in particular, local folders are used to store temporary...

  • AN IMPLEMENTATION OF A PARALLEL ITERATIVE ALGORITHM FOR THE SOLUTION OF LARGE BANDED SYSTEM ON A CLUSTER OF WORKSTATIONS. Al-Towaiq, M.; Masoud, F. A. M.; Mnaouer, A. B.; Day, K. // International Journal of Modelling & Simulation;2008, Vol. 28 Issue 4, p378 

    In this paper, we present a parallel iterative solution for large banded systems of linear equations based on incomplete LU-factorization (ILU). A master--workers parallel computing scheme is used. The proposed algorithm incurs reduced storage and communication overhead as compared to previous...

  • Performance Prediction and Evaluation of Parallels Processing on a NUMA Multiprocessor. Xiaodong Zhang; Xiaohan Qin // IEEE Transactions on Software Engineering;Oct91, Vol. 17 Issue 10, p1059 

    Non-Uniform Memory Access (NUMA) architectures make it possible to build large-scale, shared-memory multiprocessor systems, in comparison with nonscalable Uniform Memory Access (UMA) architectures. Most NUMA multiprocessor operations such as scheduling and synchronizing processes, accessing data...

  • PARALLEL PROCESSING.  // Design News;3/12/90, Vol. 46 Issue 5, p77 

    The article reports on developments regarding companies that are applying parallel processing techniques in the U.S. Thinking Machines Inc. is among several companies that are applying parallel processing techniques to data-intensive computing applications. MasPar Computer Corp. is another...

  • Massively Parallel Processing.  // Network Dictionary;2007, p301 

    A definition of the term "Massively Parallel Processing" (MPP) is presented. It refers to a type of computing that uses many separate central processing units (CPU) running in parallel to execute a single program. The different kinds of parallel computers depend on how the processors are...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics