Importance of SIMD computation reconsidered

Abstract

In this paper, SIMD and MIMD solutions for the real-time database management problem of air traffic control are compared. A real-time database system is highly constrained in a multiprocessor and access to the common database must be made to a limited number of data elements at a time. This MIMD database access is contrasted with the comparable SIMD common database access, which can be several hundred times greater. This is true because the SIMD can simultaneously access thousands of pertinent records instead of the limited number in the MIMD. A relatively simple example is given of a problem that has a polynomial time solution using a SIMD but for which a polynomial time solution using a MIMD is normally impossible. The fact that SIMD can support a polynomial time solution for the air traffic control problem but this problem is normally considered to be intractable for multiprocessors argues against the common belief that MIMD have greater power than SIMD. SIMD are more efficient and powerful for some critically important application areas.

Original document

The different versions of the original document can be found in:

• http://www.cs.kent.edu/~parallel/papers/meilander_wmpp03.pdf,

https://dblp.uni-trier.de/db/conf/ipps/ipdps2003.html#MeilanderBJ03,

https://ieeexplore.ieee.org/document/1213480,

https://academic.microsoft.com/#/detail/2169278292

• http://xplorestaging.ieee.org/ielx5/8608/27277/01213480.pdf?arnumber=1213480,

http://dx.doi.org/10.1109/ipdps.2003.1213480

• Reconsidered.pdf http://www.cs.kent.edu/~jbaker/RealTime/unprotected/papers/SIMD Reconsidered.pdf