Thrifty execution of task pipelines

DOI10.1007/BF00290144MaRDI QIDQ1057645zbMATH OpenOpenAlexFDO

Authors Fred B. Schneider, Richard Conway, Dale Skeen

Publication date 1985

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00290144

zbMATH Keywords

Buffer requirementsfile processingloop jammingsequence of taskssequential databasetask schedulesthrifty scheduling policiesUNIX pipelines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Information storage and retrieval of data (68P20)

Review text

A sequence of tasks that must be performed on a sequential database can be scheduled in various ways. Schedules will differ with respect to the number of accesses made to peripheral storage devices and the amount of memory space consumed by buffers. Buffer requirements are discussed for task schedules that avoid accesses to peripherals storing the sequential database. The relationship between certain thrifty scheduling policies and loop jamming, a standard code optimization technique, is also identified. Application to UNIX pipelines and to file processing is discussed.

Recommendations

• Pipelining in multi-query optimization.
• Scheduling Multipipeline and Multiprocessor Computers
• Pipelined operator tree scheduling in heterogeneous environments.
• scientific article; zbMATH DE number 1286104
• On resource scheduling of multi-join queries in parallel database systems

Cited in

(1)

• scientific article; zbMATH DE number 1844545 (Why is no real title available?)

Describes a project that uses

Uses Software

• ADABAS

This page was built for publication: Thrifty execution of task pipelines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057645)