In computer science, a parallel random-access machine (PRAM) is a shared-memory abstract machine. As its name indicates, the PRAM was intended as the parallel-computing analogy to the random-access machine (RAM). In the same way, that the RAM is used by sequential-algorithm designers to model algorithmic performance (such as time complexity), the PRAM used by parallel-algorithm designers to model parallel algorithmic performance (such as time complexity, where the number of processors assumed is typically also stated). Similar to the way in which the RAM model neglects practical issues, such as access time to cache memory versus main memory, the PRAM model neglects such issues as synchronization and communication, but provides any (problem-size-dependent) number of processors. Algorithm cost, for instance, is estimated using two parameters O(time) and O(time × processor_number).
Read more about Parallel Random-access Machine: Read/write Conflicts, Implementation, Example Code
Famous quotes containing the words parallel and/or machine:
“If from the earth we came, it was an earth
That bore us as a part of all the things
It breeds and that was lewder than it is.
Our nature is her nature. Hence it comes,
Since by our nature we grow old, earth grows
The same. We parallel the mother’s death.”
—Wallace Stevens (1879–1955)
“Goodbye, boys; I’m under arrest. I may have to go to jail. I may not see you for a long time. Keep up the fight! Don’t surrender! Pay no attention to the injunction machine at Parkersburg. The Federal judge is a scab anyhow. While you starve he plays golf. While you serve humanity, he serves injunctions for the money powers.”
—Mother Jones (1830–1930)