Sorting, Searching, and Simulation in the MapReduce Framework

DOI10.1007/978-3-642-25591-5_39zbMath1350.68085arXiv1101.1902OpenAlexW1503698146MaRDI QIDQ3104632

Qin Zhang, Nodari Sitchinava, Michael T. Goodrich

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.1902

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Related Items (17)

Equivalence classes and conditional hardness in massively parallel computations ⋮ Graph Connectivity in Log Steps Using Label Propagation ⋮ The role of concurrency in an evolutionary view of programming abstractions ⋮ Deterministic Massively Parallel Connectivity ⋮ When distributed computation is communication expensive ⋮ Component stability in low-space massively parallel computation ⋮ Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory ⋮ Round Compression for Parallel Matching Algorithms ⋮ Communication complexity of approximate maximum matching in the message-passing model ⋮ Brief Announcement: MapReduce Algorithms for Massive Trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Clique Counting in MapReduce ⋮ Calculi for symmetric queries ⋮ Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC ⋮ Distributed algorithms for matching in hypergraphs

This page was built for publication: Sorting, Searching, and Simulation in the MapReduce Framework