U. Vishkin. Structural parallel algorithmics. In Proc. 18th ICALP - Lecture Notes in Computer Science 510, Springer-verlag, pages 363--380, 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....been shown to be P complete, i.e. to have no NC algorithm unless P = NC. The class NC and the notion of P completeness have allowed major advances to be made in our theoretical understanding of shared memory parallel algorithms and their complexity. PRAM A parallel random access machine (PRAM) [34, 97, 57] consists of a collection of processors that compute synchronously in parallel and that communicate with a common global random access memory. In one time step, each processor can do (any subset of) the following: read the operand(s) from the common memory, perform a simple arith CHAPTER 1. ....

VISHKIN, U. Structural Parallel Algorithmics. In 18th International Colloquium on Automata, Languages and Programming, LNCS Vol. 510, Springer-Verlag (1991), pp. 363--380.

....on the PRAM model are often very modular in structure (or have parallel primitives) Problems are solved by calling these parallel primitives. For solving undirected graph problems, a set of parallel primitives required for constructing an ear decomposition has proved to be very useful [Ram93, Vis91] 191 Our parallel implementation follows this approach. We first built a kernel which consists of commonly used routines in parallel graph algorithms. Then we implemented efficient parallel graph algorithms developed on the PRAM model by calling routines in the kernel. Our experience with ....

U. Vishkin. Structural parallel algorithmics. In Proc. 18th ICALP, volume LNCS #510, pages 363--380. Springer-Verlag, 1991.

....in 2 3 trees are assumed to be known [2] 6. A library of parallel algorithms and data structures Algorithm design for the PRAM model has singled out a relatively small number of operations which are used over and over as building blocks in algorithms for more involved problems (see again, e.g. [11, 14]) For practical PRAM programming these fundamental algorithms or operations must be made available at a sufficiently abstract level as part of a standard library. Defining a small number of data types, like arrays, lists, trees and graphs, for which certain basic operations are defined ....

Uzi Vishkin. Structural Parallel Algorithmics, chapter 1, pages 1--18. Cambridge University Press, 1993.

....developed on the PRAM model are often very modular in structure (or have parallel primitives) Problems are solved by calling these parallel primitives. For solving undirected graph problems, a set of parallel primitives required for constructing an ear decomposition has proved to be very useful [31, 37]. Our parallel implementation follows this approach. We first built a kernel which consists of commonly used routines in parallel graph algorithms. Then we implemented efficient parallel graph algorithms developed on the PRAM model by calling routines in the kernel. Our experience with ....

U. Vishkin. Structural parallel algorithmics. In Proc. 18th ICALP, volume LNCS #510, pages 363--380. Springer-Verlag, 1991.

.... the actor model [9, 10] and the dataflow model [128, 129, 199, 200, 206] The most fundamental difference between these two approaches and the BSP model is that they both have at their core the idea of local (usually pairwise) synchronisation events, whereas the BSP model, as well as various PRAM [80, 89, 149, 224, 259, 266] and data parallel models [43, 123] have the idea of global barrier synchronisation as the basic mechanism. Another significant difference is that in the BSP, PRAM and data parallel approaches there is usually tight control of ordering and scheduling McCOLL : GENERAL PURPOSE PARALLEL COMPUTING ....

....of messages which must be sent. Such results may provide a theoretical basis for the future development of software tools which efficiently schedule shared memory parallel algorithms for implementation on distributed memory architectures. 2.1. The PRAM A parallel random access machine (PRAM) [80, 83, 149, 266, 276] consists of a collection of processors which compute synchronously in parallel and which communicate with a common global random access memory. In one time step, each processor can do (any subset of) the following read two values from the common memory, perform a simple two argument operation, ....

[Article contains additional citation context not shown here]

U Vishkin. Structural parallel algorithmics. In J Leach Albert, B Monien, and M Rodriguez Artalejo, editors, Proc. 18th International Colloquium on Automata, Languages and Programming, LNCS Vol.510, pages 363--380. Springer-Verlag, 1991.

....several processors may simultaneously read the same memory location, but exclusive access is used for writing. In the Exclusive Read Exclusive Write PRAM (EREW PRAM) model, a memory location cannot be simultaneously accessed by more than one processor. The interested reader is referred to [16,28] for a detailed discussion of the PRAM family. It is easy to see that the more restrictive EREW PRAM is the weakest member of the PRAM family. Additionally, several 3 authors argue that EREW PRAM is the only model that is reasonably close to real machines, making it of a particular practical ....

....to determine in parallel the rank of every element in a given linked list, that is, the number of elements following it in the list. List ranking has turned out to be one of the fundamental techniques in parallel processing, playing a crucial role in a vast array of important parallel algorithms [1,3,5,6,17,28]. In particular, Cole and Vishkin [5] and Anderson and Miller [3] have showed that list ranking can be done optimally in O( logn ) time using O( n0 ) processors in the EREW PRAM model. The well known Euler tour technique developed in [26] allows one to compute a number of tree functions by ....

U. Vishkin, Structural parallel algorithmics, Technical Report, UMIACS-TR-91-53, April, 1991.

No context found.

U. Vishkin. Structural parallel algorithmics. In Proc. 18th ICALP - Lecture Notes in Computer Science 510, Springer-verlag, pages 363--380, 1991.

....shift towards effective use of hardware parallelism is also presented. ffl Successful theory. A knowledge base of algorithm parallelism of considerable extent has been developed. Several books, Akl 89] GR 88] J 92] and [R 92] and a few review papers, EG 88] KR 90] KRS 90] and [Vi 91a], attest to a unique and comprehensive knowledge base of PRAM algorithms, methods, techniques and paradigms. Note that some of these publications consider as efficient only algorithms whose running time is poly logarithmic (i.e. asymptotically bounded by a polynomial in the logarithm of the ....

U. Vishkin. Structural parallel algorithmics. In Proc. of the 18th Int. Colloquium on Automata, Languages and Programming, pages 363--380, 1991, Lecture Notes in Computer Science 510, Springer-Verlag.

....of [8] is used to obtain such a result on unrestricted input. Also, this is the first example of an O(ff(n) randomized result. This latter result is only for the comparison model, however. These results add to a growing knowledge base of nearly constant time parallel algorithms (see [33]) 1.2. Related work. We review below related results for the range maxima problem and for the prefix maxima problem. Sequential algorithms. Gabow, Bentley, and Tarjan [15] gave a lineartime preprocessing algorithm for range maxima that results in constant time query retrieval. For the ....

U. Vishkin, Structural parallel algorithmics, in Proc. of 18th International Colloquium on Automata Languages and Programming, Springer LNCS 510, 1991, 363--380.

No context found.

U. Vishkin, "Structural parallel algorithmics", in Proc. of the 18th Int. Colloquium Automata, Languages and Programming (1991) pp. 363--380.

....several processors may attempt to write simultaneously at the same location only if they write the same value. This model is called Common CRCW PRAM. A CREW PRAM allows simultaneous access by more than one processor to the same memory location only for read operations. See [EG88] KR90] and [Vis91] for surveys of results concerning PRAMs. A parallel algorithm attains optimal speedup if its time processor product is (asymptotically) the same as the time complexity of the best known sequential algorithm for the same problem. A parallel algorithm is optimal if this product is (asymptotically) ....

U. Vishkin. Structural parallel algorithmics. In Proc. of 18th ICALP, Lecture Notes in Computer Science, No. 510. Springer--Verlag, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC