An adaptive decoding biased random key genetic algorithm for cloud workflow scheduling

/pdf/multi-objective-workflow-scheduling-based-on-genetic-3ulyas9g.pdf

Multi-objective workflow scheduling based on genetic algorithm in cloud environment

Mobile-cloud-based healthcare applications are increasingly growing in practice. For instance, healthcare, transport, and shopping applications are designed on the basis of the mobile cloud. For executing mobile-cloud applications, offloading and scheduling are fundamental mechanisms. However, mobile healthcare workflow applications with these methods are widely ignored, demanding applications in various aspects for healthcare monitoring, live healthcare service, and biomedical firms. However, these offloading and scheduling schemes do not consider the workflow applications’ execution in their models. This paper develops a lightweight secure efficient offloading scheduling (LSEOS) metaheuristic model. LSEOS consists of light weight, and secure offloading and scheduling methods whose execution offloading delay is less than that of existing methods. The objective of LSEOS is to run workflow applications on other nodes and minimize the delay and security risk in the system. The metaheuristic LSEOS consists of the following components: adaptive deadlines, sorting, and scheduling with neighborhood search schemes. Compared to current strategies for delay and security validation in a model, computational results revealed that the LSEOS outperformed all available offloading and scheduling methods for process applications by 10% security ratio and by 29% regarding delays.

/pdf/a-lightweight-secure-adaptive-approach-for-internet-of-3b8neq0n.pdf

A Lightweight Secure Adaptive Approach for Internet-of-Medical-Things Healthcare Applications in Edge-Cloud-Based Networks

A new scheduling problem, the distributed permutation flowshop scheduling problem with uncertain processing times and carryover sequence-dependent setup time (DPUC), is addressed. The DPUC is an important application problem in modern electronics manufacturing. A robust model is established for the DPUC with makespan criterion. A counter-intuitive paradox is found, that is, adding a new job to one of the production lines can reduce the completion time of the production line. Two acceleration methods are provided to save computational efforts. An iterated greedy algorithm called IG_FS is proposed to solve the DPUC. A heuristic based on the well-known NEH is proposed to generate the initial solution for the IG_FS. In the destruction phase of the IG_FS, dynamic sizes based on both adaptability and randomness are provided to improve the exploration capability. During the local search phase of the IG_FS, a hybrid local search method consisting of shift and swap operators is presented to exploit more diverse search areas. Extensive experiments show that the proposed IG_FS performs significantly better than the six competing algorithms adapted from the closely related scheduling literature.

An Effective Iterated Greedy Algorithm for a Robust Distributed Permutation Flowshop Problem With Carryover Sequence-Dependent Setup Time

Complex-valued neural networks (CVNNs) have shown their excellent efficiency compared to their real counter-parts in speech enhancement, image and signal processing. Researchers throughout the years have made many efforts to improve the learning algorithms and activation functions of CVNNs. Since CVNNs have proven to have better performance in handling the naturally complex-valued data and signals, this area of study will grow and expect the arrival of some effective improvements in the future. Therefore, there exists an obvious reason to provide a comprehensive survey paper that systematically collects and categorizes the advancement of CVNNs. In this paper, we discuss and summarize the recent advances based on their learning algorithms, activation functions, which is the most challenging part of building a CVNN, and applications. Besides, we outline the structure and applications of complex-valued convolutional, residual and recurrent neural networks. Finally, we also present some challenges and future research directions to facilitate the exploration of the ability of CVNNs. 

Complex-Valued Neural Networks: A Comprehensive Survey

Workflow scheduling is a key issue and remains a challenging problem in cloud computing. Faced with the large number of virtual machine (VM) types offered by cloud providers, cloud users need to choose the most appropriate VM type for each task. Multiple task scheduling sequences exist in a workflow application. Different task scheduling sequences have a significant impact on the scheduling performance. It is not easy to determine the most appropriate set of VM types for tasks and the best task scheduling sequence. Besides, the idle time slots on VM instances should be used fully to increase resources' utilization and save the execution cost of a workflow. This paper considers these three aspects simultaneously and proposes a cloud workflow scheduling approach which combines particle swarm optimization (PSO) and idle time slot-aware rules, to minimize the execution cost of a workflow application under a deadline constraint. A new particle encoding is devised to represent the VM type required by each task and the scheduling sequence of tasks. An idle time slot-aware decoding procedure is proposed to decode a particle into a scheduling solution. To handle tasks' invalid priorities caused by the randomness of PSO, a repair method is used to repair those priorities to produce valid task scheduling sequences. The proposed approach is compared with state-of-the-art cloud workflow scheduling algorithms. Experiments show that the proposed approach outperforms the comparative algorithms in terms of both of the execution cost and the success rate in meeting the deadline.

Yun Wang

Papers

An Effective Cloud Workflow Scheduling Approach Combining PSO and Idle Time Slot-Aware Rules