Loading...

Dynamic routing of data stream tuples among parallel query plan running on multi-core processors

Safaei, A. A ; Sharif University of Technology | 2012

457 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s10619-012-7090-6
  3. Publisher: 2012
  4. Abstract:
  5. In this paper, a method for fast processing of data stream tuples in parallel execution of continuous queries over a multiprocessing environment is proposed. A copy of the query plan is assigned to each of processing units in the multiprocessing environment. Dynamic and continuous routing of input data stream tuples among the graph constructed by these copies (called the QueryMega Graph) for each input tuple determines that, after getting processed by each processing unit (e.g., processor), to which next processor it should be forwarded. Selection of the proper next processor is performed such that the destination processor imposes the minimum tuple latency to the corresponding tuple, among all of the alternative processors. The tuple latency is derived from processing, buffering and communication time delay which varies in different practical parallel systems. Parallel system architectures that would be suitable as the desired multiprocessing environment for employing the proposed Dynamic Tuple Routing (DTR) method are considered and analyzed. Also, practical challenges and issues for the proper parallel underlying system are discussed. Implementation of the desired parallel system on multi-core systems is provided and used for evaluating the proposed DTR method. Evaluation results show that the proposed DTR method outperforms similar method such as the Eddies in terms of tuple latency, throughput and tuple loss
  6. Keywords:
  7. Data stream ; Multi-core systems ; Multistage interconnection network ; Parallel processing ; Query plan ; Data communication systems ; Image coding ; Microprocessor chips ; Parallel processing systems
  8. Source: Distributed and Parallel Databases ; Volume 30, Issue 2 , April , 2012 , Pages 145-176 ; 09268782 (ISSN)
  9. URL: http://link.springer.com/article/10.1007%2Fs10619-012-7090-6