منابع مشابه
Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs
We introduce a PRAM model which allows processors to have arbitrary asynchronous behavior. Our main result shows that any n-processor CRCW PRAM program can be simulated on an asynchronous CRCW PRAM using O(n) expected work per parallel step, and using up to lo ,yor , asynchronous processors. We achieve this result despite the fact that our work measure counts all instructions, including busy wa...
متن کاملUniform Circuits and Exclusive Read Prams 3 (preliminary Version, January 1991)
CRCW-PRAMs can be characterized in terms of unbounded fan-in circuits. We introduce the notion of SELECT-gates. Combining this with the concept of an unambiguous circuit we are able to give a circuit equivalent of EREW-PRAMs, thus answering an open question of [SV84]. Moreover, circuits with SELECT-gates characterize CRCW-, CREW-, ERCW-, and EREW-PRAMs in a uniform manner.
متن کاملRecurrent neural networks with pRAMs
This paper introduces a pRAM (probabilistic RAM) node system for sequential pattern veriication. It includes a recurrent network trained with reinforcement learning based on the current state training strategy to generate the target for the reward/penalty signal. The main issues concerning the architecture's applicability to sequential pattern veriication are discussed and experiments illustrat...
متن کاملREVIEW OF HARDWARE pRAMs
This paper reviews the development of the probabilistic RAM (pRAM) from its conception to the present day. One of the chief aims of this model of an artificial neuron has been to implement suitable learning rules in hardware. This work spans the development of single neuron models to an architecture for implementing large-scale pRAM networks and on to artificial neurons with temporal responses.
متن کاملCommunication Complexity of PRAMs
We propose a model. LPRAM. for parallel random access machines uith local memon, that captures bcth the communication and computational requirements in parallel computation. For this model. n? present se\cral interesting resuk including the following: Two n x n matkez can be multiplied in Of n’/p) computation time and O( n“/p’ ‘) communication steps using p processors (for p = Ot n ‘/log’ ’ n) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90138-4