Asynchronous Adaptive Task Allocation
暂无分享,去创建一个
[1] Hagit Attiya,et al. Efficient adaptive collect using randomization , 2004, Distributed Computing.
[2] Prabhakar Ragde,et al. Parallel Algorithms with Processor Failures and Delays , 1996, J. Algorithms.
[3] Dan Alistarh,et al. How to Allocate Tasks Asynchronously , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[4] Chryssis Georgiou,et al. Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity , 2007 .
[5] Dariusz R. Kowalski,et al. Cooperative asynchronous update of shared memory , 2005, STOC '05.
[6] Hagit Attiya,et al. An adaptive collect algorithm with applications , 2002, Distributed Computing.
[7] Moti Yung,et al. Time-optimal message-efficient work performance in the presence of faults , 1994, PODC '94.
[8] Alexander A. Shvartsman,et al. Efficient parallel algorithms can be made robust , 1989, PODC '89.
[9] Alexander A. Shvartsman,et al. Fault-Tolerant Parallel Computation , 1997 .
[10] Dariusz R. Kowalski,et al. Writing-all deterministically and optimally using a nontrivial number of asynchronous processors , 2008, ACM Trans. Algorithms.
[11] Dan Alistarh,et al. Dynamic Task Allocation in Asynchronous Shared Memory , 2014, SODA.
[12] Aggelos Kiayias,et al. The Strong At-Most-Once Problem , 2012, DISC.
[13] Chryssis Georgiou,et al. Cooperative Task-Oriented Computing: Algorithms and Complexity , 2011, Synthesis Lectures on Distributed Computing Theory.
[14] Nancy A. Lynch,et al. An introduction to input/output automata , 1989 .
[15] Aggelos Kiayias,et al. Solving the at-most-once problem with nearly optimal effectiveness , 2011, PODC '11.
[16] Joseph Y. Halpern,et al. Performing work efficiently in the presence of faults , 1992, PODC '92.
[17] Aggelos Kiayias,et al. At-most-once semantics in asynchronous shared memory , 2009, SPAA '09.
[18] Paul G. Spirakis,et al. Efficient robust parallel computations , 2018, STOC '90.
[19] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[20] Richard J. Anderson,et al. Algorithms for the Certified Write-All Problem , 1997, SIAM J. Comput..
[21] Grzegorz Malewicz,et al. A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors , 2005, SIAM J. Comput..
[22] Yehuda Afek,et al. Long-lived adaptive collect with applications , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[23] Charles U. Martel,et al. On the Complexity of Certified Write-All Algorithms , 1994, J. Algorithms.