Optimizing distributed data bases: a framework for research

  • Authors:
  • K. Dan Levin;Howard Lee Morgan

  • Affiliations:
  • The Wharton School, Philadelphia, Pennsylvania;The Wharton School, Philadelphia, Pennsylvania

  • Venue:
  • AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
  • Year:
  • 1975

Quantified Score

Hi-index 0.00

Visualization

Abstract

The interaction between computers and communication technology has steadily developed in recent years bringing with it the creation of large computer communication complexes. Earlier computer communication systems were generally focused around a single large computer installation. Although a strong argument can still be made for serving distributed users with a centralized system, we now witness an increasing number of systems in which information processing and storage functions are distributed among several computers. The idea is to distribute the resources (programs, data, computing hardware, etc.) of each computer site to a widely spread community of users. Various factors may favor a shift toward computer networks, especially with similarly structured organizations which are independent but can be motivated to share. The most well-known example is the network developed under the sponsorship of the Advanced Research Project Agency (ARPA), that links independent research organizations, all involved in solving closely related problems. The libraries of specialized software and data at each research center, make it attractive to link the computers of these organizations. Clearly, access to specialized data bases is a major feature of the networks and the cost incurred by such an access is an important consideration in determining the economic viability of this kind of resource sharing.