Results 1  10
of
398,637
Feasible TimeOptimal Algorithms for Boolean Functions on ExclusiveWrite PRAMs
, 1994
"... It was shown some years ago that the computation time for many important Boolean functions of n arguments on concurrentread exclusivewrite parallel randomaccess machines (CREW PRAMs) of unlimited size is at least '(n) 0:72 log 2 n. On the other hand, it is known that every Boolean function ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
It was shown some years ago that the computation time for many important Boolean functions of n arguments on concurrentread exclusivewrite parallel randomaccess machines (CREW PRAMs) of unlimited size is at least '(n) 0:72 log 2 n. On the other hand, it is known that every Boolean function
Linear Programming with Two Variables per Inequality in PolyLog Time
 SIAM J. Computing
, 1990
"... The parallel time complexity of the linear programming problem with at most twovariables per inequality is discussed. Let m denote the number of variables and the number of inequalities, respectively,ina linear programming problem. We assume all inequalities are weak. We describe an O((log m ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
((log m+log n)time parallel algorithm for deciding feasibility, under the concurrentreadexclusivewrite PRAM model. It requires mn O(logn) processors in the worst case, though we do not know whether this bound is tight. When the problem is feasible a solution can be computed within the same
Ports for Objects in Concurrent Logic Programs
 In Research Directions in Concurrent ObjectOriented Programming
, 1993
"... Weintroduce ports, an alternative to streams, as communication support for objectoriented programming in concurrent constraint logic programming languages. From a pragmatic point of view ports provide e#cient manytoone communication, object identity, means for garbage collection of objects, and op ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
, and opportunities for optimised compilation techniques for concurrent objects. From a semantic point of view, ports preserve the monotonicity of the constraint store which is a crucial property of all concurrent constraint languages. We also show that the Exclusiveread, Exclusivewrite PRAM model of parallel
A Note on Reducing Parallel Model Simulations to Integer Sorting
, 1995
"... We show that simulating a step of a fetch&add pram model on an erew pram model can be made as efficient as integer sorting. In particular, we present several efficient reductions of the simulation problem to various integer sorting problems. By using some recent algorithms for integer sorting, w ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
with a crcw pram algorithm for hashing. 1 Introduction The concurrentread concurrentwrite (crcw) pram programmer's model is commonly used for designing parallel algorithms. On the other hand, the weaker exclusivewrite pram models are sometimes considered closer to realization. Therefore, while
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract

Cited by 556 (15 self)
 Add to MetaCart
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding
Approximate Compaction and PaddedSorting on Exclusive Write PRAMs
, 1996
"... Paddedsorting is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, paddedsorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time com ..."
Abstract
 Add to MetaCart
complexity of paddedsorting on randomized CRCW PRAMs is considerably lower than time complexity of sorting. We analyze time complexity of these problems on CREW and EREW PRAMs (deterministic and randomized) and get tight lower und upper bounds depending on the size of free space. We extend our lower bounds
The Parameterized PRAM
"... Various alternatives to the PRAM model have been proposed in recent literature. This paper defines the notion of cost consistency, and shows that many previous PRAMtype models lack this important attribute. An alternative model of parallel computation, called the Parameterized PRAM, is then introdu ..."
Abstract
 Add to MetaCart
Various alternatives to the PRAM model have been proposed in recent literature. This paper defines the notion of cost consistency, and shows that many previous PRAMtype models lack this important attribute. An alternative model of parallel computation, called the Parameterized PRAM
On the Power of Some PRAM Models
 Journal of Parallel Algorithms and Applications. Vol
, 1997
"... The focus here is the power of some underexplored CRCW PRAMs, which are strictly more powerful than exclusive write PRAM but strictly less powerful than BSR. We show that some problems can be solved more efficiently in time and/or processor bounds on these models. For example, we show that n linearl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The focus here is the power of some underexplored CRCW PRAMs, which are strictly more powerful than exclusive write PRAM but strictly less powerful than BSR. We show that some problems can be solved more efficiently in time and/or processor bounds on these models. For example, we show that n
Simulation of PRAM Models on Meshes
 Nordic Journal on Computing, 2(1):51
, 1994
"... We analyze the complexity of simulating a PRAM (parallel random access machine) on a mesh structured distributed memory machine. By utilizing suitable algorithms for randomized hashing, routing in a mesh, and sorting in a mesh, we prove that simulation of a PRAM on p N \Theta p N (or 3 p N \The ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
p N + o( 3 p N )) per N PRAM processors. These simulations compare quite favorably with PRAM simulations on butterfly and hypercube. 1 Introduction PRAM 1 (Parallel Random Access Machine) is an abstract model of computation. It consists of N processors, each of which may have some local memory
On the Physical Design of PRAMs
, 1993
"... The Saarbrucken Parallel Random Access Machine (SBPRAM) is a scalable shared memory machine. At the gate level it is a reengineered version of the Fluent machine [A. G. Ranade, S. N. Bhatt and S. L. Johnson. The Fluent Abstract Machine. In Proc. 5th MIT Conference on Advanced Research in VLSI, pp. ..."
Abstract

Cited by 49 (13 self)
 Add to MetaCart
The Saarbrucken Parallel Random Access Machine (SBPRAM) is a scalable shared memory machine. At the gate level it is a reengineered version of the Fluent machine [A. G. Ranade, S. N. Bhatt and S. L. Johnson. The Fluent Abstract Machine. In Proc. 5th MIT Conference on Advanced Research in VLSI, pp
Results 1  10
of
398,637