Simulating PRAM with a MSIMD model (ASC)

Author

Ulm, Darrell ; Baker, Johnnie W.

Author_Institution

Dept. of Math. & Comput. Sci., Akron Univ., OH, USA

fYear

1998

fDate

10-14 Aug 1998

Firstpage

3

Lastpage

10

Abstract

The ASC (MSIMD) model for parallel computation supports a generalized version of an associative style of computing that has been used since the introduction of associative SIMD computers in the early 1970´s. In particular, this model supports data parallelism, constant time maximum and minimum operations, one or more instruction streams (ISs) which are sent to a unique set in a dynamic partition of the processors, and assignment of tasks to the ISs using control parallelism. ASC also allows a network to interconnect the processing elements (PEs). This paper shows how ASC can simulate synchronous PRAM, and the converse. These results provide an important step in defining the power of associative model in terms of PRAM which is the most studied parallel model. Also, these simulations will provide numerous algorithms for ASC by giving an automatic method of converting algorithms from PRAM to ASC

Keywords

associative processing; computational complexity; digital simulation; parallel algorithms; ASC; MSIMD model; PRAM simulation; associative SIMD computers; control parallelism; converting algorithms; data parallelism; instruction streams; parallel computation; processing elements; Application software; Computational modeling; Computer science; Concurrent computing; Ear; Inference algorithms; Parallel processing; Parallel programming; Partitioning algorithms; Phase change random access memory;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing, 1998. Proceedings. 1998 International Conference on

Conference_Location

Minneapolis, MN

ISSN

0190-3918

Print_ISBN

0-8186-8650-2

Type

conf

DOI

10.1109/ICPP.1998.708456

Filename

708456