Some Computer Organizations and Their Effectiveness

  title={Some Computer Organizations and Their Effectiveness},
  author={Michael J. Flynn},
  journal={IEEE Transactions on Computers},
  • M. J. Flynn
  • Published 1 September 1972
  • Computer Science
  • IEEE Transactions on Computers
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… 

Figures from this paper

Table 1. Properties of Interconnection schemes
  • Computer Science
  • 1986
An optimal assignment of swbps r modules, to a two-processor system has been considered by Stone in which the cost of interprocessor communication has been taken into account, in addition to the communication and other collective costs.
Analysis of a Shared Resource MIMD Computer Organization
In this paper, a MIMD structure with one shared resource is analyzed for both synchronous and asynchronous request arrivals and it appears that a similar approach can be used to extend the model to more general M IMD cases.
Operating System Structure
Characteristics of the resource structure found in the operating system as a mechanism for classifying distributed computer systems are considered, showing that computer networks are easy to develop from uniprocessors in a value-added fashion, but that true network computers are not yet available because development by extending computer network operating systems is not practical.
A Comparative Study of Some Two-Processor Organizations
A comparative performance study of four models of two-processor organizations is presented, with the aim being to compare their response times under different workloads and the possibility of switching between alternate organizations in a dynamically reconfigurable system.
Performance evaluation of some computer organisations
A simplified model has been analysed for both synchronous and asynchronous request arrivals and results indicate the possibility of selecting an optimum amount of resource replication so that the cost utilisation is optimised.
A new taxonomy for distributed computer systems based upon operating system structure
Characteristics of the resource structure found in the operating system are considered as a mechanism for classifying distributed computer systems and the character of the kernel O/S structure needed for future computer systems is defined.
Multiprocessors and other parallel systems - an introduction and overview
  • P. Enslow
  • Computer Science
    Computer Architecture
  • 1975
The evolution of hardware organization is traced from early uniprocessor systems with no parallelism through several stages of both single and multiple computer systems each providing a higher degree
Minimization of supervisor conflict for multiprocessor computer systems
A methodology is developed through simulation which reduces supervisor queueing by scheduling jobs to processors such that they request the use of the supervisor when the supervisor is predicted to be available.
DISC: dynamic instruction stream computer
The Dynamic Instruction Stream Computer is a novel computer architecture which addresses many of the problems present in real-time systems by dynamically partitioning the processor throughput between multiple instruction streams based upon requirement demands.


Very high-speed computing systems
The constituents of a system: storage, execution, and instruction handling (branching) are discussed with regard to recent developments and/or systems limitations.
Multi-processor software lockout
  • S. Madnick
  • Computer Science
    ACM National Conference
  • 1968
Present trends indicate that future general-purpose computer will be smaller and less costly, but not significantly faster.
Matrix Inversion Using Parallel Processing
It is shown that both methods of matrix inversion are indeed able to make effective use of parallel capability, and with reasonable assumptions on the parallelism that is available, the speeds of the two methods are roughly comparable.
Observations on high-performance machines
  • D. Senzig
  • Computer Science
    AFIPS '67 (Fall)
  • 1967
The high speed computer area seems to be dominated by a continued reduction in the price of computer switching circuits and the approach of these circuits to speeds at which the velocity of light becomes an important factor, so simultaneousity becomes more and more essential if computer performance is to continue to increase.
A survey of problems and preliminary results concerning parallel processing and parallel processors
Some of the results obtained to date in a project which aims to develop and evaluate a unified hardware-software parallel processing computing system and the techniques for its use are described.
An Adaptation of the Fast Fourier Transform for Parallel Processing
A modified version of the Fast Fourier Transform is developed and described and it is suggested that this form is of general use in the development and classification of various modifications and extensions of the algorithm.
Detection and Parallel Execution of Independent Instructions
For a single instruction stream–single data stream organization the problem of simultaneously issuing several instructions is studied.
Parallel operation in the control data 6600
Control Data began a project which culminated last month in the delivery of the first 6600 Computer, showing that brute force circuit performance and parallel operation were the two main approaches to any advanced computer.
Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities
An instrument for facilitating the calculation of equivalent values includes a plate bearing symbols representing units and dimensions, the plate having a window in which a movable pointer is
Computability and Unsolvability
  • Martin D. Davis
  • Computer Science
    McGraw-Hill Series in Information Processing and Computers
  • 1958
Only for you today! Discover your favourite computability and unsolvability book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the book