A Model for Distributed Computer System Design

A model of a distributed computer system for transaction processing is described. The system configuration problem is formulated as a problem of deciding transaction allocation, routing, processor allocation, and line allocation to satisfy certain performance requirements and design constraints. A heuristic design procedure for hierarchical computer systems is described. Based upon this design procedure, an experimental interactive configurator for distributed computer system design is implemented in APL. Topics for further investigation are discussed.

[1]  Marvin V. Zelkowitz,et al.  KWIC Index for Computer Networks , 1973, Networks.

[2]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

[3]  K. Steiglitz,et al.  The Design of Minimum-Cost Survivable Networks , 1969 .

[4]  Leonard Kleinrock,et al.  Computer communication network design: experience with theory and practice , 1899, AFIPS '72 (Spring).

[5]  E. Hansler.  A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network , 1972 .

[6]  Ronald A. Howard,et al.  Information Value Theory , 1966, IEEE Trans. Syst. Sci. Cybern..

[7]  K. Mani Chandy,et al.  The Capacitated Minimum Spanning Tree , 1973, Networks.

[8]  L. R. Esau,et al.  On Teleprocessing System Design Part II: A Method for Approximating the Optimal Network , 1966, IBM Syst. J..

[9]  A. Manne.  Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .

[10]  Leonard Kleinrock.  Analytic and simulation methods in computer network design , 1970, AFIPS '70 (Spring).

[11]  Shi-Kuo Chang.  Parallel Balancing of Binary Search Trees , 1974, IEEE Transactions on Computers.

[12]  Jeffrey D. Ullman,et al.  Worst-case analysis of memory allocation algorithms , 1972, STOC.

[13]  R. E. Taylor,et al.  Optimal Redundancy for Reliability in Series Systems , 1969, Oper. Res..

[14]  R. Wilkov,et al.  Analysis and Design of Reliable Computer Networks , 1972, IEEE Trans. Commun..

[15]  Koichi Mizukami.  Optimum Redundancy for Maximum System Reliability by the Method of Convex and Integer Programming , 1968, Oper. Res..

[16]  R. G. Casey,et al.  Allocation of copies of a file in an information network , 1899, AFIPS '72 (Spring).

[17]  Dixon R. Doll,et al.  A database system for the management and design of telecommunication networks , 1973, DATACOMM '73.

[18]  Wesley W. Chu,et al.  Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[19]  Donald N. Streeter.  Centralization or Dispersion of Computing Facilities , 1973, IBM Syst. J..

[20]  R. H. Thomas.  On the design of a resource sharing executive for the ARPANET , 1899 .

[21]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[22]  K. Deutsch,et al.  Decentralization by Function and Location , 1973 .

[23]  A. Kershenbaum,et al.  A unified algorithm for designing multidrop teleprocessing networks , 1974, DATACOMM '73.

[24]  Aaron Kershenbaum,et al.  Recursive analysis of network reliability , 1973, Networks.

[25]  Wushow Chou,et al.  Topological optimization of computer networks , 1972 .

[26]  I. Frisch,et al.  Analysis and Design of Survivable Networks , 1970 .

[27]  M. Goldstein,et al.  The One-Terminal TELPAK Problem , 1971, Oper. Res..

[28]  John DeMercado.  Minimum cost-reliable computer communication networks , 1972, AFIPS '72 (Fall, part I).

[29]  Bernard Yaged,et al.  Minimum cost routing for static network models , 1971, Networks.

[30]  F. Proschan,et al.  On Optimal Redundancy , 1959 .

[31]  M. A. Wesley,et al.  A design for an auxiliary associative parallel processor , 1972, AFIPS '72 (Fall, part I).

[32]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[33]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[34]  Shi-Kuo Chang,et al.  The Generation of Minimal Trees with a Steiner Topology , 1972, JACM.

[35]  Wesley W. Chu.  Optimal file allocation in a multicomputer information system , 1968, IFIP Congress.

[36]  William R. Crowther,et al.  The interface message processor for the ARPA computer network , 1899, AFIPS '70 (Spring).

[37]  W. Dent.  Redundant networks and minimum distance , 1973 .

[38]  Barry D. Wessler,et al.  Computer network development to achieve resource sharing , 1899, AFIPS '70 (Spring).

[39]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[40]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[41]  Robert E. Kahn,et al.  Flow control in a resource-sharing computer network , 1972, IEEE Trans. Commun..

[42]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[43]  C. V. Ramamoorthy,et al.  Optimization of Memory Hierarchies in Multiprogrammed Systems , 1970, JACM.

[44]  B. W. Meister,et al.  New Optimization Criteria for Message-Switching Networks , 1971 .

[45]  G. K. McAuliffe,et al.  Exact calculation of computer network reliability , 1899 .

[46]  M. Schwartz,et al.  Terminal-oriented computer-communication networks , 1972 .

[47]  Dick H. Fredericksen.  Describing Data in Computer Networks , 1973, IBM Syst. J..

[48]  Robert Metcalfe,et al.  Function-oriented protocols for the ARPA computer network , 1899, AFIPS '72 (Spring).

[49]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[50]  Daniel J. Kleitman,et al.  Methods for investigating the connectivity of large graphs , 1969 .

[51]  M. Goldstein.  Design of long-distance telecommunication networks -The Telpak problem , 1973 .

[52]  Wushow Chou,et al.  Topological considerations in the design of the ARPA computer network , 1899, AFIPS '70 (Spring).

[53]  Robert E. Kahn,et al.  Resource-sharing computer communications networks , 1972 .

[54]  K. Dan Levin,et al.  Optimal program and data locations in computer networks , 1977, CACM.

[55]  S. Hakimi.  Comments on "Simultaneous Flows Through a Communication Network , 1963 .

[56]  David S. Johnson.  Approximation algorithms for combinatorial problems , 1973, STOC '73.

[57]  Shi-Kuo Chang,et al.  The Computation of Window Operations on a Parallel Organized Computer—A Case Study , 1973, IEEE Transactions on Computers.

[58]  K. Deutsch,et al.  Toward a Rational Theory of Decentralization: Some Implications of a Mathematical Approach , 1969 .

[59]  David C. Walden,et al.  A system for interprocess communication in a resource sharing computer network , 1972, CACM.

[60]  Edsger W. Dijkstra,et al.  The structure of the “THE”-multiprogramming system , 1968, CACM.

[61]  Richard M. Van Slyke,et al.  Network reliability analysis: Part I , 1971, Networks.

[62]  A. Nico Habermann,et al.  Prevention of system deadlocks , 1969, CACM.

[63]  Philip H. Enslow.  Non technical issues in network design — Economic, legal, social, and other considerations , 1973, Computer.

[64]  David S. Johnson,et al.  Fast Allocation Algorithms , 1972, SWAT.

[65]  D. J. McKee,et al.  A design model for teleprocessing systems , 1973, DATACOMM '73.

[66]  Eberhard Hänsler,et al.  Optimizing the Reliability in Centralized Computer Networks , 1972, IEEE Trans. Commun..

[67]  K. Mani Chandy,et al.  The Design or Multipoint Linkages in a Teleprocessing Tree Network , 1972, IEEE Transactions on Computers.

[68]  Chak-Kuen Wong,et al.  Parallel Generation of Binary Search Trees , 1974, IEEE Transactions on Computers.