Preview
Unable to display preview. Download preview PDF.
References
S.H. Fuller, "An optimal drum scheduling algorithm," IEEE Trans. on Computers, vol. C-21, no. 11, Nov. 1972, pp. 1153–1165.
A. Gill, "The optimal organization of serial memory transfers," IRE Trans. Electron. Comput., vol. EC-9, Mar. 1960, pp. 12–15.
R.L. Graham, "Bounds for Certain Multiprocessing Anomalies," Bell Sys. Tech. Jour. 45, no. 9 (1966) pp. 1563–1581.
M.R. Garey, R.L. Graham and J.D. Ullman, "Worst-case analysis of memory allocation algorithms," Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, Denver, Colorado, May 1972, pp. 143–150.
Rights and permissions
Copyright information
© 1973 Springer-Verlag
About this paper
Cite this paper
Wong, C.K., Liu, C.L., Apter, J. (1973). A drum scheduling algorithm. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039164
Download citation
DOI: https://doi.org/10.1007/BFb0039164
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06527-2
Online ISBN: 978-3-540-37826-6
eBook Packages: Springer Book Archive