Author:
Goodrich Michael T.,Sitchinava Nodari,Zhang Qin
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Alon, N., Megiddo, N.: Parallel linear programming in fixed dimension almost surely in constant time. J. ACM 41(2), 422–434 (1994)
2. Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107–113 (2008)
3. Dean, J., Ghemawat, S.: MapReduce: a flexible data processing tool. Commun. ACM 53(1), 72–77 (2010)
4. DeWitt, D.J., Stonebraker, M.: MapReduce: A major step backwards. Database Column (2008),
http://databasecolumn.vertica.com/database-innovation/mapreduce-a-major-step-backwards/
5. Eisenstat, S.C.: O(log*
n) algorithms on a Sum-CRCW PRAM. Computing 79(1), 93–97 (2007)
Cited by
112 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Deterministic Massively Parallel Connectivity;SIAM Journal on Computing;2023-10-27
2. Exponentially Faster Massively Parallel Maximal Matching;Journal of the ACM;2023-10-11
3. Efficient deterministic MapReduce algorithms for parallelizable problems;Journal of Parallel and Distributed Computing;2023-07
4. Fast Dynamic Programming in Trees in the MPC Model;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
5. Brief Announcement: Regular and Dyck Languages in MPC;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17