14 research outputs found

    Consistency vs. Availability in Distributed Real-Time Systems

    Full text link
    In distributed applications, Brewer's CAP theorem tells us that when networks become partitioned (P), one must give up either consistency (C) or availability (A). Consistency is agreement on the values of shared variables; availability is the ability to respond to reads and writes accessing those shared variables. Availability is a real-time property whereas consistency is a logical property. We have extended the CAP theorem to relate quantitative measures of these two properties to quantitative measures of communication and computation latency (L), obtaining a relation called the CAL theorem that is linear in a max-plus algebra. This paper shows how to use the CAL theorem in various ways to help design real-time systems. We develop a methodology for systematically trading off availability and consistency in application-specific ways and to guide the system designer when putting functionality in end devices, in edge computers, or in the cloud. We build on the Lingua Franca coordination language to provide system designers with concrete analysis and design tools to make the required tradeoffs in deployable software.Comment: 12 pages. arXiv admin note: text overlap with arXiv:2109.0777

    Modal Reactors

    Full text link
    Complex software systems often feature distinct modes of operation, each designed to handle a particular scenario that may require the system to respond in a certain way. Breaking down system behavior into mutually exclusive modes and discrete transitions between modes is a commonly used strategy to reduce implementation complexity and promote code readability. However, such capabilities often come in the form of self-contained domain specific languages or language-specific frameworks. The work in this paper aims to bring the advantages of modal models to mainstream programming languages, by following the polyglot coordination approach of Lingua Franca (LF), in which verbatim target code (e.g., C, C++, Python, Typescript, or Rust) is encapsulated in composable reactive components called reactors. Reactors can form a dataflow network, are triggered by timed as well as sporadic events, execute concurrently, and can be distributed across nodes on a network. With modal models in LF, we introduce a lean extension to the concept of reactors that enables the coordination of reactive tasks based on modes of operation. The implementation of modal reactors outlined in this paper generalizes to any LF-supported language with only modest modifications to the generic runtime system

    Debugging and Verification Tools for LINGUA FRANCA in GEMOC Studio

    Get PDF
    International audienceLINGUA FRANCA (LF) is a polyglot coordination language designed for the composition of concurrent, timesensitive, and potentially distributed reactive components called reactors. The LF coordination layer facilitates the use of target languages (e.g., C, C++, Python, TypeScript) to realize the program logic, where each target language requires a separate runtime implementation that must correctly implement the reactor semantics. Verifying the correctness of runtime implementations is not a trivial task, and is currently done on the basis of regression testing. To provide a more formal verification tool for existing and future target runtimes, as well as to help verify properties of LF programs, we recruit the use of GEMOC Studio-an Eclipse-based workbench for the development, integration, and use of heterogeneous executable modeling languages. We present an operational model for LF, realized in GEMOC Studio, that is primed to interact with a rich set of analysis and verification tools. Our instrumentation provides the ability to navigate the execution of LF programs using an omniscient debugger with graphical model animation; to check assertions in particular execution runs, or exhaustively, using a model checker; and to validate or debug traces obtained from arbitrary LF runtime environments

    Uncertainty quantification of granular computing‑neural network model for prediction of pollutant longitudinal dispersion coefficient in aquatic streams

    Get PDF
    Discharge of pollution loads into natural water systems remains a global challenge that threatens water and food supply, as well as endangering ecosystem services. Natural rehabilitation of contaminated streams is mainly influenced by the longitudinal dispersion coefficient, or the rate of longitudinal dispersion (Dx), a key parameter with large spatiotemporal fluctuations that characterizes pollution transport. The large uncertainty in estimation of Dx in streams limits the water quality assessment in natural streams and design of water quality enhancement strategies. This study develops an artificial intelligence-based predictive model, coupling granular computing and neural network models (GrC-ANN) to provide robust estimation of Dx and its uncertainty for a range of flow-geometric conditions with high spatiotemporal variability. Uncertainty analysis of Dx estimated from the proposed GrC-ANN model was performed by alteration of the training data used to tune the model. Modified bootstrap method was employed to generate different training patterns through resampling from a global database of tracer experiments in streams with 503 datapoints. Comparison between the Dx values estimated by GrC-ANN to those determined from tracer measurements shows the appropriateness and robustness of the proposed method in determining the rate of longitudinal dispersion. The GrC-ANN model with the narrowest bandwidth of estimated uncertainty (bandwidth-factor = 0.56) that brackets the highest percentage of true Dx data (i.e., 100%) is the best model to compute Dx in streams. Considering the significant inherent uncertainty reported in the previous Dx models, the GrC-ANN model developed in this study is shown to have a robust performance for evaluating pollutant mixing (Dx) in turbulent environmental flow systems

    Decline in Iran’s groundwater recharge

    Get PDF
    Groundwater recharge feeds aquifers supplying fresh-water to a population over 80 million in Iran—a global hotspot for groundwater depletion. Using an extended database comprising abstractions from over one million groundwater wells, springs, and qanats, from 2002 to 2017, here we show a significant decline of around −3.8 mm/yr in the nationwide groundwater recharge. This decline is primarily attributed to unsustainable water and environmental resources management, exacerbated by decadal changes in climatic conditions. However, it is important to note that the former’s contribution outweighs the latter. Our results show the average annual amount of nationwide groundwater recharge (i.e., ~40 mm/yr) is more than the reported average annual runoff in Iran (i.e., ~32 mm/yr), suggesting the surface water is the main contributor to groundwater recharge. Such a decline in groundwater recharge could further exacerbate the already dire aquifer depletion situation in Iran, with devastating consequences for the country’s natural environment and socio-economic development
    corecore