Search results

The containerization application is one among the technologies that enable microservices architectures, which is observed to be the model for operating system (OS) virtualization. Containers are the virtual instances of the OS that are structured as the isolation for the OS atmosphere and its file system, which are executed on the single kernel and a single host. Hence, every microservice application is evolved in a container without launching the total virtual machine. The system overhead is minimized in this way as the environment is maintained in a secured manner. The exploitation of a microservice is as easy to start the execution of a new container. As a result, microservices could scale up by simply generating new containers until the required scalability level is attained. This paper aims to optimize the container allocation.

This paper introduces a new customized rider optimization algorithm (C-ROA) for optimizing the container allocation. The proposed model also considers the impact of system performance along with its security. Moreover, a new rescaled objective function is defined in this work that considers threshold distance, balanced cluster use, system failure, total network distance and security as well. At last, the performance of proposed work is compared over other state-of-the-art models with respect to convergence and cost analysis.

For experiment 1, the implemented model at 50th iteration has achieved minimal value, which is 29.24%, 24.48% and 21.11% better from velocity updated grey wolf optimisation (VU-GWO), whale random update assisted LA (WR-LA) and rider optimization algorithm (ROA), respectively. Similarly, on considering Experiment 2, the proposed model at 100th iteration attained superior performance than conventional models such as VU-GWO, WR-LA and ROA by 3.21%, 7.18% and 10.19%, respectively. The developed model for Experiment 3 at 100th iteration is 2.23%, 5.76% and 6.56% superior to VU-GWO, WR-LA and ROA.

This paper presents the latest fictional optimization algorithm named ROA for optimizing the container allocation. To the best of the authors’ knowledge, this is the first study that uses the C-ROA for optimization.

The main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.

The paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives.

Both partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used.

The simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments.

The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.

This paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.

This case describes the challenges faced by Amul in organising dairy farmers into a co-operative and creating continuous opportunities for value addition. Participants in the case discussion are required to review the developments in the organisation and recommend a strategy for the future.