Search Results - key work parallel/distributed algorithms*
-
1
An adaptive distributed resampling algorithm with non-proportional allocation
ISSN: 1520-6149Published: IEEE 01.05.2014Published in Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) (01.05.2014)“…The distributed resampling algorithm with non-proportional allocation (RNA) [1] is key to implementing particle filtering applications on parallel computer systems…”
Get full text
Conference Proceeding -
2
Parallel breadth-first search on distributed memory systems
ISBN: 145030771X, 9781450307710ISSN: 2167-4329Published: New York, NY, USA ACM 12.11.2011Published in 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) (12.11.2011)“… In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms…”
Get full text
Conference Proceeding -
3
Efficient Anytime Anywhere Algorithms for Closeness Centrality in Large and Dynamic Graphs
Published: IEEE 01.05.2016Published in 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (01.05.2016)“… In our previous work, we presented an overarching anytime anywhere framework for designing parallel and distributed social network analysis algorithms that are scalable to large network sizes and can handle dynamism…”
Get full text
Conference Proceeding -
4
Commutative Algorithms Approximate the LLL-distribution
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 08.06.2019Published in arXiv.org (08.06.2019)“… to: derive deterministic, parallel and distributed algorithms for the LLL, to estimate the entropy of the output distribution, to partially avoid bad events, to deal with super-polynomially many bad…”
Get full text
Paper -
5
Parallel Breadth-First Search on Distributed Memory Systems
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 14.10.2011Published in arXiv.org (14.10.2011)“… In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms…”
Get full text
Paper -
6
Adaptive Distributed Resampling Algorithm with Non-Proportional Allocation
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 26.10.2013Published in arXiv.org (26.10.2013)“…The distributed resampling algorithm with proportional allocation (RNA) is key to implementing particle filtering applications on parallel computer systems…”
Get full text
Paper -
7
Skew and scalability of parallel joins on multicomputers
ISBN: 9798208248300Published: ProQuest Dissertations & Theses 01.01.1992“…When data are uniformly distributed, parallel join algorithms scale up well. However, scalability is curtailed by data skew--non-uniform distribution of join key values and tuples…”
Get full text
Dissertation

