Journal Article10.1109/TC.1972.5009071
Some Computer Organizations and Their Effectiveness
2.1K
TL;DR: A hierarchical model of computer organizations is developed, based on a tree model using request/service type resources as nodes, which indicates that saturation develops when the fraction of task time spent locked out approaches 1/n, where n is the number of processors.
read more
Abstract: A hierarchical model of computer organizations is developed, based on a tree model using request/service type resources as nodes. Two aspects of the model are distinguished: logical and physical. General parallel- or multiple-stream organizations are examined as to type and effectiveness?especially regarding intrinsic logical difficulties. The overlapped simplex processor (SISD) is limited by data dependencies. Branching has a particularly degenerative effect. The parallel processors [single-instruction stream-multiple-data stream (SIMD)] are analyzed. In particular, a nesting type explanation is offered for Minsky's conjecture?the performance of a parallel processor increases as log M instead of M (the number of data stream processors). Multiprocessors (MIMD) are subjected to a saturation syndrome based on general communications lockout. Simplified queuing models indicate that saturation develops when the fraction of task time spent locked out (L/E) approaches 1/n, where n is the number of processors. Resources sharing in multiprocessors can be used to avoid several other classic organizational problems.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Introduction to neural networks.
TL;DR: This book is for non-commercial use, as long as it is distributed as a whole in its original form, and the names of the authors and the University of Amsterdam are mentioned.
3.3K
•Book
Readings in Distributed Artificial Intelligence
Alan H. Bond,Les Gasser +1 more
- 05 Jun 2014
TL;DR: This comprehensive collection of articles shows the breadth and depth of DAI research as well as to practical problems in artificial intelligence, distributed computing systems, and human-computer interaction.
1.1K
The Tera computer system
Robert Alverson,David Callahan,Daniel Cummings,Brian D. Koblenz,Allan Porterfield,Burton Smith +5 more
- 01 Jun 1990
TL;DR: The Tera architecture was designed with several goals in mind; it needed to be suitable for very high speed implementations, i.
A Survey on Distributed Machine Learning
Joost Verbraeken,Matthijs Wolting,Jonathan Katzy,Jeroen Kloppenburg,Tim Verbelen,Jan S. Rellermeyer +5 more
TL;DR: In this article, the authors provide an extensive overview of the current state-of-the-art in the field by outlining the challenges and opportunities of distributed machine learning over conventional (centralized) machine learning.
Metaheuristics: A bibliography
Ibrahim H. Osman,Gilbert Laporte +1 more
TL;DR: This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics that have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas.
740
References
Validity of the single processor approach to achieving large scale computing capabilities
Gene Myron Amdahl
- 18 Apr 1967
TL;DR: In this paper, the authors argue that the organization of a single computer has reached its limits and that truly significant advances can be made only by interconnection of a multiplicity of computers in such a manner as to permit cooperative solution.
4K
Very high-speed computing systems
Michael J. Flynn
- 01 Dec 1966
TL;DR: In this paper, the authors classified very high-speed computers as follows: 1) Single Instruction Stream-Single Data Stream (SISD) 2) SIMD 3) MIMD 4) MISD-MIMD.
1K
Logical basis for information theory and probability theory
TL;DR: A new logical basis for information theory as well as probability theory is proposed, based on computing complexity, according to a new approach to computing complexity.
614