Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture

  • Håkan Lennerstad
  • Lars Lundberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1120)


Completion Time Parallel Program SIAM Journal Computer Architecture Multiprocessor System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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.CrossRefGoogle Scholar
  2. [2]
    D. K. Friesen, Tighter bounds for the multifit processor scheduling algorithm, SIAM Journal of Computing, 13 (1984), pp. 170–181.CrossRefGoogle Scholar
  3. [3]
    M. Garey and D. Johnson, Computers and Intractability, W.H. Freeman and Company, 1979.Google Scholar
  4. [4]
    R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal of Applied Mathematics, Vol. 17, No. 2, March 1969, pp. 416–429.CrossRefGoogle Scholar
  5. [5]
    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.CrossRefGoogle Scholar
  6. [6]
    M. A. Langstone, Processor scheduling with improved heuristic algorithms, Ph.D. thesis Texas University, Collage Station Texas, 1981.Google Scholar
  7. [7]
    H. Lennerstad and L. Lundberg, An Optimal Execution Time Estimate for Static versus Dynamic Allocation in Multiprocessor Systems, SIAM Journal of Computing, August 1995.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    H. Lennerstad and L. Lundberg, Optimal scheduling results for parallel computing, SIAM News, Vol. 27, No. 7, 1994 (survey article).Google Scholar
  10. [10]
    H. Lennerstad and L. Lundberg, Optimal Worst Case Formulas Comparing Cache Memory Associativity, Research Report 5/95, University of Karlskrona/Ronneby, Sweden, 1995.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    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.Google Scholar
  13. [13]
    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.Google Scholar
  14. [14]
    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.Google Scholar
  15. [15]
    A. Silberschatz, J. Peterson and P. Galvin, Operating System Concepts (third edition), Addison-Wesley Publishing Company, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Håkan Lennerstad
    • 1
  • Lars Lundberg
    • 1
  1. 1.University of Karlskrona/RonnebySweden

Personalised recommendations