A Deadline Constrained Time-Cost effective Salp Swarm Algorithm for Resource Optimization in Cloud Computing

Nowadays, Cloud Computing has become the most attractive platform, which provides anything as a Service (XaaS). Many applications may be developed and run on the cloud without worrying about platforms. It is a big challenge to allocate optimal resources to these applications and satisfy user's quality of service requirements. Here, in this paper, a Deadline Constrained Time-Cost effective Salp Swarm Algorithm (DTC-SSA) is proposed to achieve optimized resource allocation. DTC-SSA assigns the user's task to an appropriate virtual machine (Vm) and achieves a trade-off between cost and makespan while satisfying the deadline constraints. Rigorous examination of the algorithm is conducted on the various scale and cloud resources. The proposed algorithm is compared with Particle Swarm Optimization (PSO), Grey Wolf Optimizer(GWO), Bat Algorithm(BAT), and Genetic Algorithm(GA). Simulation results prove that it outperforms others by minimizing makespan, execution cost, Response time, and improving resource utilization throughput.

Deep Learning to Predict the Feasibility of Priority-Based Ethernet Network Configurations

Machine learning has been recently applied in real-time systems to predict whether Ethernet network configurations are feasible in terms of meeting deadline constraints without executing conventional schedulability analysis. However, the existing prediction techniques require domain expertise to choose the relevant input features and do not perform consistently when topologies or traffic patterns differ significantly from the ones in the training data. To overcome these problems, we propose a Graph Neural Network (GNN) prediction model that synthesizes relevant features directly from the raw data. This deep learning model possesses the ability to exploit relations among flows, links, and queues in switched Ethernet networks and generalizes to unseen topologies and traffic patterns. We also explore the use of ensembles of GNNs and show that it enhances the robustness of the predictions. An evaluation on heterogeneous testing sets comprising realistic automotive networks shows that ensembles of 32 GNN models feature a prediction accuracy ranging from 79.3% to 90% for Ethernet networks using priorities as the Quality-of-Service mechanism. The use of ensemble models provides a speedup factor ranging from 77 to 1,715 compared to schedulability analysis, which allows a far more extensive design space exploration.

An MQTT Brokers Distribution Based on Mist Computing for Real-Time IoT Communications

As we consider the number of IoT time-sensitive applications , the transfer of data to a remote data center and server such as Cloud, Fog, and Edge becomes inefficient since the deadline constraint is not satisfied. Thus, ensuring that the IoT time-sensitive applications meet their timing constraints is a challenge. Mist Computing is closer to IoT devices, presenting the lowest communication delay but less computational resource than the Cloud, Fog, and Edge. Seeing several IoT devices use MQTT protocol to access the data due to its lightness and flexibility, we propose an architecture for IoT time-sensitive applications based on MQTT protocol and integrating Mist Computing. We focus on distributing the MQTT brokers over Mist nodes to satisfy the deadline constraints with the consideration of the limited resource of Mist nodes. Hence, we propose an approach for the selection of the appropriate MQTT Mist broker. We have also proposed MQTT communication model that provides the M/M/1 based analysis for delay computing and energy conception. The experiment results show that our proposal is very effective for time-sensitive applications and also maximize the lifetime of IoT systems since it minimizes the cumulative energy of the system. Compared to MQTT Edge broker distribution, our solution provides the lesser delay of communication between IoT devices.

Portfolio-Wide Optimization of Pharmaceutical R&D Activities Using Mathematical Programming

The research and development (R&D) management in any major research pharmaceutical company is constantly faced with the need to make complicated activity scheduling and resource allocation decisions, as they carry out scientific work to develop new therapeutic products. This paper describes how we develop a decision support tool that allows practitioners to determine portfolio-wide optimal schedules in a systematic, quantitative, and largely automated fashion. Our tool is based on a novel mixed-integer linear optimization model that extends archetypal multimode resource-constrained project scheduling models in order to accommodate multiple rich features that are pertinent to the Chemistry, Manufacturing, and Controls (CMC) activities carried out within the pharmaceutical R&D setting. The tool addresses this problem at the operational level, determining schedules that are optimal in light of chosen business objectives under activity sequencing, resource availability, and deadline constraints. Applying the tool on current workload data demonstrates its tractability for practical adoption. We further illustrate how, by utilizing the tool under different input instances, one may conduct various tactical analyses to assess the system’s ability to cope with sudden changes or react to shifting management priorities.

Reliability-aware Scheduling and Routing for Messages in Time-sensitive Networking

Time-sensitive Networking (TSN) on Ethernet is a promising communication technology in the automotive and industrial automation industries due to its real-time and high-bandwidth communication capabilities. Time-triggered scheduling and static routing are often adopted in these areas due to high requirements on predictability for safety-critical applications. Deadline-constrained routing and scheduling in TSN have been studied extensively in past research. However, scheduling and routing with reliability requirements in the context of transient faults are not yet studied. In this work, we propose an Satisfiability Modulo Theory-based technique to perform scheduling and routing that takes both reliability constraints and end-to-end deadline constraints into consideration. Heuristics have been applied to improve the scalability of the solution. Extensive experiments have been conducted to demonstrate the efficiency of our proposed technique.

Real-time Multiple-Workflow Scheduling in Cloud Environment

With the development of cloud computing, an increasing number of applications in different fields have been deployed to the cloud. In this process, the real-time scheduling of multiple workflows composed of tasks from these different applications must consider various influencing factors which strongly affect scheduling performance. This paper proposes a real-time multiple-workflow scheduling (RMWS) scheme to schedule workflows dynamically with minimum cost under different deadline constraints. Due to the uncertainty of workflow arrival time and specification, RMWS dynamically allocates tasks and divides the scheduling process into three stages. First, when a new workflow arrives, the latest start time and the latest finish time of each task are calculated according to the deadline, and the subdeadline of each task is obtained by probabilistic upward ranking. Then, each ready task is allocated according to its subdeadline and the increased cost of the virtual machine (VM). Meanwhile, only one waiting task can be assigned to each VM to reduce delay fluctuations. Finally, when the task is completed on the assigned VM, all the parameters of the relevant tasks are updated before allocating them to appropriate VMs. The experimental results based on four real-world workflow traces show that the proposed algorithm is superior to two state-of-the-art algorithms in terms of total rental cost, resource utilization, success rate and deadline deviation under different conditions.