Filters








37,894 Hits in 3.0 sec

Deterministic coin tossing with applications to optimal parallel list ranking

Richard Cole, Uzi Vishkin
1986 Information and Control  
We present new deterministic parallel algorithms for the problem.  ...  The problem has two standard deterministic algorithms: a linear time serial algorithm, and an O(log n) time parallel algorithm using n processors.  ...  Step 5 applies the standard parallel list ranking algorithm in order to find the ranking of each element in this linked list.  ... 
doi:10.1016/s0019-9958(86)80023-7 fatcat:57lv3cvjevffxe6rhrjnhetn4m

CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters [chapter]

Albert Chan, Frank Dehne
2003 Lecture Notes in Computer Science  
Our implementations of deterministic list ranking, Euler tour, connected components, spanning forest, and bipartite graph detection are, to our knowledge, the first efficient implementations for PC clusters  ...  In this paper, we present CGMgraph, the first integrated library of parallel graph methods for PC clusters based on CGM algorithms. CGMgraph implements parallel methods for various graph problems.  ...  Our implementation uses the deterministic list ranking method for the Euler tour computation. Not surprisingly, the performance is essentially the same as for deterministic list ranking.  ... 
doi:10.1007/978-3-540-39924-7_20 fatcat:zudhix7ifndzzgthfbah4aip5u

CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines

Albert Chan, Frank Dehne, Ryan Taylor
2005 The international journal of high performance computing applications  
In comparison with Guérin Lassous et al. (2000) , CGMgraph implements both a randomized as well as a deterministic list ranking method.  ...  Our implementations of deterministic list ranking, Euler tour, connected components, spanning forest, and bipartite graph detection are, to our knowledge, the first efficient implementations for PC clusters  ...  Fig. 6 6 Performance of the parallel sort implementation. Fig. 7 7 Performance of the randomized list ranking algorithm. Fig. 8 8 Performance of the deterministic list ranking algorithm.  ... 
doi:10.1177/1094342005051196 fatcat:274ehzuir5d3djgdy2zfogxspy

Page 60 of Journal of Research and Practice in Information Technology Vol. 27, Issue 2 [page]

1995 Journal of Research and Practice in Information Technology  
., and VISHKIN, U. (1986a): Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control, 70:32-53.  ...  ., and MILLER, G.L. (1991): Deterministic parallel list ranking, Algorithmica, 6:859-868. BLELLOCH, G.E. (1989): Scans as primitive parallel operations, JEEE Trans. Comput. 38:1526-1538.  ... 

Parallel external memory graph algorithms

Lars Arge, Michael T. Goodrich, Nodari Sitchinava
2010 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)  
We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest common ancestors, tree contraction and expression tree evaluation.  ...  In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models.  ...  List ranking has traditionally been the linchpin in the design of parallel and EM graph algorithms.  ... 
doi:10.1109/ipdps.2010.5470440 dblp:conf/ipps/ArgeGS10 fatcat:ul3phtd5prawdilrojj3mommjm

Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP

F. Dehne, A. Ferreira, E. Cáceres, S. W. Song, A. Roncato
2002 Algorithmica  
In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well-known graph problems: (1)  ...  list ranking, (2) Euler tour construction in a tree, (3) computing the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree evaluation  ...  In Section 3 of this paper we use a technique called deterministic list compression to obtain a deterministic list ranking algorithm with O(log p) rounds.  ... 
doi:10.1007/s00453-001-0109-4 fatcat:luwfutwv3vaazixhpsqoy4hpee

Efficient parallel graph algorithms for coarse grained multicomputers and BSP [chapter]

E. Cáceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, S. W. Song
1997 Lecture Notes in Computer Science  
In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well-known graph problems: (1)  ...  list ranking, (2) Euler tour construction in a tree, (3) computing the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree evaluation  ...  In Section 3 of this paper we use a technique called deterministic list compression to obtain a deterministic list ranking algorithm with O(log p) rounds.  ... 
doi:10.1007/3-540-63165-8_195 fatcat:wvubewx4nfb3zlv2gr6fqqb7f4

