A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Round Compression for Parallel Matching Algorithms
[article]
2018
arXiv
pre-print
Preserved Fulltext
Other Versions
The fundamental question that arises in this context is though: can we leverage this additional power to obtain even faster parallel algorithms? ...
In fact, our improvement here is almost exponential: we are able to deliver a (2+ϵ)-approximation to maximum matching, for any fixed constant ϵ>0, in O(( n)^2) rounds. ...
After that, GlobalAlg computes a matching in G[H ∪ F ] by calling MatchHeavy (see Algorithm 2). In the first step, MatchHeavy assigns to every v ∈ F a random neighbor v ⋆ in H. ...
arXiv:1707.03478v2
fatcat:tsoixglzmjbdxdh47vu7okqsnm
Round compression for parallel matching algorithms
2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The fundamental question that arises in this context is though: can we leverage this additional power to obtain even faster parallel algorithms? ...
In particular, compared to the classic distributed algorithms or PRAM models, these frameworks allow for much more local computation. ...
We also thank anonymous reviewers for their valuable feedback. ...
doi:10.1145/3188745.3188764
dblp:conf/stoc/CzumajLMMOS18
fatcat:h5545lg36nd63fpbcluxfuflf4
Massively-Parallel Lossless Data Decompression
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Although research has concentrated on efficient compression, fast decompression is critical for analytics queries that repeatedly read compressed data. ...
Today's exponentially increasing data volumes and the high cost of storage make compression essential for the Big Data industry. ...
there was no match for 'c'. (2) Back-reference is emitted for a match on 'aac'. parallel CPU libraries. ...
arXiv:1606.00519v1
fatcat:ywu6e6zrbrcvrdecrgnn7acd7a
Dictionary Compression on the Pram
1997
Parallel Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Parallel algorithms for lossless data compression via dictionary compression using optimal, longest fragment rst (LFF), and greedy parsing strategies are described. ...
Under the same model, we give an algorithm for LFF compression which runs in O(log 2 n) time with O(n= log n) processors where it is assumed that the maximum dictionary entry is of length O(log n). ...
Using this method, the greedy parsing for an unrestricted sliding window can be computed in time O(log n) using O(n 2 log M = log n) processors by noting the following. ...
doi:10.1142/s0129626497000310
fatcat:5h7dupo4bbdv5a6r25xxhsd25u
Almost-optimal fully LZW-compressed pattern matching
1999
Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present rst, almost optimal, string matching algorithms for LZW-compressed strings running in: 1. ...
Techniques used in our paper can beused in design of e cient algorithms for a wide range of the most typical string problems, in the compressed LZW setting, including: computing a period of a word, nding ...
The second algorithm is parallel and it combines known parallel matching techniques with e cient methods used for matching compressed strings. ...
doi:10.1109/dcc.1999.755681
dblp:conf/dcc/GasieniecR99
fatcat:azngwlxr5vg75oux4o6buooirm
Page 4413 of Mathematical Reviews Vol. , Issue 2002F
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Discrete Algorithms 1 (2000), no. 1, 257-269.
This paper proposes a linear time algorithm (linear in the com- pressed text length) for pattern matching in a compressed text. ...
Setsuo (J-K YUS-I; Fukuoka)
Pattern matching in text compressed by using antidictionaries. ...
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The result is obtained by repeatedly compressing several rounds of a natural peeling algorithm to a logarithmically smaller number of MPC rounds. ...
The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark. ...
Round Compression for Low-Degree Graphs In this section, we introduce a simple technique for simulating a small number of rounds of a distributed algorithm in MPC. ...
arXiv:1807.08745v1
fatcat:rsyeiu2w7ze3lbcrh6tdccayty
Oblivious Parallel Tight Compaction
2020
Conference on Information-Theoretic Cryptography
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We present an oblivious deterministic algorithm for tight compaction such that for input arrays of n balls requires O(n) total work and O(log n) depth. ...
Our algorithm is in the Exclusive-Read-Exclusive-Write Parallel-RAM model (i.e., EREW PRAM, the most restrictive PRAM model), and importantly we achieve asymptotical optimality in both total work and depth ...
A straw-man implementation of ( 1 log c , 1 log )-compression is applying SlowMatch for t := log log n rounds, but given that SlowMatch takes O(log n) depth (Claim 18) to compute (B, B/4)-matching, the ...
doi:10.4230/lipics.itc.2020.11
dblp:conf/icits/AsharovKLPS20
fatcat:zjvcdb5j4bbhpl22urdhhpcrgi
Simple Round Compression for Parallel Vertex Cover
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The main approach in their work is a way of compressing O(n) rounds of a distributed algorithm for maximum matching into only O((n)^2) MPC rounds. ...
We obtain this result by modifying a previous parallel algorithm by Khanna and the author (SPAA 2017) for vertex cover that allowed for compressing O(n) rounds of a distributed algorithm into constant ...
I also thank Omri Weinstein and Qin Zhang for helpful discussions. ...
arXiv:1709.04599v1
fatcat:q3kyiuzginebhjvmzljmvkmeuy
Adaptive Massively Parallel Constant-round Tree Contraction
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Additionally it is also used as an algorithmic design technique for a large number of parallel graph algorithms. ...
Miller and Reif's FOCS'85 classic and fundamental tree contraction algorithm is a broadly applicable technique for the parallel solution of a large number of tree problems. ...
The power of this algorithm is its ability to implement Compress and Rake for n -tree-contractions in O(1/ 3 ) rounds. ...
arXiv:2111.01904v1
fatcat:mjwqdg3ppfdpnagl6rzaxd4pkq
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show that both MIS and MM admit O(√(α)·α + ^2 n) round algorithms using O(n^ϵ) space per machine for any constant ϵ∈ (0, 1) and using O(m) total space. ...
Therefore, for the wide range of sparse graphs with small arboricity---such as minor-free graphs, bounded-genus graphs or bounded treewidth graphs---we get an O(^2 n) round algorithm which exponentially ...
Acknowledgements The authors would like to thank Saeed Seddighin for useful discussions and for bringing up the question of whether matching can be solved in sublogarithmic rounds of low-memory MPC. ...
arXiv:1807.06701v3
fatcat:pytfrwpus5gbnazt6qijy7zyg4
Adaptive parallel compressed event matching
2014
2014 IEEE 30th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We show that the adaptive parallel compressed event matching algorithm can sustain an event rate of up to 233,863 events/second while state-of-the-art sequential event matching algorithms sustains only ...
We achieve these event processing requirements by exploiting the shift towards multi-core architectures by proposing novel adaptive parallel compressed event matching algorithm (A-PCM) and online event ...
Therefore, we proposed an adaptive parallel compressed matching algorithm (A-PCM) that utilizes both the parallel compressed matching algorithm and the standard parallel matching algorithm. 8 Our A-PCM ...
doi:10.1109/icde.2014.6816665
dblp:conf/icde/SadoghiJ14
fatcat:efrmlieiuvdwxflt4ebskg3jxq
Lightweight and High-Performance Data Protection for Edge Network Security
2022
Wireless Communications and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Finally, pipeline technology and critical path optimization on FPGA are used to parallelize the underlying encryption algorithm and data compression algorithm to achieve high-speed memory communication ...
network latency, in this paper, we combine an advanced reduced instruction set computing machine (ARM) and a field programmable gate array (FPGA) to propose a lightweight ARM-FPGA computing architecture for ...
algorithm that is used for storage-intensive, matching-intensive, and communication-intensive tasks. ...
doi:10.1155/2022/8458314
doaj:908d40ce5dc84e9390dd5407c06bb6f3
fatcat:4l2zndsmy5bzzanvel2aiaqgge
Massively Parallel Algorithms for String Matching with Wildcards
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
MPC is a recent framework for parallel computation of big data, which is designed to capture the MapReduce-like algorithms. ...
String matching with don't cares could be solved by fast convolutions, and we give a constant round MPC algorithm for which by utilizing FFT in a constant number of MPC rounds. - '+' wildcard: '+' wildcard ...
[1] However, the main focus of this paper is to design massively parallel algorithms for the pattern matching problem. ...
arXiv:1910.11829v3
fatcat:h6lrqhb2hze3ppe6pjnzgoffrq
Constant-Time Randomized Parallel String Matching
1997
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We use this algorithm to obtain the following results. All algorithms below are optimal parallel algorithms on a CRCW PRAM. 1. ...
A simple string-matching algorithm that has constant time with high probability for random input. 4. ...
We thank Noga Alon and Yossi Matias for helpful suggestions. ...
doi:10.1137/s009753979528007x
fatcat:tlj6h2fsabb4vawaubk2p74zxy
« Previous
Showing results 1 — 15 out of 29,018 results