Algorithmic aspects of parallel data processing
From MaRDI portal
Publication:4639877
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Reliability, testing and fault tolerance of networks and computer systems (68M15) Data structures (68P05) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(18)- Cloud data processing using granular based weighted concept lattice and Hamming distance
- On the computational complexity of MapReduce
- A parallel computing framework for big data
- Reasoning about data-parallel array assignment
- Strongly minimal MapReduce algorithms: a terasort case study
- A survey on the distributed computing stack
- A data-parallel formulation for divide and conquer algorithms
- Sorting algorithm analysis of distributed data based on Map/Reduce
- Communication steps for parallel query processing
- WONDER: weighted one-shot distributed ridge regression in high dimensions
- Efficient massively parallel methods for dynamic programming
- Output-optimal massively parallel algorithms for similarity joins
- Counting Triangles under Updates in Worst-Case Optimal Time
- scientific article; zbMATH DE number 7566062 (Why is no real title available?)
- scientific article; zbMATH DE number 5591731 (Why is no real title available?)
- Distributed processing of very large datasets with DataCutter
- Work-efficient query evaluation in constant time with PRAMs
- Security and privacy aspects in MapReduce on clouds: a survey
This page was built for publication: Algorithmic aspects of parallel data processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639877)