How to avoid the cost of causal communication in large-scale systems

  • Authors:
  • Luis Rodrigues;Paulo Veríssimo

  • Affiliations:
  • Technical University of Lisboa - IST - INESC;Technical University of Lisboa - IST - INESC

  • Venue:
  • EW 6 Proceedings of the 6th workshop on ACM SIGOPS European workshop: Matching operating systems to application needs
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a distributed system, consisting of a collection of processes that communicate by exchanging messages, the order in which messages are delivered to processes is of major relevance to the application design. With the aim of simplifying the design of distributed applications [14,4,11], several algorithms and protocols have been proposed to provide causal order delivery [4,6,9,7,10].Despite its advantages, the use of causal communication has been somewhat limited by the overhead incurred by existing implementations. We can cite some disadvantages of existing causal communication services [5]: (i) potential large size of "history" information that needs to be stored and exchanged to maintain causality; (ii) little user control over message piggybacking policies; (iii) reliable communication is mandatory to avoid blocking of message delivery.In the Navigators group at INESC, we are currently studying mechanisms to improve the efficiency of multicast communication over (geographically) large-scale networks. This research is complementary to the joint effort between U. of Bologna and EPFL that aims to provide reliable (virtually synchronous) communication for large scale-systems [2].We claim that, to allow applications to take advantage of multicast communication, new services (based on weaker assumptions about the system) must be provided. To support this claim, this paper proposes and describes a new quality of service, referred to as transparent causal messages.