A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Deterministic coin tossing with applications to optimal parallel list ranking

1986
*
Information and Control
*

*The*

*algorithms*apply a novel "

*random*-like"

*deterministic*technique. ...

*The*following problem is considered: given a

*linked*

*list*of length n, compute

*the*distance from each element of

*the*

*linked*

*list*to

*the*end of

*the*

*list*. ... INTRODUCTION

*The*

*model*of parallel computation used in this paper is

*the*exclusiveread exclusive-write (

*EREW*) parallel

*random*access machine (

*PRAM*). ...

##
###
Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem

1997
*
Parallel Processing Letters
*

*The*rst

*algorithm*runs in O(log 2 n) time

*on*an

*EREW*

*PRAM*, while

*the*second

*algorithm*runs in O(log n) time

*on*a Common CRCW

*PRAM*. ... Two

*simple*

*and*work-e cient parallel

*algorithms*

*for*

*the*minimum spanning tree problem are presented. Both

*algorithms*perform O(m log n) w ork. ... I w ould also like to thank Jesper Tr a

*for*many helpful discussions

*and*comments

*on*an earlier version of this paper. ...

##
###
Efficient Low-Contention Parallel Algorithms

1996
*
Journal of computer and system sciences (Print)
*

*The*QRQW

*PRAM*

*model*reflects

*the*contention properties of most commercially available parallel machines more accurately than either

*the*well-studied CRCW

*PRAM*or

*EREW*

*PRAM*

*models*,

*and*can be efficiently ... These logarithmic or sublogarithmic time

*algorithms*considerably improve upon

*the*best known

*EREW*

*PRAM*

*algorithms*

*for*these problems, while avoiding

*the*high-contention steps typical of CRCW

*PRAM*

*algorithms*... We then perform

*list*

*ranking*

*on*

*the*

*linked*

*list*

*for*each processor,

*and*transfer

*the*tasks in

*the*

*linked*

*list*into an array of suitable size. This can be performed in O(lg L) time

*and*O(m) work. ...

##
###
Optimal Tree Contraction in the EREW Model
[chapter]

1988
*
Concurrent Computations
*

This

doi:10.1007/978-1-4684-5511-3_9
fatcat:5pw2uladurdsvehfkdxts5gcma
*algorithm*improves*the*results of Miller*and*who use*the*CRCW*randomized**PRAM**model*to get*the*same complexity*and*processor count. ...*The**algorithm*takes T time*and*uses (P processors, where n*the*number of vertices in a tree using an Exclusive Read*and*Exclusive Write (*EREW*) Parallel*Random*Access Machine (*PRAM*). ... Their*algorithm*uses*randomization**and*requires*the*CRCW*model*.*for*Lirt-*Ranking*.*the**List*-*Ranking*problem can be performed in time*on*an*EREW**PRAM*using n processors, it translates into an n)*algorithm*...##
###
Parallel algorithmic techniques for combinatorial computation
[chapter]

1989
*
Lecture Notes in Computer Science
*

*One*such instance is

*the*

*randomized*

*EREW*

*list*

*ranking*

