Simulation model of load balancing in distributed computing systems

The availability of high-performance computing, high speed data transfer over the network and widespread of software for the design and pre-production in mechanical engineering have led to the fact that at the present time the large industrial enterprises and small engineering companies implement complex computer systems for efficient solutions of production and management tasks. Such computer systems are generally built on the basis of distributed heterogeneous computer systems. The analytical problems solved by such systems are the key models of research, but the system-wide problems of efficient distribution (balancing) of the computational load and accommodation input, intermediate and output databases are no less important. The main tasks of this balancing system are load and condition monitoring of compute nodes, and the selection of a node for transition of the user's request in accordance with a predetermined algorithm. The load balancing is one of the most used methods of increasing productivity of distributed computing systems through the optimal allocation of tasks between the computer system nodes. Therefore, the development of methods and algorithms for computing optimal scheduling in a distributed system, dynamically changing its infrastructure, is an important task

RICIS research

The principle focus of one of the RICIS (Research Institute for Computing and Information Systems) components is computer systems and software engineering in-the-large of the lifecycle of large, complex, distributed systems which: (1) evolve incrementally over a long time; (2) contain non-stop components; and (3) must simultaneously satisfy a prioritized balance of mission and safety critical requirements at run time. This focus is extremely important because of the contribution of the scaling direction problem to the current software crisis. The Computer Systems and Software Engineering (CSSE) component addresses the lifestyle issues of three environments: host, integration, and target

Integrated Design Tools for Embedded Control Systems

Currently, computer-based control systems are still being implemented using the same techniques as 10 years ago. The purpose of this project is the development of a design framework, consisting of tools and libraries, which allows the designer to build high reliable heterogeneous real-time embedded systems in a very short time at a fraction of the present day costs. The ultimate focus of current research is on transformation control laws to efficient concurrent algorithms, with concerns about important non-functional real-time control systems demands, such as fault-tolerance, safety,\ud reliability, etc.\ud The approach is based on software implementation of CSP process algebra, in a modern way (pure objectoriented design in Java). Furthermore, it is intended that the tool will support the desirable system-engineering stepwise refinement design approach, relying on past research achievements ¿ the mechatronics design trajectory based on the building-blocks approach, covering all complex (mechatronics) engineering phases: physical system modeling, control law design, embedded control system implementation and real-life realization. Therefore, we expect that this project will result in an\ud adequate tool, with results applicable in a wide range of target hardware platforms, based on common (off-theshelf) distributed heterogeneous (cheap) processing units

RICIS Symposium 1988

Integrated Environments for Large, Complex Systems is the theme for the RICIS symposium of 1988. Distinguished professionals from industry, government, and academia have been invited to participate and present their views and experiences regarding research, education, and future directions related to this topic. Within RICIS, more than half of the research being conducted is in the area of Computer Systems and Software Engineering. The focus of this research is on the software development life-cycle for large, complex, distributed systems. Within the education and training component of RICIS, the primary emphasis has been to provide education and training for software professionals

The engineering of emergence in complex adaptive systems

Agent-oriented software engineering is a new software engineering paradigm that is ideally suited to the analysis and design of complex systems. Open distributed environments place a growing demand on complex systems to be adaptive as well. Complex systems that can learn from and adapt to dynamically changing environments are called complex adaptive systems. These systems are characterized by emergent behaviour caused by interactions between system components and the environment. Agent-oriented software engineering methodologies attempt to control emergence during analysis and design by engineering the complex system in such a way that the correct emergent behaviour results during run-time. In a complex adaptive system however, emergent behaviour cannot be predicted during analysis and design, as it evolves only after implementation. By restricting emergent behaviour, as is done in most agent-oriented software engineering approaches, a complex system cannot be fully adaptive as well. We propose the BaBe methodology that will enable a complex system to be adaptive by learning from its environment and modifying its behaviour during run-time. This methodology adds a run-time emergence model consisting of distributed Bayesian behaviour networks to the agent-oriented software engineering lifecycle. These networks are initialised by the human software engineer during analysis and design and deployed by Bayesian agencies (also complex adaptive systems). The Bayesian agents are simple, and collectively they implement distributed Bayesian behaviour networks. These networks, being specialized Bayesian networks, enable the Bayesian agents to collectively mine relationships between emergent behaviours and the interactions that caused them to emerge, in order to adapt the behaviour of the system. The agents are organized into heterarchies of agencies, where each agency activates one or more component behaviour depending on the inference in the underlying Bayesian behaviour network. These agencies assist the human software engineer to bridge the gap between the implementation and the understanding of emergent behaviour in complex adaptive systems. Due to the simplicity of the agents and the minimal communication amongst them, they can be implemented using a commercially available component architecture. We describe a prototype implementation of the Bayesian agencies using Sun’s Enterprise JavaBeans™ component architecture.Thesis (PhD (Computer Science))--University of Pretoria, 2005.Computer Scienceunrestricte

Engineering Resilient Collective Adaptive Systems by Self-Stabilisation

Collective adaptive systems are an emerging class of networked computational systems, particularly suited in application domains such as smart cities, complex sensor networks, and the Internet of Things. These systems tend to feature large scale, heterogeneity of communication model (including opportunistic peer-to-peer wireless interaction), and require inherent self-adaptiveness properties to address unforeseen changes in operating conditions. In this context, it is extremely difficult (if not seemingly intractable) to engineer reusable pieces of distributed behaviour so as to make them provably correct and smoothly composable. Building on the field calculus, a computational model (and associated toolchain) capturing the notion of aggregate network-level computation, we address this problem with an engineering methodology coupling formal theory and computer simulation. On the one hand, functional properties are addressed by identifying the largest-to-date field calculus fragment generating self-stabilising behaviour, guaranteed to eventually attain a correct and stable final state despite any transient perturbation in state or topology, and including highly reusable building blocks for information spreading, aggregation, and time evolution. On the other hand, dynamical properties are addressed by simulation, empirically evaluating the different performances that can be obtained by switching between implementations of building blocks with provably equivalent functional properties. Overall, our methodology sheds light on how to identify core building blocks of collective behaviour, and how to select implementations that improve system performance while leaving overall system function and resiliency properties unchanged.Comment: To appear on ACM Transactions on Modeling and Computer Simulatio

Universal Quantum Walk Control Plane for Quantum Networks

Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum operations among quantum processors. In this work, we describe a Quantum Walk Control Protocol (QWCP) to perform distributed quantum operations in a quantum network. We consider a generalization of the discrete-time coined quantum walk model that accounts for the interaction between quantum walks in the network graph with quantum registers inside the network nodes. QWCP allows for the implementation of networked quantum services, such as distributed quantum computing and entanglement distribution, abstracting hardware implementation and the transmission of quantum information through channels. Multiple interacting quantum walks can be used to propagate entangled control signals across the network in parallel. We demonstrate how to use QWCP to perform distributed multi-qubit controlled gates, which shows the universality of the protocol for distributed quantum computing. Furthermore, we apply the QWCP to the task of entanglement distribution in a quantum network.Comment: 27 pages; 2 figures. A preliminary version of this work was presented at IEEE International Conference on Quantum Computing and Engineering 2021 (QCE21). arXiv admin note: text overlap with arXiv:2106.0983