A Novel Workload Allocation Strategy for Batch Jobs

The distribution of computational tasks across a diverse set of geographically distributed heterogeneous resources is a critical issue in the realisation of true computational grids. Conventionally, workload allocation algorithms are divided into static and dynamic approaches. Whilst dynamic approaches frequently outperform static schemes, they usually require the collection and processing of detailed system information at frequent intervals - a task that can be both time consuming and unreliable in the real-world. This paper introduces a novel workload allocation algorithm for optimally distributing the workload produced by the arrival of batches of jobs. Results show that, for the arrival of batches of jobs, this workload allocation algorithm outperforms other commonly used algorithms in the static case. A hybrid scheduling approach (using this workload allocation algorithm), where information about the speed of computational resources is inferred from previously completed jobs, is then introduced and the efficiency of this approach demonstrated using a real world computational grid. These results are compared to the same workload allocation algorithm used in the static case and it can be seen that this hybrid approach comprehensively outperforms the static approach

Agent-based modeling for environmental management. Case study: virus dynamics affecting Norwegian fish farming in fjords

Background: Norwegian fish-farming industry is an important industry, rapidly growing, and facing significant challenges such as the spread of pathogens1, trade-off between locations, fish production and health. There is a need for research, i.e. the development of theories (models), methods, techniques and tools for analysis, prediction and management, i.e. strategy development, policy design and decision making, to facilitate a sustainable industry. Loss due to the disease outbreaks in the aquaculture systems pose a large risk to a sustainable fish industry system, and pose a risk to the coastal and fjord ecosystem systems as a whole. Norwegian marine aquaculture systems are located in open areas (i.e. fjords) where they overlap and interact with other systems (e.g. transport, wild life, tourist, etc.). For instance, shedding viruses from aquaculture sites affect the wild fish in the whole fjord system. Fish disease spread and pathogen transmission in such complex systems, is process that it is difficult to predict, analyze, and control. There are several time-variant factors such as fish density, environmental conditions and other biological factors that affect the spread process. In this thesis, we developed methods to examine these factors on fish disease spread in fish populations and on pathogen spread in the time-space domain. Then we develop methods to control and manage the aquaculture system by finding optimal system settings in order to have a minimum infection risk and a high production capacity. Aim: The overall objective of the thesis is to develop agent-based models, methods and tools to facilitate the management of aquaculture production in Norwegian fjords by predicting the pathogen dynamics, distribution, and transmission in marine aquaculture systems. Specifically, the objectives are to assess agent-based modeling as an approach to understanding fish disease spread processes, to develop agent-based models that help us predict, analyze and understand disease dynamics in the context of various scenarios, and to develop a framework to optimize the location and the load of the aquaculture systems so as to minimize the infection risk in a growing fish industry. Methods: We use agent-based method to build models to simulate disease dynamics in fish populations and to simulate pathogen transmission between several aquaculture sites in a Norwegian fjord. Also, we use particle swarm optimization algorithm to identify agent-based models’ parameters so as to optimize the dynamics of the system model. In this context, we present a framework for using a particle swarm optimization algorithm to identify the parameter values of the agent-based model of aquaculture system that are expected to yield the optimal fish densities and farm locations that avoid the risk of spreading disease. The use of particle swarm optimization algorithm helps in identifying optimal agent-based models’ input parameters depending on the feedback from the agentbased models’ outputs. Results: As the thesis is built on three main studies, the results of the thesis work can be divided into three components. In the first study, we developed many agent-based models to simulate fish disease spread in stand-alone fish populations. We test the models in different scenarios by varying the agents (i.e. fish and pathogens) parameters, environment parameters (i.e. seawater temperature and currents), and interactions (interaction between agents-agents, and agents-environment) parameters. We use sensitivity analysis method to test different key input parameters such as fish density, fish swimming behavior, seawater temperature, and sea currents to show their effects on the disease spread process. Exploring the sensitivity of fish disease dynamics to these key parameters helps in combatting fish disease spread. In the second study, we build infection risk maps in a space-time domain, by developing agent-based models to identify the pathogen transmission patterns. The agent-based method helps us advance our understanding of pathogen transmission and builds risk maps to help us reduce the spread of infectious fish diseases. By using this method, we may study the spatial and dynamic aspects of the spread of infections and address the stochastic nature of the infection process. In the third study, we developed a framework for the optimization of the aquaculture systems. The framework uses particle swarm optimization algorithm to optimize agent-based models’ parameters so as to optimize the objective function. The framework was tested by developing a model to find optimal fish densities and farm locations in marine aquaculture system in a Norwegian fjord. Results show so that the rapid convergence of the presented particle swarm optimization algorithm to the optimal solution, - the algorithm requires a maximum of 18 iterations to find the best solution which can increase the fish density to three times while keeping the risk of infection at an accepted level. Conclusion: There are many contributions of this research work. First, we assessed the agent-based modeling as a method to simulate and analyze fish disease spread dynamics as a foundation for managing aquaculture systems. Results from this study demonstrate how effective the use of agentbased method is in the simulation of infectious diseases. By using this method, we are able to study spatial aspects of the spread of fish diseases and address the stochastic nature of infections process. Agent-based models are flexible, and they can include many external factors that affect fish disease dynamics such as interactions with wild fish and ship traffic. Agent-based models successfully help us to overcome the problem associated with lack of data in fish disease transmission and contribute to our understanding of different cause-effects relationships in the dynamics of fish diseases. Secondly, we developed methods to build infection risk maps in a space-time domain conditioned upon the identification of the pathogen transmission patterns in such a space-time domain, so as to help prevent and, if needed, combat infectious fish diseases by informing the management of the fish industry in Norway. Finally, we developed a method by which we may optimize the fish densities and farm locations of aquaculture systems so as to ensure a sustainable fish industry with a minimum risk of infection and a high production capacity. This PhD study offers new research-based approaches, models and tools for analysis, predictions and management that can be used to facilitate a sustainable development of the marine aquaculture industry with a maximal economic outcome and a minimal environmental impact

Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations

In recent years, a great variety of nature- and bio-inspired algorithms has been reported in the literature. This algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature-inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field.Comment: 76 pages, 6 figure

Optimizing task allocation for edge compute micro-clusters

There are over 30 billion devices at the network edge. This is largely driven by the unprecedented growth of the Internet-of-Things (IoT) and 5G technologies. These devices are being used in various applications and technologies, including but not limited to smart city systems, innovative agriculture management systems, and intelligent home systems. Deployment issues like networking and privacy problems dictate that computing should occur close to the data source at or near the network edge. Edge and fog computing are recent decentralised computing paradigms proposed to augment cloud services by extending computing and storage capabilities to the network’s edge to enable executing computational workloads locally. The benefits can help to solve issues such as reducing the strain on networking backhaul, improving network latency and enhancing application responsiveness. Many edge and fog computing deployment solutions and infrastructures are being employed to deliver cloud resources and services at the edge of the network — for example, cloudless and mobile edge computing. This thesis focuses on edge micro-cluster platforms for edge computing. Edge computing micro-cluster platforms are small, compact, and decentralised groups of interconnected computing resources located close to the edge of a network. These micro-clusters can typically comprise a variety of heterogeneous but resource-constrained computing resources, such as small compute nodes like Single Board Computers (SBCs), storage devices, and networking equipment deployed in local area networks such as smart home management. The goal of edge computing micro-clusters is to bring computation and data storage closer to IoT devices and sensors to improve the performance and reliability of distributed systems. Resource management and workload allocation represent a substantial challenge for such resource-limited and heterogeneous micro-clusters because of diversity in system architecture. Therefore, task allocation and workload management are complex problems in such micro-clusters. This thesis investigates the feasibility of edge micro-cluster platforms for edge computation. Specifically, the thesis examines the performance of micro-clusters to execute IoT applications. Furthermore, the thesis involves the evaluation of various optimisation techniques for task allocation and workload management in edge compute micro-cluster platforms. This thesis involves the application of various optimisation techniques, including simple heuristics-based optimisations, mathematical-based optimisation and metaheuristic optimisation techniques, to optimise task allocation problems in reconfigurable edge computing micro-clusters. The implementation and performance evaluations take place in a configured edge realistic environment using a constructed micro-cluster system comprised of a group of heterogeneous computing nodes and utilising a set of edge-relevant applications benchmark. The research overall characterises and demonstrates a feasible use case for micro-cluster platforms for edge computing environments and provides insight into the performance of various task allocation optimisation techniques for such micro-cluster systems

A survey of evolutionary continuous dynamic optimization over two decades – part A

Many real-world optimization problems are dynamic. The field of dynamic optimization deals with such problems where the search space changes over time. In this two-part paper, we present a comprehensive survey of the research in evolutionary dynamic optimization for single-objective unconstrained continuous problems over the last two decades. In Part A of this survey, we propose a new taxonomy for the components of dynamic optimization algorithms, namely, convergence detection, change detection, explicit archiving, diversity control, and population division and management. In comparison to the existing taxonomies, the proposed taxonomy covers some additional important components, such as convergence detection and computational resource allocation. Moreover, we significantly expand and improve the classifications of diversity control and multi-population methods, which are under-represented in the existing taxonomies. We then provide detailed technical descriptions and analysis of different components according to the suggested taxonomy. Part B of this survey provides an indepth analysis of the most commonly used benchmark problems, performance analysis methods, static optimization algorithms used as the optimization components in the dynamic optimization algorithms, and dynamic real-world applications. Finally, several opportunities for future work are pointed out

CPS Data Streams Analytics based on Machine Learning for Cloud and Fog Computing: A Survey

