A Core Calculus for Static Latency Tracking with Placement Types
This addresses efficiency problems for developers of geo-distributed applications, but it is incremental as it outlines initial steps and future work.
The paper tackles the challenge of high latency communication in geo-distributed applications by proposing a language design that makes latency explicit and extracts type-level bounds for runtime latency, presenting a core calculus for provably correct latency bounds.
Developing efficient geo-distributed applications is challenging as programmers can easily introduce computations that entail high latency communication. We propose a language design which makes latency explicit and extracts type-level bounds for a computation's runtime latency. We present our initial steps with a core calculus that enables extracting provably correct latency bounds and outline future work.