Continuation Complexity: A Callback Hell for Distributed Systems

DOI10.1007/978-3-319-27308-2_24MaRDI QIDQ5858633zbMATH OpenOpenAlexFDO

Authors Edgar Zamora-Gómez, Pedro García López, Rubén Mondéjar

Publication date 14 April 2021

Published in Euro-Par 2015: Parallel Processing Workshops (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27308-2_24

zbMATH Keywords

actor modelcontinuation complexityobject actors

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• The Complexity of Distributed Concurrency Control
• scientific article; zbMATH DE number 3870604
• scientific article; zbMATH DE number 3888905
• scientific article; zbMATH DE number 3900138
• The complexity of reachability in distributed communicating processes
• The concurrency hierarchy, and algorithms for unbounded concurrency
• Continuation Semantics for Asynchronous Concurrency
• Complexity of distributed commit protocols
• The Complexity of Reliable Concurrency Control

This page was built for publication: Continuation Complexity: A Callback Hell for Distributed Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5858633)