Actors and publish/subscribe: an efficient approach to scalable distribution in data centers

Authors:
Dominik Charousset;Thomas C. Schmidt;Matthias Wählisch
Affiliations:
HAW Hamburg, Hamburg, Germany;HAW Hamburg, Hamburg, Germany;FU Berlin, Berlin, Germany
Venue:
Proceedings of the 2012 ACM conference on CoNEXT student workshop
Year:
2012

Citing 3
Cited 0

A universal modular ACTOR formalism for artificial intelligence

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Benchmarking cloud serving systems with YCSB

Proceedings of the 1st ACM symposium on Cloud computing
HyperDex: a distributed, searchable key-value store

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data center applications are required to be fault-tolerant and self-healing, and at the same time to scale dynamically with the number of available hardware resources. Highly efficient task distribution is crucial for such services that require low latency and high availability. This paper introduces pub/sub actors as a paradigm to build distributed data center applications without a single point of failure. Our approach does not actively distribute tasks, but uses group communication and an orchestration protocol. Requests are received by a group of potential servers, but only processed by one of them. We present a key-value store using libcppa as a case study of promising performance.