Tree topologies for causal message delivery

Blessing, Sebastian; Clebsch, Sylvan; Drossopoulou, Sophia

doi:10.1145/3141834.3141835

Cited by 11 publications

(10 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Blessing et al [8] propose implementing causal ordering by arranging participating nodes in a tree topology. While the approach further relies on FIFO ordering between each pair of nodes, it does not require additional meta data.…”

Section: Related Workmentioning

confidence: 99%

“…Moreover, message sizes increase further to determine causal dependencies for transitive message passing with more than one intermediate node [2]. A third alternative is a fixed routing topology such as a ring or a tree as discussed in the context of the Pony language [8]. This overloads routing and leads to a worst cases where messages are routed from one leaf through the root to another leaf, thus introducing latency.…”

Section: Reliable Message Orderingmentioning

confidence: 99%

“…All benchmarks were performed for payload sizes from 128 to 8,192 bytes in increasing powers of two. All graphs show the mean real time in microseconds over ten runs as a function of the payload size and plot the standard deviation as error bars.…”

Section: The Costs Of Layers In Cafmentioning

confidence: 99%

See 2 more Smart Citations

A configurable transport layer for CAF

Hiesgen

Charousset

Schmidt

2018

Proceedings of the 8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control

View full text Add to dashboard Cite

The message-driven nature of actors lays a foundation for developing scalable and distributed software. While the actor itself has been thoroughly modeled, the message passing layer lacks a common definition. Properties and guarantees of message exchange often shift with implementations and contexts. This adds complexity to the development process, limits portability, and removes transparency from distributed actor systems.In this work, we examine actor communication, focusing on the implementation and runtime costs of reliable and ordered delivery. Both guarantees are often based on TCP for remote messaging, which mixes network transport with the semantics of messaging. However, the choice of transport may follow different constraints and is often governed by deployment. As a first step towards rearchitecting actor-to-actor communication, we decouple the messaging guarantees from the transport protocol. We validate our approach by redesigning the network stack of the C++ Actor Framework (CAF) so that it allows to combine an arbitrary transport protocol with additional functions for remote messaging. An evaluation quantifies the cost of composability and the impact of individual layers on the entire stack.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Reliable Message Orderingmentioning

confidence: 99%

See 1 more Smart Citation

A configurable transport layer for CAF

Hiesgen

Charousset

Schmidt

2018

Proceedings of the 8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control

View full text Add to dashboard Cite

show abstract

“…Over the years, several attempts have been proposed to reduce the amount of information necessary to ensure causal order delivery either by modifying the underlying topology [3,10] or using different types of logical clocks [28, ?, 32].…”

Section: Related Workmentioning

confidence: 99%

“…Hence, a node uses just the information about the receptions from those nodes to respect causal delivery and to timestamp its own messages. Blessing et al [10] go further by eliminating the use of meta-data carried by the messages. They exploit application-defined causal order [6] in order to organize the actors (processes) of an application into a tree topology that guarantees causal order delivery.…”

Section: Related Workmentioning

confidence: 99%

A Communication-Efficient Causal Broadcast Protocol

Araujo

Arantes

Júnior

et al. 2018

Proceedings of the 47th International Conference on Parallel Processing

View full text Add to dashboard Cite

A causal broadcast ensures that messages are delivered to all nodes (processes) preserving causal relation of the messages. In this paper, we propose a causal broadcast protocol for distributed systems whose nodes are logically organized in a virtual hypercube-like topology called VCube. Messages are broadcast by dynamically building spanning trees rooted in the message's source node. By using multiple trees, the contention bottleneck problem of a single root spanning tree approach is avoided. Furthermore, different trees can intersect at some node. Hence, by taking advantage of both the out-of-order reception of causally related messages at a node and these paths intersections, a node can delay to one or more of its children in the tree, the forwarding of the messages whose some causal dependencies it knows that the children in question can not satisfy yet. Such a delay does not induce any overhead. Experimental evaluation conducted on top of PeerSim simulator confirms the communication effectiveness of our causal broadcast protocol in terms of latency and message traffic reduction.

show abstract

Concurrent garbage collection in the actor model

Plyukhin

Agha

2018

Proceedings of the 8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control

View full text Add to dashboard Cite

Tree topologies for causal message delivery

Cited by 11 publications

References 21 publications

A configurable transport layer for CAF

A configurable transport layer for CAF

A Communication-Efficient Causal Broadcast Protocol

Concurrent garbage collection in the actor model

Contact Info

Product

Resources

About