Affiliation:
1. University of St. Gallen, St. Gallen, Switzerland
Abstract
Several distributed programming language solutions have been proposed to reason about the placement of data, computations, and peers interaction. Such solutions include, among the others, multitier programming, choreographic programming and various approaches based on behavioral types. These methods statically ensure safety properties thanks to a complete knowledge about placement of data and computation at compile time. In distributed systems, however, dynamic placement of computation and data is crucial to enable performance optimizations, e.g., driven by data locality or in presence of a number of other constraints such as security and compliance regarding data storage location. Unfortunately, in existing programming languages, dynamic placement conflicts with static reasoning about distributed programs: the flexibility required by dynamic placement hinders statically tracking the location of data and computation.
In this paper we present Dyno, a programming language that enables static reasoning about dynamic placement. Dyno features a type system where values are explicitly placed, but in contrast to existing approaches, placed values are also first class, ensuring that they can be passed around and referred to from other locations. Building on top of this mechanism, we provide a novel interpretation of dynamic placement as unions of placement types. We formalize type soundness, placement correctness (as part of type soundness) and architecture conformance. In case studies and benchmarks, our evaluation shows that Dyno enables static reasoning about programs even in presence of dynamic placement, ensuring type safety and placement correctness of programs at negligible performance cost. We reimplement an Android app with ∼ 7 K LOC in Dyno, find a bug in the existing implementation, and show that the app's approach is representative of a common way to implement dynamic placement found in over 100 apps in a large open-source app store.
Funder
Swiss National Science Foundation
Basic Research Fund of the University of St. Gallen
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference58 articles.
1. Khalil Amiri , David Petrou , Gregory R. Ganger , and Garth A. Gibson . 2000. Dynamic Function Placement for Data-Intensive Cluster Computing . In Proceedings of the 2000 USENIX Annual Technical Conference (USENIX ATC ’00) . USENIX Association, San Diego, CA. 16 pages. https://www.usenix.org/conference/ 2000 -usenix-annual-technical-conference/dynamic-function-placement-data-intensive-cluster Khalil Amiri, David Petrou, Gregory R. Ganger, and Garth A. Gibson. 2000. Dynamic Function Placement for Data-Intensive Cluster Computing. In Proceedings of the 2000 USENIX Annual Technical Conference (USENIX ATC ’00). USENIX Association, San Diego, CA. 16 pages. https://www.usenix.org/conference/2000-usenix-annual-technical-conference/dynamic-function-placement-data-intensive-cluster
2. AntennaPod Developers. 2011. AntennaPod – The Open Podcast Player. https://antennapod.org Accessed: 2023-07-30 Commit: 88289d0 AntennaPod Developers. 2011. AntennaPod – The Open Podcast Player. https://antennapod.org Accessed: 2023-07-30 Commit: 88289d0
3. A Scored Semantic Cache Replacement Strategy for Mobile Cloud Database Systems
4. A Higher-Order Calculus of Computational Fields