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:
“The beginnings of altruism can be seen in children as early as the age of two. How then can we be so concerned that they count by the age of three, read by four, and walk with their hands across the overhead parallel bars by five, and not be concerned that they act with kindness to others?”
—Neil Kurshan (20th century)
“I find it hard to believe that the machine would go into the creative artist’s hand even were that magic hand in true place. It has been too far exploited by industrialism and science at expense to art and true religion.”
—Frank Lloyd Wright (1869–1959)