What have we learnt from using real parallel machines to solve real problems?
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
A bridging model for parallel computation
Communications of the ACM
Architecture of a massively parallel processor
25 years of the international symposia on Computer architecture (selected papers)
Associative Computing: A Programming Paradigm for Massively Parallel Computers
Associative Computing: A Programming Paradigm for Massively Parallel Computers
Associative Processing and Processors
Associative Processing and Processors
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Simulating PRAM with a MSIMD model (ASC)
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
The Power of SIMDs in Real-Time Scheduling
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Timing for Associative Operations on the MASC Model
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Multiple Instruction Stream Control for an Associative Model of Parallel Computation
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Importance of SIMD Computation Reconsidered
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Evaluating the power of the parallel masc model using simulations and real-time applications
Evaluating the power of the parallel masc model using simulations and real-time applications
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
ASC (Associative Computing Model) and MASC (Multiple Associative Computing Model) have long been studied in the Department of Computer Science at Kent State University While the previous studies provide the background and the basic definition of the model, the description of the interactions between the instruction streams (ISs) is very brief, high level, and incomplete. One change here is that we specify the interaction between ISs and consider that all of the ISs operate on the same clock in order to support predictable worst case computation times, while earlier the ISs were assumed to interact in a MIMD type fashion. This paper provides a detailed explanation as to how these interactions can be supported in the case where only a few ISs are supported.