VPipe: Virtual pipelining for scheduling of DAG stream query plans

2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

There are data streams all around us that can be harnessed for tremendous business and personal advantage. For an enterprise-level stream processing system such as CHAOS [1] (Continuous, Heterogeneous Analytic Over Streams), handling of complex query plans with resource constraints is challenging. While several scheduling strategies exist for stream processing, efficient scheduling of complex DAG query plans is still largely unsolved. In this paper, we propose a novel execution scheme for scheduling complex directed acyclic graph (DAG) query plans with meta-data enriched stream tuples. Our solution, called Virtual Pipelined Chain (or VPipe Chain for short), effectively extends the "Chain" pipelining scheduling approach to complex DAG query plans. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Wang, S., Gupta, C., & Mehta, A. (2010). VPipe: Virtual pipelining for scheduling of DAG stream query plans. In Lecture Notes in Business Information Processing (Vol. 41 LNBI, pp. 32–49). Springer Verlag. https://doi.org/10.1007/978-3-642-14559-9_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free