Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A general packing algorithm for multidimensional resource requirements

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

Many problems in resource allocations, memory allocation, and distributed computer system design can be formulated as problems of packing variablesized items into fixed-sized containers in order to minimize the total number of containers used. In this paper, a generalized packing algorithm that encompasses many well-known heuristic packing algorithms is proposed. Simulation results on this generalized packing algorithm are described, and their implications are discussed. The objective of this paper is to investigate the performance of various heuristic packing algorithms within a general framework, to obtain numerical estimates on their efficiency, and to provide guidelines on the use of these algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. R. Brown,Optimum Packing and Depletion (MacDonald, London, and American Elsevier, New York, 1971).

    Google Scholar 

  2. S. K. Chang and D. T. Tang, “Processor Allocation in a Distributed Computer System,”Proceedings of the IEEE /NBS Symposium on Computer Communications: Trends and Applications (1975).

  3. 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 the Theory of Computing (1972).

  4. D. S. Johnson, “Fast allocation algorithms,”Thirteenth Annual IEEE Symposium on Switching and Automata Theory (1973), pp. 144–154.

  5. D. S. Johnson, “Near-Optimal Bin Packing Algorithms,” Ph.D. Thesis, MIT, Cambridge, Mass. (June 1973).

    Google Scholar 

  6. L. T. Kou and G. Markowsky, “Multi-dimensional Bin Packing Algorithms,” RC 5391, IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y. (June 1975).

    Google Scholar 

  7. K. Maruyama, S. K. Chang, and D. T. Tang,“An Experimental Study on a Generalized Packing Algorithm,” RC 5412, IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y. (May 1975).

    Google Scholar 

  8. J. D. Ullman, “The Performance of a Memory Allocation Algorithm,” Technical Report No. 100, Princeton University, Princeton, N.J., 1971.

    Google Scholar 

  9. A. Yao, “Bin Packing Problem,” presented at IBM Research Center, Yorktown Heights, N.Y. (November 1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Thomas J. Watson Research Center, Yorktown Heights, New York

    K. Maruyama & D. T. Tang

  2. University of Illinois at Chicago Circle, Chicago, Illinois

    S. K. Chang

Authors
  1. K. Maruyama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. K. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. T. Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maruyama, K., Chang, S.K. & Tang, D.T. A general packing algorithm for multidimensional resource requirements. International Journal of Computer and Information Sciences 6, 131–149 (1977). https://doi.org/10.1007/BF00999302

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00999302

Key words

Search

Navigation