Thrifty execution of task pipelines
- 19 Downloads
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.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.
- 1.Aho, A., Ullman, J.: Principles of Compiler Design. Reading, MA: Addison Wesley 1977Google Scholar
- 2.Conway, R., Maxwell, W., Morgan, H.: Selective Security Capabilities in ASAP — A File Management System. AFIPS Conf. Proc. 40, 1181–1185 (1972)Google Scholar
- 3.Simultaneous Reporting System. SRS 360 Reference Manual. Chilton Computer Company 1973Google Scholar
- 4.Knuth, D.: The An of Computer Programming, Volume 1: Fundamental Algorithms, pp. 194–196. Reading, MA: Addison Wesley 1968Google Scholar
- 5.Krass, P., Wiener, H.: The DBMS Market is Booming. Datamation 27, 153–170 (1981)Google Scholar
- 6.NATURAL Reference Manual. ADABAS Systems, Software AG of North AmericaGoogle Scholar
- 7.Ritchie, D., Thompson, K.: The UNIX Time-Sharing System. Bell Syst Tech. J. 57, 1905–1929 (1978)Google Scholar