This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. G. Coffman Jr., M. R. Garey and D. S. Johnson, An Application of Bin Packing to Multiprocessor Scheduling, SIAM Journal of Computing, Vol. 7, No. 1, February 1978, pp. 1–17.
D. K. Friesen, Tighter bounds for the multifit processor scheduling algorithm, SIAM Journal of Computing, 13 (1984), pp. 170–181.
M. Garey and D. Johnson, Computers and Intractability, W.H. Freeman and Company, 1979.
R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal of Applied Mathematics, Vol. 17, No. 2, March 1969, pp. 416–429.
D. S. Hochbaum and D. B. Shmoys, Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results, Journal of the ACM, Vol. 34, No. 1, January 1987, pp. 144–162.
M. A. Langstone, Processor scheduling with improved heuristic algorithms, Ph.D. thesis Texas University, Collage Station Texas, 1981.
H. Lennerstad and L. Lundberg, An Optimal Execution Time Estimate for Static versus Dynamic Allocation in Multiprocessor Systems, SIAM Journal of Computing, August 1995.
H. Lennerstad and L. Lundberg, Optimal Performance Functions Comparing Process Allocation Strategies in Multiprocessor Systems, Research Report 3/93. University of Karlskrona/Ronneby, Sweden, 1993.
H. Lennerstad and L. Lundberg, Optimal scheduling results for parallel computing, SIAM News, Vol. 27, No. 7, 1994 (survey article).
H. Lennerstad and L. Lundberg, Optimal Worst Case Formulas Comparing Cache Memory Associativity, Research Report 5/95, University of Karlskrona/Ronneby, Sweden, 1995.
L. Lundberg and H. Lennerstad, An Optimal Upper Bound on the Minimal Completion Time in Distributed Supercomputing, in Proceedings of the 8th ACM Conference on Supercomputing, Manchester, England, July 1994.
L. Lundberg and H. Lennerstad, An Optimal Lower Bound on the Maximum Speedup in Multiprocessors with Clusters, in Proceedings of the First International Conference on Algorithms and Architectures for parallel Processing, Brisbane, Australia, April 1995.
L. Lundberg and H. Lennerstad, An optimal bound on the gain of using one large processor cluster instead of a number of small clusters, in Proceedings of the 8th International Conference on Parallel and Distributed Computing Systems, Orlando, Florida, September 1995.
L. Lundberg and H. Lennerstad, Bounding the Maximum Gain of Changing the Number of Modules in Multiprocessor Computers, Technical Report May 1994 Department of Comp. Engineering, Lund University, Sweden.
A. Silberschatz, J. Peterson and P. Galvin, Operating System Concepts (third edition), Addison-Wesley Publishing Company, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lennerstad, H., Lundberg, L. (1996). Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_94
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_94
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61576-7
Online ISBN: 978-3-540-70627-4
eBook Packages: Springer Book Archive