Skip to main content

How Deep Should It Be? On the Optimality of Hierarchical Architectures

  • Conference paper
Next Generation Information Technologies and Systems (NGITS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4032))

  • 474 Accesses

Abstract

Many areas of information technology implement hierarchical architectures. Notable examples are the organization of computer files in folders, the arrangement of program menus, and the distribution of messages from a source to its clients. In each case, one must address the issue of the optimal configuration of the hierarchy: Assuming a given number of items, how to choose optimally the number of levels in the hierarchy (and thus the number of items at each level). Without loss of generality, we formalize this problem in the domain of assembly or manufacturing. We consider the process of manufacturing a product from a given number of elementary components. By assembling intermediate products, the target product can be manufactured in a variety of processes, each modeled by a tree. We are interested in manufacturing turnaround: the time between receiving an order at the root and its completion. We express the turnaround time of each manufacturing process (tree) with a formula that incorporates three parameters: the time required to create elementary components, the time required to assemble a product from its components and the time required to deliver the product to its procurer (another manufacturer). We show that this turnaround formula is optimized in a manufacturing process that corresponds to a perfect (or nearly perfect) tree. Somewhat surprisingly, the degree of the optimal tree (i.e., the ideal number of components in each sub-assembly) is shown to be independent of the number of elementary components, suggesting that in each manufacturing environment there is an ideal assembly size, which is optimal for the manufacturing of products of any scale.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
eBook
USD 39.99
Price excludes VAT (USA)
Softcover Book
USD 54.99
Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Gulick, L.: Notes on the theory of organization. In: Gulick, L., Urwich, L. (eds.) Papers on the Science of Administration, pp. 191–195. Institute of Public Administration, Columbia University, New york (1937)

    Google Scholar 

  2. Schneiderman, B.: Designing the User Interface: Strategies for Effective Computer Interaction. Addison-Wesley, Reading (1992)

    Google Scholar 

  3. Simon, H.A.: The organization of complex systems. In: Pattee, H.H. (ed.) Hierarchy Theory. George Braziller, New York (1973)

    Google Scholar 

  4. West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (2001)

    Google Scholar 

  5. Woodward, J.: Industrial Organization: Theory and Practice. Oxford University Press, Oxford (1965)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Motro, A., D’Atri, A., Gafni, E. (2006). How Deep Should It Be? On the Optimality of Hierarchical Architectures. In: Etzion, O., Kuflik, T., Motro, A. (eds) Next Generation Information Technologies and Systems. NGITS 2006. Lecture Notes in Computer Science, vol 4032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780991_23

Download citation

  • DOI: https://doi.org/10.1007/11780991_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35472-7

  • Online ISBN: 978-3-540-35473-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics