Passing Messages while Sharing Memory

We introduce a new distributed computing model called m&m that allows processes to both pass messages and share memory. Motivated by recent hardware trends, we find that this model improves the power of the pure message-passing and shared-memory models. As we demonstrate by example with two fundamental problems-consensus and eventual leader election-the added power leads to new algorithms that are more robust against failures and asynchrony. Our consensus algorithm combines the superior scalability of message passing with the higher fault tolerance of shared memory, while our leader election algorithms reduce the system synchrony needed for correctness. These results point to a wide new space for future exploration of other problems, techniques, and benefits.


Published in:
Podc'18: Proceedings Of The 2018 Acm Symposium On Principles Of Distributed Computing, 51-60
Presented at:
37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Egham, ENGLAND, Jul 23-27, 2018
Year:
Jan 01 2018
Publisher:
New York, ASSOC COMPUTING MACHINERY
ISBN:
978-1-4503-5795-1
Keywords:




 Record created 2019-06-18, last modified 2019-08-12


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)