DocumentCode :
1668607
Title :
Importance of SIMD computation reconsidered
Author :
Meilander, Will C. ; Baker, Johnnie W. ; Jin, Mingxian
Author_Institution :
Dept. of Comput. Sci., Kent State Univ., OH, USA
fYear :
2003
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.
Keywords :
aerospace computing; air traffic control; database management systems; parallel processing; parallel programming; real-time systems; MIMD; SIMD computation; air traffic control; database access; multiprocessor; polynomial time solution; real-time database management; Air traffic control; Broadcasting; Computer science; Concurrent computing; Databases; Dynamic scheduling; Optimal scheduling; Polynomials; Real time systems; Scheduling algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing Symposium, 2003. Proceedings. International
ISSN :
1530-2075
Print_ISBN :
0-7695-1926-1
Type :
conf
DOI :
10.1109/IPDPS.2003.1213480
Filename :
1213480
Link To Document :
بازگشت