scispace - formally typeset
Search or ask a question

Showing papers on "Shared resource published in 1981"


Journal ArticleDOI
J. Kaufman1
TL;DR: It is shown that, for the important and commonly implemented policy of complete sharing, a simple one-dimensional recursion can be developed which eliminates all difficulty in computing quantities of interest-regardless of both the size and dimensionality of the underlying model.
Abstract: In recent years, considerable effort has focused on evaluating the blocking experienced by "customers" in contending for a commonly shared "resource." The customers and resource in question have typically been messages and storage space in message storage applications or data streams and bandwidth in data multiplexing applications. The model employed in these studies, a multidimensional generalization of the classical Erlang loss model, has been limited to exponentially distributed storage (or data transmission) times, questions concerning efficient computational schemes have largely been ignored, and the class of resource sharing policies considered has been unnecessarily restricted. The contribution of this paper is threefold. We first show that the state distribution (obtained by previous authors) is valid for the large class of residency time distributions which have rational Laplace transforms. Second, we show that, for the important and commonly implemented policy of complete sharing, a simple one-dimensional recursion can be developed which eliminates all difficulty in computing quantities of interest-regardless of both the size and dimensionality of the underlying model. Third, we show that the state distribution holds for completely arbitrary resource sharing policies.

1,029 citations


Proceedings ArticleDOI
12 May 1981
TL;DR: A new concept of designing multiprocessors, which share not only memory but also specially chosen peripheral processors and VLSI functional units, is introduced in this paper.
Abstract: A new concept of designing multiprocessors, which share not only memory but also specially chosen peripheral processors and VLSI functional units, is introduced in this paper. Queuing analysis is performed on the potential throughput of the Purdue multiprocessor system (PUMPS). Configuration design of the shared resource pool is demonstrated with a special PUMPS design for interactive image processing. The resource optimization techniques being developed can be also applied to configuration design of PUMPS for any other scientific applications.

11 citations




Journal ArticleDOI
TL;DR: Networks using Intel's Local Network Architecture promise significant benefits in resource sharing, communications multiplexing, and distributed computing.
Abstract: Networks using Intel's Local Network Architecture promise significant benefits in resource sharing, communications multiplexing, and distributed computing.

7 citations


Book ChapterDOI
TL;DR: This chapter provides an introduction to architectures in the area of local networks, the class of network-like systems that satisfy several basic properties and discusses some example systems and the future of this technology.
Abstract: Publisher Summary This chapter provides an introduction to architectures in the area of local networks. It discusses some example systems and describes the future of this technology. Essentially, local computer networks (LCNs) constitute the class of network-like systems that satisfy several basic properties. These properties are that these networks are generally owned by a single organization; that they are generally local—that is, the distances involved are on the order of a few miles; and that they contain some type of switching-element technology. In recent years, data-processing costs have declined faster than communication costs. Thus, there is a tendency, in a system design, to try and decentralize computation to provide remote processing to effectively substitute computation for communication. The effect of technology can allow building hierarchically structured networks with an LCN as the most basic system building block. LCNs are largely decentralized as the primary reason for their existence is local resource sharing.

3 citations


Journal ArticleDOI
Jin Lan1
TL;DR: A generalized concept of parallelism in computer architecture is summarized and adopted as a common thread linking different categories of multiple-computer systems.

2 citations


Journal ArticleDOI
23 Nov 1981

1 citations


Journal ArticleDOI
TL;DR: The Community File Station allows functions such as text preparation, editing, local file management and rapid text display to be performed locally without any interaction with the central computer system.
Abstract: This paper describes the design and use of the Community File Station, an intelligent terminal system, at a college with a large central computer facility. The Community File Station allows functions such as text preparation, editing, local file management and rapid text display to be performed locally without any interaction with the central computer system. It is hoped that the combination of such a terminal system with a high speed campus network will have a significant impact on the way in which the user community uses the central system. Some examples of the way in which the terminal is used is given, along with the way in which the role of the central system changes for the user of the Community File Station.

Journal ArticleDOI
01 Oct 1981
TL;DR: The file system and structure of a single-user operating system is described and is designed to run in a laboratory setting on a small microcomputer connected to a network with both private and network disk storage.
Abstract: The file system and structure of a single-user operating system is described. The system is designed to run in a laboratory setting on a small microcomputer connected to a network with both private and network disk storage.