Jump to content

Talk:Parallel RAM

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Dijxtra (talk | contribs) at 17:59, 27 June 2006 (reply). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

a PRAM is not MIMD

QUOTING FROM: Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "parallel random-access machine", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 27 February 2004. (accessed 6/4/06) Available from: http://www.nist.gov/dads/HTML/parallelRandomAccessMachine.html:

parallel random-access machine (definition)

Definition: A shared memory model of computation, where typically the processors all execute the same instruction synchronously, and access to any memory location occurs in unit time.

Also known as PRAM.

See also work-depth model, multiprocessor model.

PLEASE OBSERVE: that the definition clearly indicates use of the SIMD machine and ***not*** an MIMD machine as this Wiki entry states. Vonkje 16:10, 3 June 2006 (UTC)[reply]

The definition you prodivded is wrong. If that definition was true, PRAMs would be virtualy useless for examination of any serious (i.e. the one which has conditional statement in it) paralel algorithm. And PRAMs are used for examination of those. --Dijxtra 17:59, 27 June 2006 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Parallel_RAM&oldid=60873892"