Cloud and Fog computing has emerged as a promising paradigm for the Internet of things (IoT) and cyber-physical systems (CPS). One characteristic of CPS is the reciprocal feedback loops between physical processes and cyber elements (computation, software and networking), which implies that data stream analytics is one of the core components of CPS. The reasons for this are: (i) it extracts the insights and the knowledge from the data streams generated by various sensors and other monitoring components embedded in the physical systems; (ii) it supports informed decision making; (iii) it enables feedback from the physical processes to the cyber counterparts; (iv) it eventually facilitates the integration of cyber and physical systems. There have been many successful applications of data streams analytics, powered by machine learning techniques, to CPS systems. Thus, it is necessary to have a survey on the particularities of the application of machine learning techniques to the CPS domain. In particular, we explore how machine learning methods should be deployed and integrated in cloud and fog architectures for better fulfilment of the requirements, e.g. mission criticality and time criticality, arising in CPS domains. To the best of our knowledge, this paper is the first to systematically study machine learning techniques for CPS data stream analytics from various perspectives, especially from a perspective that leads to the discussion and guidance of how the CPS machine learning methods should be deployed in a cloud and fog architecture

Stochastic diffusion search review

Stochastic Diffusion Search, first incepted in 1989, belongs to the extended family of swarm intelligence algorithms. In contrast to many nature-inspired algorithms, stochastic diffusion search has a strong mathematical framework describing its behaviour and convergence. In addition to concisely exploring the algorithm in the context of natural swarm intelligence systems, this paper reviews various developments of the algorithm, which have been shown to perform well in a variety of application domains including continuous optimisation, implementation on hardware and medical imaging. This algorithm has also being utilised to argue the potential computational creativity of swarm intelligence systems through the two phases of exploration and exploitatio

Novel optimisation methods for numerical inverse problems

Inverse problems involve the determination of one or more unknown quantities usually appearing in the mathematical formulation of a physical problem. These unknown quantities may be boundary heat flux, various source terms, thermal and material properties, boundary shape and size. Solving inverse problems requires additional information through in-situ data measurements of the field variables of the physical problems. These problems are also ill-posed because the solution itself is sensitive to random errors in the measured input data. Regularisation techniques are usually used in order to deal with the instability of the solution. In the past decades, many methods based on the nonlinear least squares model, both deterministic (CGM) and stochastic (GA, PSO), have been investigated for numerical inverse problems. The goal of this thesis is to examine and explore new techniques for numerical inverse problems. The background theory of population-based heuristic algorithm known as quantum-behaved particle swarm optimisation (QPSO) is re-visited and examined. To enhance the global search ability of QPSO for complex multi-modal problems, several modifications to QPSO are proposed. These include perturbation operation, Gaussian mutation and ring topology model. Several parameter selection methods for these algorithms are proposed. Benchmark functions were used to test the performance of the modified algorithms. To address the high computational cost of complex engineering optimisation problems, two parallel models of the QPSO (master-slave, static subpopulation) were developed for different distributed systems. A hybrid method, which makes use of deterministic (CGM) and stochastic (QPSO) methods, is proposed to improve the estimated solution and the performance of the algorithms for solving the inverse problems. Finally, the proposed methods are used to solve typical problems as appeared in many research papers. The numerical results demonstrate the feasibility and efficiency of QPSO and the global search ability and stability of the modified versions of QPSO. Two novel methods of providing initial guess to CGM with approximated data from QPSO are also proposed for use in the hybrid method and were applied to estimate heat fluxes and boundary shapes. The simultaneous estimation of temperature dependent thermal conductivity and heat capacity was addressed by using QPSO with Gaussian mutation. This combination provides a stable algorithm even with noisy measurements. Comparison of the performance between different methods for solving inverse problems is also presented in this thesis

Agent-based modelling and Swarm Intelligence in systems engineering

El objetivo de la tesis doctoral es evaluar la utilidad de las técnicas Modelado Basado en Agentes, algoritmos de optimización Swarm Intelligence y programación paralela sobre tarjeta gráfica en el campo de la Ingeniería de Sistemas y Automática. Se ha realizado un revisión bibliográfica y desarrollado un marco de desarrollo de la técnica de Modelado Basado en Agentes. Esta técnica se ha empleado para realizar un modelo de un reactor de fangos activados (que se engloba dentro del proceso de depuración de aguas residuales). Se ha desarrollado una notación complementaria para la descripción de modelos basados en agentes desde el punto de vista de la ingeniería de sistemas. Se ha presentado asimismo un algoritmo de optimización basado en agentes bajo la filosofía Swarm Intelligence. Se han trabajado con las técnicas de paralelización sobre tarjeta gráfica para reducir los tiempos de simulación de modelos y algoritmos. Se trata por lo tanto de un tesis de integración de varias tecnologías.Departamento de Ingeniería de Sistemas y Automátic

Optimal Home Energy Management System for Committed Power Exchange Considering Renewable Generations

This thesis addresses the complexity of SH operation and local renewable resources optimum sizing. The effect of different criteria and components of SH on the size of renewable resources and cost of electricity is investigated. Operation of SH with the optimum size of renewable resources is evaluated to study SH annual cost. The effectiveness of SH with committed exchange power functionality is studied for minimizing cost while responding to DR programs