Functionals in the Clouds: An abstract architecture of serverless Cloud-Native Apps

• URL: http://arxiv.org/abs/2105.10362v6
• Date: Tue, 22 Jul 2025 18:48:48 GMT
• Title: Functionals in the Clouds: An abstract architecture of serverless Cloud-Native Apps
• Authors: Stanislaw Ambroszkiewicz, Waldemar Bartyna, Stanislaw Bylka,
• Abstract summary: Cloud Native Application CNApp (as a distributed system) is a collection of independent components (micro-services) interacting via communication protocols.<n>Our contribution is strictly theoretical and relies on the abstract architecture of CNApp that is closely related to the calculus of functionals and relations.<n>The proposed theoretical approach is an attempt to implement the original idea of programming at the function level postulated by John Backus 1978 citeBackus; the idea that is still waiting to be implemented as a non-von Neumann programming language.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Cloud Native Application CNApp (as a distributed system) is a collection of independent components (micro-services) interacting via communication protocols. This gives rise to present an abstract architecture of CNApp as dynamically re-configurable acyclic directed multi graph where vertices are microservices, and edges are the protocols. Generic mechanisms for such reconfigurations evidently correspond to higher-level functions (functionals). This implies also internal abstract architecture of microservice as a collection of event-triggered serverless functions (including functions implementing the protocols) that are composed into event-dependent data-flow graphs, and dynamically reconfigured at the runtime. Again, generic mechanisms for such compositions and reconfigurations correspond to functionals and higher order type theory like Coq https://coq.inria.fr/about-coq. Our contribution is strictly theoretical and relies on the abstract architecture of CNApp that is closely related to the calculus of functionals and relations. The proposed theoretical approach is an attempt to implement the original idea of programming at the function level postulated by John Backus 1978 \cite{Backus}; the idea that is still waiting to be implemented as a non-von Neumann programming language.

Related papers

• CARD: Towards Conditional Design of Multi-agent Topological Structures [83.18278008173746]
  CARD (Conditional Agentic Graph Designer) is a conditional graph-generation framework that instantiates AMACP, a protocol for adaptive multi-agent communication.<n> CARD produces communication structures that are both effective and resilient to shifts in model capability or resource availability.
  arXiv  Detail & Related papers  (2026-03-01T13:02:36Z)
• A Quantum Internet Protocol Suite Beyond Layering [4.918712889079032]
  This paper proposes a quantum-native organizational principle based on dynamic composition.<n>It replaces static layering with a distributed orchestration fabric driven by the node local state and in-band control.
  arXiv  Detail & Related papers  (2026-02-23T16:03:30Z)
• Monadic Context Engineering [59.95390010097654]
  This paper introduces Monadic Context Engineering (MCE) to provide a formal foundation for agent design.<n>We demonstrate how Monads enable robust composition, how Applicatives provide a principled structure for parallel execution, and crucially, how Monad Transformers allow for the systematic composition of these capabilities.<n>This layered approach enables developers to construct complex, resilient, and efficient AI agents from simple, independently verifiable components.
  arXiv  Detail & Related papers  (2025-12-27T01:52:06Z)
• QuantumSavory: Write Symbolically, Run on Any Backend -- A Unified Simulation Toolkit for Quantum Computing and Networking [0.9009968922973344]
  We present QuantumSavory, an open-source toolkit built to make end-to-end studies practical.<n>States, operations, measurements, and protocol logic are expressed in a backend-agnostic symbolic language.<n>New custom backends can be added via a small, well-defined interface.<n>QuantumSavory ships reusable libraries of standard states, circuits, and protocol building blocks with consistent interfaces.
  arXiv  Detail & Related papers  (2025-12-18T16:48:49Z)
• Object as a Service: Simplifying Cloud-Native Development through Serverless Object Abstraction [1.7416288134936873]
  We propose a new paradigm, known as Object as a Service (O) that encapsulates application data and functions into the cloud object abstraction. O relieves developers from resource and data management burden while offering built-in optimization features. We develop a platform named Oparaca that offers state abstraction for structured and unstructured data with consistency and fault-tolerant guarantees.
  arXiv  Detail & Related papers  (2024-08-09T06:55:00Z)
• Scalable Graph Compressed Convolutions [68.85227170390864]
  We propose a differentiable method that applies permutations to calibrate input graphs for Euclidean convolution. Based on the graph calibration, we propose the Compressed Convolution Network (CoCN) for hierarchical graph representation learning.
  arXiv  Detail & Related papers  (2024-07-26T03:14:13Z)
• kube-volttron: Rearchitecting the VOLTTRON Building Energy Management System for Cloud Native Deployment [0.3655021726150368]
  A key technology component in building energy management is the building energy management system. VOLTTRON is a legacy software platform which enables building energy management. This paper describes a proof-of-concept prototype to rearchitect VOLTTRON into a collection of suitable for deployment on the cloud native container orchestration platform.
  arXiv  Detail & Related papers  (2022-10-26T18:04:22Z)
