Matrix Inversion Using Parallel Processing
Journal of the ACM (JACM)
An Adaptation of the Fast Fourier Transform for Parallel Processing
Journal of the ACM (JACM)
Multi-processor software lockout
ACM '68 Proceedings of the 1968 23rd ACM national conference
Algorithmic measures
Computer structures: Readings and examples (McGraw-Hill computer science series)
Computer structures: Readings and examples (McGraw-Hill computer science series)
Planning a computer system: Project Stretch
Planning a computer system: Project Stretch
Detection and Parallel Execution of Independent Instructions
IEEE Transactions on Computers
Programming design features of the GAMMA 60 computer
AIEE-ACM-IRE '58 (Eastern) Papers and discussions presented at the December 3-5, 1958, eastern joint computer conference: Modern computers: objectives, designs, applications
Parallel operation in the control data 6600
AFIPS '64 (Fall, part II) Proceedings of the October 27-29, 1964, fall joint computer conference, part II: very high speed computer systems
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Validity of the single processor approach to achieving large scale computing capabilities
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Observations on high-performance machines
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
The Organization of High-Speed Memory for Parallel Block Transfer of Data
IEEE Transactions on Computers
A generalized mapping device to help memory latency
ACM SIGARCH Computer Architecture News
Toward more efficient computer organizations
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
The ultracomputer as a vehicle for polymer simulations
Parallel Computing
Methods of creating student cluster competition teams
Proceedings of the 2011 TeraGrid Conference: Extreme Digital Discovery
A distributed multilevel ant-colony algorithm for the multi-way graph partitioning
International Journal of Bio-Inspired Computation
Time dependent quantum reactive scattering on GPU
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Geospatial overlay computation on the GPU
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Classification and implementations of workflow-oriented grid portals
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Reconfigurable communication networks in a parametric SIMD parallel system on chip
ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
Inverse kinematics solution for robotic manipulators using a CUDA-Based parallel genetic algorithm
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Development process for clusters on a reconfigurable chip
Computers and Electrical Engineering
Design and implementation of 812: A declarative data-parallel language
Computer Languages
Research: Numerical analysis of some basic fluid communication models via parallel block methods
Computer Communications
Finding, expressing and managing parallelism in programs executed on clusters of workstations
Computer Communications
Quantum reactive scattering calculations on GPU
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
A transpose-free in-place SIMD optimized FFT
ACM Transactions on Architecture and Code Optimization (TACO)
Optimal multi-image processing streaming framework on parallel heterogeneous systems
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
An optimal parallel prefix-sums algorithm on the memory machine models for GPUs
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Editorial: Recent developments in high performance computing and security: An editorial
Future Generation Computer Systems
Heterogeneous multi-core systems: UML profiles vs. DSM approaches
Proceedings of the 2012 workshop on Domain-specific modeling
HFPaC: GPU friendly height field parallel compression
Geoinformatica
Efficient setup of aggregation AMG for CFD on GPUs
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
Enforcing Minimum Necessary Access in Healthcare Through Integrated Audit and Access Control
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sierra: a SIMD extension for C++
Proceedings of the 2014 Workshop on Programming models for SIMD/Vector processing
Frequency-based re-sequencing tool for short reads on graphics processing units
International Journal of Computational Science and Engineering
International Journal of Computational Science and Engineering
Heterogeneous Computing in Economics: A Simplified Approach
Computational Economics
Integrated Computer-Aided Engineering
Artificial Intelligence Review
| Hi-index | 14.98 |
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-multipledata 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.