Realizing Consistent Event Ordering in Distributed Shared Memory Systems

A large number of tasks in distributed systems can be traced down to the fundamental problem of attaining a consistent global view on a distributed computation. Based on our previous theoretical work concerning consistent event ordering in systems featuring both message passing and distributed shared memory facilities, in the paper at hand we discuss the more practical issues, solutions, and results presenting themselves during the process of actually realizing and implementing the construction of consistent global views on such systems