PRAM stands for Parallel Random Access Machine, which is an abstract machine for designing the algorithms applicable to parallel computers. It eliminates the focus on miscellaneous issues such as synchronization and communication, but lets designer think explicitly about the exploitation of concurrency. An abstract machine, also called an abstract computer, is a theoretical model of a computer hardware or software system. ... Jump to: navigation, search Flowcharts are often used to represent algorithms. ... Parallel computing is the simultaneous execution of the same task (split up and specially adapted) on multiple processors in order to obtain faster results. ... Synchronization is coordination with respect to time. ... Jump to: navigation, search Communication is the process of exchanging information usually via a common system of symbols. ... In computer science, concurrency is concerned with the sharing of common resources between computations which execute overlapped in time (including running in parallel). ...
The operation of a synchronous PRAM can result in simultaneous access by multiple processors to the same location in shared memory. There are several variants of our PRAM model, depending on whether such simultaneous access is permitted or prohibited. As accesses can be reads or writes, there are four possibilities: Synchronization is coordination with respect to time. ... A CPU The exact term processor is a sub-system of a data processing system which processes received information after it has been encoded into data by the input sub-system. ... Shared memory refers to a (typically) large block of Random access memory that can be accessed by several different central processing units (CPUs) in a multiple-processor computer system. ...
Exclusive Read Exclusive Write
Concurrent Read Exclusive Write
Exclusive Read Concurrent Write
Concurrent Read Concurrent Write
Lock-free and wait-free algorithms
Categories: Computer stubs | Computational models In contrast to algorithms that protect access to shared data with locks, lock-free and wait-free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. ...
Share your thoughts, questions and commentary here
Want to know more? Search encyclopedia, statistics and forums:
Press Releases |
The Wikipedia article included on this page is licensed under the
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m