*algorithm*of Vishkin [1984cli this

*algorithm*was later made

*deterministic*[Cole

*and*Vishkin 1986a, 1986bJ

*and*still later made faster with

*the*same ... Thus we can use this routine in place of

*the*coin tossing in our

*ranking*algori thm,

*and*

*rank*a

*linked*

*list*in O(log n log log n) time with linear

*deterministic*

*EREW*operations. ...

##
###
Parallel Algorithmic Techniques For Combinational Computation

1988
*
Annual Review of Computer Science
*

*One*such instance is

*the*

*randomized*

*EREW*

*list*

*ranking*

*algorithm*of Vishkin [1984cli this

*algorithm*was later made

*deterministic*[Cole

*and*Vishkin 1986a, 1986bJ

*and*still later made faster with

*the*same ... Thus we can use this routine in place of

*the*coin tossing in our

*ranking*algori thm,

*and*

*rank*a

*linked*

*list*in O(log n log log n) time with linear

*deterministic*

*EREW*operations. ...

##
###
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
[chapter]

2014
*
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
*

We show that

doi:10.1137/1.9781611973730.30
dblp:conf/soda/ShunGBFG15
fatcat:4gi73s3gvzh5bl5rvnow2hp63i
*simple*sequential*randomized*iterative*algorithms**for**random*permutation,*list*contraction,*and*tree contraction are highly parallel. ... Although asymptotically no better than*the*many prior parallel*algorithms**for**the*given problems, their advantages include very*simple**and*fast implementations,*and*returning*the*same result as*the*sequential ... Acknowledgements This work is supported by*the*National Science Foundation under grant numbers CCF-1314590*and*CCF-1314633,*the*Intel Labs Academic Research Office*for**the*Parallel*Algorithms**for*Non-Numeric ...##
###
Efficient low-contention parallel algorithms

1994
*
Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94
*

*The*qrqw

*pram*

*model*re ects

*the*contention properties of most commercially available parallel machines more accurately than either

*the*well-studied crcw

*pram*or

*erew*

*pram*

*models*,

*and*can be e ciently emulated ... These logarithmic or sublogarithmic time

*algorithms*considerably improve upon

*the*best known

*erew*

*pram*

*algorithms*

*for*these problems, while avoiding

*the*high-contention steps typical of crcw

*pram*

*algorithms*...

*The*integer sorting

*algorithm*follows

*the*steps of

*the*Rajasekaran

*and*Reif

*algorithm*

*for*

*the*crcw

*pram*RR89]. ...

##
###
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms

1998
*
SIAM journal on computing (Print)
*

This matches

doi:10.1137/s009753979427491
fatcat:bwua22baujghvesgxzawx5ky2q
*the*bestknown emulation result*for**the**erew**pram*,*and*considerably improves upon*the*best-known efficient emulation*for**the*crcw*pram**on*such networks. ... Finally,*the*paper presents several lower bound results*for*this*model*, including lower bounds*on**the*time required*for*broadcasting*and**for*leader election. ... Richard Cole, Albert Greenberg, Maurice Herlihy, Honghua Yang,*and**the*anonymous referees provided useful comments*on*this work. ...##
###
A parallel algorithm for computing minimum spanning trees

1992
*
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures - SPAA '92
*

We present a

doi:10.1145/140901.141917
dblp:conf/spaa/JohnsonM92
fatcat:4ss3zmici5hwljxe6ww5ne3k5m
*simple**and*implementable*algorithm*that computes a minimum spanning tree of an undirected weighted graph G = ( V E) o f n = jV j vertices*and*m = jE j edges*on*an*EREW**PRAM*in O(log 3=2 n) ... It also implies*the*existence of*algorithms*having*the*same complexity bounds*for**the**EREW**PRAM*,*for*connectivity, ear decomposition, biconnectivity, strong orientation, st-numbering*and*Euler tours problems ... This paper describes a new parallel*algorithm**for*computing*the*minimum spanning tree (MST) of a graph in*the**EREW**PRAM**model*of parallel computation,*the*weakest of*the**PRAM**models*. ...##
###
Sorting and selection on interconnection networks
[chapter]

1995
*
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
*

*For*

*the*sake of comparisons, we also

*list*

*PRAM*

*algorithms*. ... We consider both

*randomized*

*and*

*deterministic*techniques. ... Optimal

*algorithms*

*for*these two problems also exist

*for*certain parallel

*models*like

*the*

*EREW*

*PRAM*,

*the*comparison tree

*model*, etc. ...

##
###
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures

1997
*
Information and Computation
*

We consider

doi:10.1006/inco.1997.2642
fatcat:6p23hty4wvdqhoeq5az2c4hxp4
*randomized*simulations of shared memory*on*a distributed memory machine (DMM) where*the*n processors*and**the*n memory modules of*the*DMM are connected via a reconfigurable architecture. ... In this paper we present a*randomized*step by step simulation of a CRCW*PRAM*with arbitrarily large shared memory*on*an RM-DMM. ... ACKNOWLEDGMENT We are grateful to Assaf Schuster*for*pointing out*the*problem of simulations*on*a reconfigurable mesh. Received February 22, 1996; final manuscript received March 25, 1997 ...##
###
Data Oblivious Algorithms for Multicores
[article]

2021
*
arXiv
*
pre-print

Most prior works

arXiv:2008.00332v2
fatcat:fpj5e7tqjfbe7audobaqj7xv3y
*on*data-oblivious*algorithms*adopt*the*classical*PRAM**model*to capture parallelism. ... We also present results*for*several applications including*list**ranking*, Euler tour, tree contraction, connected components,*and*minimum spanning forest. ... F.1*List**Ranking*In*the**list**ranking*problem we are given an n-element*linked**list**on**the*elements {1, 2, . . . , n}. ...##
###
Optimal parallel algorithms on planar graphs

1990
*
Information and Computation
*

*The*running times achieved

*for*n-vertex input graphs are O(logn)

*on*

*the*CRCW

*PRAM*

*and*O(log n log* n)

*on*

*the*

*EREW*

*PRAM*. ... We also give (non-optimal)

*randomized*

*EREW*

*PRAM*

*algorithms*using O(logn) time

*and*n processors,

*and*non-uniform

*deterministic*

*EREW*

*PRAM*

*algorithms*using O(log n) time

*and*O(n') processors. ! ... * n) as well as (non-optimal)

*randomized*n-processor

*EREW*

*PRAM*

*algorithms*with running times of O(log n)

*and*non-uniform

*deterministic*

*EREW*

*PRAM*

*algorithms*using O(log n) time

*and*0(n2) processors (actually ...

##
###
Parallel external memory graph algorithms

2010
*
2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)
*

In this paper, we study parallel I/O efficient graph

doi:10.1109/ipdps.2010.5470440
dblp:conf/ipps/ArgeGS10
fatcat:ul3phtd5prawdilrojj3mommjm
*algorithms*in*the*Parallel External Memory (PEM)*model*,*one*of*the*private-cache chip multiprocessor (CMP)*models*. ... 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. ... Acknowledgments We would like to thank Deepak Ajwani*for*helpful comments in improving*the*presentation of*the*ideas in this manuscript. ...
« Previous

*Showing results 1 — 15 out of 90 results*