The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
A bridging model for parallel computation
Communications of the ACM
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
In search of clusters (2nd ed.)
In search of clusters (2nd ed.)
Associative Computing: A Programming Paradigm for Massively Parallel Computers
Associative Computing: A Programming Paradigm for Massively Parallel Computers
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Predictability for Real-Time Command and Control
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Timing for Associative Operations on the MASC Model
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
STARAN parallel processor system hardware
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15
| Hi-index | 0.00 |
SIMDs and MIMDs are the most important categories of computer systems for parallel computing in Flynn's classification scheme. Due to their higher flexibility in allowing processors to execute independently and their ability to use off-the-shelf microprocessors, the MIMD systems are generally favored and considered to be more powerful. In comparison, the SIMD systems are considered outdated. However, we observe that many intrinsic weaknesses of the MIMD systems are not fully recognized until they are compared while solving realtime scheduling problems. The SIMD systems have inherent advantages that MIMDs lack. In this paper, we compare SIMDs and MIMDs in real-time scheduling, e.g., scheduling for air traffic control. Two abstract parallel computation models, the ASC and BSP models that represent SIMDs and MIMDs respectively, are used in our discussion and analysis. We argue that the common belief that MIMDs have greater power than SIMDs is false. Our research shows that SIMDs are not outdated, as they offer tractable solutions for problems considered intractable with MIMDs. Rather, SIMDs are more efficient and powerful in some important application fields. They deserve more attention and considerations than they currently receive.