On the Complexity of Reachability Properties in Serverless Function Scheduling
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917727901319168 |
|---|---|
| author | De Palma, Giuseppe Giallorenzo, Saverio Mauro, Jacopo Trentin, Matteo Zavattaro, Gianluigi |
| author_facet | De Palma, Giuseppe Giallorenzo, Saverio Mauro, Jacopo Trentin, Matteo Zavattaro, Gianluigi |
| contents | Functions-as-a-Service (FaaS) is a Serverless Cloud paradigm where a platform manages the execution scheduling (e.g., resource allocation, runtime environments) of stateless functions. Recent developments demonstrate the benefits of using domain-specific languages to express per-function scheduling policies, e.g., enforcing the allocation of functions on nodes that enjoy low data-access latencies thanks to proximity and connection pooling. We present aAPP, an affinity-aware extension of a platform-agnostic function scheduling language. We formalise its scheduling semantics and then study the complexity of statically checking reachability properties, e.g., useful to verify that trusted and untrusted functions cannot be co-located. Analysing different fragments of aAPP, we show that checking reachability of policies without affinity has linear complexity, while affinity makes the problem PSpace. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_14159 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Complexity of Reachability Properties in Serverless Function Scheduling De Palma, Giuseppe Giallorenzo, Saverio Mauro, Jacopo Trentin, Matteo Zavattaro, Gianluigi Distributed, Parallel, and Cluster Computing Functions-as-a-Service (FaaS) is a Serverless Cloud paradigm where a platform manages the execution scheduling (e.g., resource allocation, runtime environments) of stateless functions. Recent developments demonstrate the benefits of using domain-specific languages to express per-function scheduling policies, e.g., enforcing the allocation of functions on nodes that enjoy low data-access latencies thanks to proximity and connection pooling. We present aAPP, an affinity-aware extension of a platform-agnostic function scheduling language. We formalise its scheduling semantics and then study the complexity of statically checking reachability properties, e.g., useful to verify that trusted and untrusted functions cannot be co-located. Analysing different fragments of aAPP, we show that checking reachability of policies without affinity has linear complexity, while affinity makes the problem PSpace. |
| title | On the Complexity of Reachability Properties in Serverless Function Scheduling |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2407.14159 |