Filters








593,734 Hits in 2.9 sec

Randomized parallel algorithms [chapter]

Andrea Clementi, José D. P. Rolim, Erik Urland
1996 Lecture Notes in Computer Science  
solutions require the use of randomness and thus they witness the importance of using probabilistic methods in designing parallel algorithms.  ...  The rst approach is to introduce randomness into the algorithm by using a random-bit generator.  ... 
doi:10.1007/bfb0027117 fatcat:zrmoth7tnzhvhibmdvhlnv7rua

Parallelism in Randomized Incremental Algorithms

Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun
2016 Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA '16  
In this paper we show that many sequential randomized incremental algorithms are in fact parallel.  ...  We consider several random incremental algorithms including algorithms for comparison sorting and Delaunay triangulation; linear programming, closest pair, and smallest enclosing disk in constant dimensions  ...  The bounds for all of our parallel randomized incremental algorithms can be found in Table 1 . Preliminaries We analyze parallel algorithms in the work-depth paradigm [42] .  ... 
doi:10.1145/2935764.2935766 dblp:conf/spaa/Blelloch0SS16 fatcat:aeviwcwkovcxhhernkee7rjpjm

Parallelism in Randomized Incremental Algorithms [article]

Guy E. Blelloch and Yan Gu and Julian Shun and Yihan Sun
2018 arXiv   pre-print
In this paper we show that many sequential randomized incremental algorithms are in fact parallel.  ...  Using the framework gives work-efficient polylogarithmic-depth parallel algorithms for most of the problems that we study.  ...  We describe a framework for analyzing parallelism in randomized incremental algorithms.  ... 
arXiv:1810.05303v1 fatcat:ytaq55blivcxlloikclsqmi6ie

Parallel Randomized Algorithm for Chance Constrained Program [article]

Xun Shen, Jiancang Zhuang, Xingguo Zhang
2019 arXiv   pre-print
Randomized optimization is applied to search the optimizer which satisfies chance constraints in a framework of parallel algorithm.  ...  This paper proposes a two-layer randomized algorithm to address chance constrained program.  ...  Apparently, the algorithm is parallel compared to the original randomized algorithm.  ... 
arXiv:1911.00192v3 fatcat:fdwltuhlgzemdjwfz7avwsdlwa

An Asynchronous Parallel Randomized Kaczmarz Algorithm [article]

Ji Liu and Stephen J. Wright and Srikrishna Sridhar
2014 arXiv   pre-print
We describe an asynchronous parallel variant of the randomized Kaczmarz (RK) algorithm for solving the linear system Ax=b.  ...  The authors would like to sincerely thank Yijun Huang for her implementation of algorithms AsyRK and AsySCD used in this paper.  ...  Although our asynchronous parallel randomized Kaczmarz algorithm (AsyRK) can be viewed as an application of Hogwild!  ... 
arXiv:1401.4780v2 fatcat:pkfx4zxq2jeibi3f6i3yfpqh5e

Revisiting Randomized Parallel Load Balancing Algorithms [chapter]

Guy Even, Moti Medina
2010 Lecture Notes in Computer Science  
a r t i c l e i n f o Keywords: Static randomized parallel load balancing algorithms Balls and bins a b s t r a c t We deal with the well studied allocation problem of assigning n balls to n bins so that  ...  We conducted experiments that demonstrate its advantage over parallel algorithms for 10 6 ≤ n ≤ 8 · 10 6 balls and bins.  ...  We thank Haim Kaplan, Dana Ron and Boaz Patt-Shamir for their suggestions, and the audience of the Algorithms Seminar in the School of Computer Science in Tel-Aviv University for their remarks and feedback  ... 
doi:10.1007/978-3-642-11476-2_17 fatcat:pqmo4z55krauhgu4jak4zqf3h4

Revisiting randomized parallel load balancing algorithms

Guy Even, Moti Medina
2012 Theoretical Computer Science  
a r t i c l e i n f o Keywords: Static randomized parallel load balancing algorithms Balls and bins a b s t r a c t We deal with the well studied allocation problem of assigning n balls to n bins so that  ...  We conducted experiments that demonstrate its advantage over parallel algorithms for 10 6 ≤ n ≤ 8 · 10 6 balls and bins.  ...  We thank Haim Kaplan, Dana Ron and Boaz Patt-Shamir for their suggestions, and the audience of the Algorithms Seminar in the School of Computer Science in Tel-Aviv University for their remarks and feedback  ... 
doi:10.1016/j.tcs.2012.01.009 fatcat:4fmrmt2w3rgdnlc2toyqj6twfy

From randomizing polynomials to parallel algorithms

Yuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky
2012 Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12  
Algorithmic application 1 -quadratic residuosity • The problem: Given x ∈ F q (q is odd), output 1 iff. y 2 = x for some y ∈ F q . • Sequential algorithm: output x q −1 2 , folklore. • Parallel NC 2 Algorithm  ...  : obtain a NC 3 (NC 2 ) circuit for f . • Construction is not generally uniform :( • A new mechanism for obtaining parallel algorithms!  ... 
doi:10.1145/2090236.2090244 dblp:conf/innovations/IshaiKP12 fatcat:6x5scnpiq5ch7dg4gfq65aq6oq

Parallel Random Block-Coordinate Forward-Backward Algorithm: A Unified Convergence Analysis [article]

Saverio Salzo, Silvia Villa
2020 arXiv   pre-print
We study the block-coordinate forward-backward algorithm in which the blocks are updated in a random and possibly parallel manner, according to arbitrary probabilities.  ...  The algorithm allows different stepsizes along the block-coordinates to fully exploit the smoothness properties of the objective function.  ...  We compare Algorithm 1.1 with δ = 1 and several choices of δ > 1. Figure 2 considers different scenarios for the degree of separability η of f .  ... 
arXiv:1906.07392v4 fatcat:cfjmtfkxw5gzzflbhnusluxere

Parallel Algorithms for Generating Random Networks with Given Degree Sequences [article]

Maksudul Alam, Maleq Khan
2015 arXiv   pre-print
Generating random networks with any given degree distribution consisting of billions of nodes and edges or more has become a necessity, which requires efficient and parallel algorithms.  ...  We present an MPI-based distributed memory parallel algorithm for generating massive random networks using CL model, which takes O(m+n/P+P) time with high probability and O(n) space per processor, where  ...  The primary objective of the parallel algorithm is to generate massive random networks.  ... 
arXiv:1406.1215v3 fatcat:emgxfjdhineilawggolmbwhtvi

Implementing Randomized Matrix Algorithms in Parallel and Distributed Environments [article]

Jiyan Yang, Xiangrui Meng, Michael W. Mahoney
2015 arXiv   pre-print
Here, we review recent work on developing and implementing randomized matrix algorithms in large-scale parallel and distributed environments.  ...  Our main focus is on the underlying theory and practical implementation of random projection and random sampling algorithms for very large very overdetermined (i.e., overconstrained) ℓ_1 and ℓ_2 regression  ...  In this paper, we will provide an overview of recent work in Randomized Numerical Linear Algebra (RandNLA) on implementing randomized matrix algorithms in large-scale parallel and distributed computational  ... 
arXiv:1502.03032v2 fatcat:wfqe3pl3rzgvjlrqwpijtkpik4

RECYCLING RANDOM BITS IN PARALLEL

KATALIN FRIEDL, SHI-CHUN TSAI
1996 Parallel Algorithms and Applications  
This can be considered as a parallel version of [a] -recycling random bits by doing a random walk on an expander.  ...  In the parallel version the integers involved are much shorter, and different segments of the pseudo-random bits are generated independently in parallel.  ...  Each r-bit pseudo-random string is generated in parallel. It is not hard to see that we use O(r + tk) random bits in the above algorithm.  ... 
doi:10.1080/10637199608915545 fatcat:nkejqt36eve4rjzaqtwh6sosza

Parallel Implementation of Fast Randomized Algorithms for Low Rank Matrix Decomposition

Andrew Lucas, Mark Stalzer, John Feo
2014 Parallel Processing Letters  
We analyze the parallel performance of randomized interpolative decomposition by decomposing low rank complex-valued Gaussian random matrices up to 64 GB.  ...  We chose a Cray XMT supercomputer as it provides an almost ideal PRAM model permitting quick investigation of parallel algorithms without obfuscation from hardware idiosyncrasies.  ...  Acknowledgements The authors would like to thank the staff at CACR for help with initial benchmarking of the algorithm and for advice on optimization, as well as the staff at PNNL for assistance and usage  ... 
doi:10.1142/s0129626414500042 fatcat:52hgsjbqmzhnvbxekwlzox3zi4

Parallel randomized load balancing

Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Rasmussen
1998 Random structures & algorithms (Print)  
This limits its applicability in parallel and distributed settings, a major drawback when compared to the simple randomized approach.  ...  (Following [2], we shall hereafter refer to their algorithm as greedy.)  ...  We thank Claire Kenyon and Orli Waarts for suggesting the random graph model, pointing us to [1] , and several helpful related ideas.  ... 
doi:10.1002/(sici)1098-2418(199809)13:2<159::aid-rsa3>3.3.co;2-z fatcat:almja2jawzhexipf6cezggghru

On parallel implementation of a discrete optimization random search algorithm [article]

Nikolai K. Krivulin, Dennis Guster, Charles Hall
2013 arXiv   pre-print
We show how the algorithm can be implemented on parallel computer systems.  ...  A random search algorithm intended to solve discrete optimization problems is considered. We outline the main components of the algorithm, and then describe it in more detail.  ...  In this paper, we present a BPB random search algorithm together with its parallel implementation.  ... 
arXiv:1212.6053v2 fatcat:j7s556nx7zc5np37cseqbgci4e
« Previous Showing results 1 — 15 out of 593,734 results