• Object as a Service (OaaS): Enabling Object Abstraction in Serverless Clouds [2.0575037267955305]
  We propose a new abstraction level atop the function abstraction, known as Object as a Service (O) programming. O encapsulates the application data and function into the object abstraction and relieves the developers from resource and data management burdens. It also unlocks opportunities for built-in optimization features, such as software reusability, data locality, and caching.
  arXiv  Detail & Related papers  (2022-06-10T21:31:22Z)
• Federated Learning with Heterogeneous Architectures using Graph HyperNetworks [154.60662664160333]
  We propose a new FL framework that accommodates heterogeneous client architecture by adopting a graph hypernetwork for parameter sharing. Unlike existing solutions, our framework does not limit the clients to share the same architecture type, makes no use of external data and does not require clients to disclose their model architecture.
  arXiv  Detail & Related papers  (2022-01-20T21:36:25Z)
• Monolith to Microservices: Representing Application Software through Heterogeneous GNN [11.381828510219897]
  Microservice architectures are increasingly used as they advocate building an application through multiple smaller sized, loosely coupled functional services. This approach has made programming architecture as the natural choice for cloud based applications. But the challenges in the automated separation of functional modules for the already written monolith code slows down their migration task. We deduce this traditional application problem to a heterogeneous graph based clustering task. Our solution is the first of its kind to leverage heterogeneous graph neural network to learn representations of such diverse software entities.
  arXiv  Detail & Related papers  (2021-12-01T15:27:45Z)
• SPINE: Soft Piecewise Interpretable Neural Equations [0.0]
  Fully connected networks are ubiquitous but uninterpretable. This paper takes a novel approach to piecewise fits by using set operations on individual pieces(parts) It can find a variety of applications where fully connected layers must be replaced by interpretable layers.
  arXiv  Detail & Related papers  (2021-11-20T16:18:00Z)
• Graph Convolutional Embeddings for Recommender Systems [67.5973695167534]
  We propose a graph convolutional embedding layer for N-partite graphs that processes user-item-context interactions. More specifically, we define a graph convolutional embedding layer for N-partite graphs that processes user-item-context interactions.
  arXiv  Detail & Related papers  (2021-03-05T10:46:16Z)
• Modeling Multi-Label Action Dependencies for Temporal Action Localization [53.53490517832068]
  Real-world videos contain many complex actions with inherent relationships between action classes. We propose an attention-based architecture that models these action relationships for the task of temporal action localization in unoccurrence videos. We show improved performance over state-of-the-art methods on multi-label action localization benchmarks.
  arXiv  Detail & Related papers  (2021-03-04T13:37:28Z)
• Graph Neural Network to Dilute Outliers for Refactoring Monolith Application [12.43382998243009]
  We propose a novel method to adapt the recent advancements in graph networks in the context of code to better understand the software. Our solution is able to improve state-of-the-art performance compared to works from both software engineering and existing graph representation based techniques.
  arXiv  Detail & Related papers  (2021-02-07T16:00:27Z)
• Deep Parametric Continuous Convolutional Neural Networks [92.87547731907176]
  Parametric Continuous Convolution is a new learnable operator that operates over non-grid structured data. Our experiments show significant improvement over the state-of-the-art in point cloud segmentation of indoor and outdoor scenes.
  arXiv  Detail & Related papers  (2021-01-17T18:28:23Z)
• Representative Graph Neural Network [113.67254049938629]
  We present a Representative Graph layer to dynamically sample a few representative features. Instead of propagating the messages from all positions, our RepGraph layer computes the response of one node merely with a few representative nodes.
  arXiv  Detail & Related papers  (2020-08-12T09:46:52Z)
• Graph Neural Networks with Composite Kernels [60.81504431653264]
  We re-interpret node aggregation from the perspective of kernel weighting. We present a framework to consider feature similarity in an aggregation scheme. We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
  arXiv  Detail & Related papers  (2020-05-16T04:44:29Z)
• Evolving Normalization-Activation Layers [100.82879448303805]
  We develop efficient rejection protocols to quickly filter out candidate layers that do not work well. Our method leads to the discovery of EvoNorms, a set of new normalization-activation layers with novel, and sometimes surprising structures. Our experiments show that EvoNorms work well on image classification models including ResNets, MobileNets and EfficientNets.
  arXiv  Detail & Related papers  (2020-04-06T19:52:48Z)
• Learning Dynamic Routing for Semantic Segmentation [86.56049245100084]
  This paper studies a conceptually new method to alleviate the scale variance in semantic representation, named dynamic routing. The proposed framework generates data-dependent routes, adapting to the scale distribution of each image. To this end, a differentiable gating function, called soft conditional gate, is proposed to select scale transform paths on the fly.
  arXiv  Detail & Related papers  (2020-03-23T17:22:14Z)
• Hierarchical Conditional Relation Networks for Video Question Answering [62.1146543269993]
  We introduce a general-purpose reusable neural unit called Conditional Relation Network (CRN) CRN serves as a building block to construct more sophisticated structures for representation and reasoning over video. Our evaluations on well-known datasets achieved new SoTA results, demonstrating the impact of building a general-purpose reasoning unit on complex domains such as VideoQA.
  arXiv  Detail & Related papers  (2020-02-25T07:00:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.