Page 6645 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
and list ranking.  ...  To do the list ranking, the maximal independent set algorithm is used O(loglogn) times to thin out the list to a list of length n/logn from whose ranking the ranking of the original list can be found easily  ... 

Faster optimal parallel prefix sums and list ranking

Richard Cole, Uzi Vishkin
1989 Information and Computation  
This technique is the backbone of all available poly-log time optimal (deterministic) parallel algorithms for the list ranking problem.  ...  The Standard Parallel List Ranking Algorithm The standard parallel list ranking algorithm given below is due to Wyllie (1979) . Say that we have n processors.  ... 
doi:10.1016/0890-5401(89)90036-9 fatcat:yfxazzhtavh6lenv34g2gce5d4

Cumulative subject index volumes 68–71

1986 Information and Control  
, applications to optimal parallel list ranking, 70, 32 network resource allocation, probabilistic analysis, 68, 47 optimally data-efficient, for isomorphism inference:  ...  69 Algorithms for circular retrieval and k-nearest neighbor search problems, description and analysis, 68, 105 for computing properties and functions of n-node forest stored in processor mesh, 69, 168 deterministic  ...  ranking, optimal parallel, applications of deterministic coin tossing, 70, 32 Liveness properties whiLe-programs, syntax-directed analysis, 68, 223 Locking pre-analysis, description, 70, 193 Logic  ... 
doi:10.1016/s0019-9958(86)80014-6 fatcat:hkligygazvcyvdgrhtvhrefpj4

Efficient massively parallel implementation of some combinatorial algorithms

Tsan-sheng Hsu, Vijaya Ramachandran
1996 Theoretical Computer Science  
We describe our implementation of several efficient parallel algorithms on the massively parallel SIMD machine MasPar MP-1 with virtual processing.  ...  In coding these routines, we tried different underlying (deterministic and randomized) algorithms. We present the performance data for our different implementations.  ...  The three basic parallel primitives are prefix summing, list ranking, and sorting.  ... 
doi:10.1016/0304-3975(96)00034-5 fatcat:wwcq2n2s5bcs7ldaoqsu66geku

A survey of randomness and parallelism in comparison problems [chapter]

Danny Krizanc
1998 Lecture Notes in Computer Science  
A survey of results for the problems of selection, merging and sorting in the Randomized Parallel Comparison Tree RPCT model is given.  ...  Discussion The results above show that there is a signi cant gap between the randomized and deterministic parallel complexity of selection in the PCT model.  ...  Introduction Valiant 27 introduced the Parallel Comparison Tree PCT model for studying parallelism in the classical comparison problems of selection, merging and sorting.  ... 
doi:10.1007/3-540-64359-1_703 fatcat:igwdbljwqrhpvejxczrsioofne

Parallel comparison merging of many-ordered lists

Y. Azar
1991 Theoretical Computer Science  
., Parallel comparison merging of many-ordered lists (Note), Theoretical Computer Science 83 (1991) 275-285.  ...  The problem of merging these lists with p processors is called parallel krging of many ordered lists.  ...  The average comparison complexityfor the best (deterministic or randomized) algorithm for parallel merging of many ordered lists is the same, up to a constant factor, as the worst case complexity of the  ... 
doi:10.1016/0304-3975(91)90279-b fatcat:3l34djesvrb5vezpizdyzios3y

Page 6083 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
Summary: “List ranking is one of the fundamental techniques in parallel algorithm design.  ...  Hayashi, Nakano, and Olariu proposed a deterministic list ranking algorithm that runs in O(log” n) time and a randomized one that runs in O(1) expected time, both on Algorithms For the web version of Mathematical  ... 

Optimal Tree Contraction in the EREW Model [chapter]

Hillel Gazit, Gary L. Miller, Shang-Hua Teng
1988 Concurrent Computations  
A deterministic parallel algorithm for parallel tree contraction is presented in this paper.  ...  Techniques for prudent parallel tree contraction are also discussed, as well as implementation techniques for connection machines.  ...  The first is the List-Ranking problem, where one is given a linked list of length n packed into consecutive memory locations.  ... 
doi:10.1007/978-1-4684-5511-3_9 fatcat:5pw2uladurdsvehfkdxts5gcma
« Previous Showing results 1 — 15 out of 37,894 results