Pipelining in multi-query optimization
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rate-based query optimization for streaming information sources
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
Chain: operator scheduling for memory minimization in data stream systems
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
STREAM: the stanford stream data manager (demonstration description)
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Aurora: a data stream management system
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Kepler: An Extensible System for Design and Execution of Scientific Workflows
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Adaptive ordering of pipelined stream filters
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Parallel SQL execution in Oracle 10g
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Adaptive Caching for Continuous Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Optimizing ETL Processes in Data Warehouses
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
ETL queues for active data warehousing
Proceedings of the 2nd international workshop on Information quality in information systems
Revisiting pipelined parallelism in multi-join query processing
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A taxonomy of scientific workflow systems for grid computing
ACM SIGMOD Record
A generic and customizable framework for the design of ETL scenarios
Information Systems - Special issue: The 15th international conference on advanced information systems engineering (CAiSE 2003)
Quality Driven Web Services Selection
ICEBE '05 Proceedings of the IEEE International Conference on e-Business Engineering
The CQL continuous query language: semantic foundations and query execution
The VLDB Journal — The International Journal on Very Large Data Bases
Declarative support for sensor data cleaning
PERVASIVE'06 Proceedings of the 4th international conference on Pervasive Computing
Cost-Based Vectorization of Instance-Based Integration Processes
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Cost-based vectorization of instance-based integration processes
Information Systems
| Hi-index | 0.00 |
Two processes, p and q, may be scheduled in pipeline when q may start when p starts, and q may process data items from p, one-by-one, without waiting for p to write the complete set of data items. This paper explores how process pipeline scheduling may become a viable strategy for executing workflows. The paper first details a workflow model that captures the characteristics of the application programs that pipeline scheduling requires. It proceeds by showing that the process pipeline scheduling problem is NP-Complete. Then, it describes a specific algorithm that pipelines as many processes as possible, within the bounds of the storage space available, based on a greedy process scheduling heuristics that has acceptable performance. Finally, the paper presents a detailed example that illustrates how the algorithm schedules processes.