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:
“There is a parallel between the twos and the tens. Tens are trying to test their abilities again, sizing up and experimenting to discover how to fit in. They don’t mean everything they do and say. They are just testing. . . . Take a good deal of your daughter’s behavior with a grain of salt. Try to handle the really outrageous as matter-of-factly as you would a mistake in grammar or spelling.”
—Stella Chess (20th century)
“The machine unmakes the man. Now that the machine is perfect, the engineer is nobody. Every new step in improving the engine restricts one more act of the engineer,—unteaches him.”
—Ralph Waldo Emerson (1803–1882)