8 research outputs found

    Optimal Task Scheduling in the Cloud Environment using a Mean Grey Wolf Optimization Algorithm

    Get PDF
    Cloud computing is one of the emerging areas in computing platforms, supporting heterogeneous, parallel and distributed environments. An important challenging issue in cloud computing is task scheduling, which directly influences system performance and its efficiency. The primary objective of task scheduling involves scheduling tasks related to resources and minimizing the time span of the schedule. In this study, we propose a Modified Mean Grey Wolf Optimization (MGWO) algorithm to enhance system performance, and consequently reduce scheduling issues. The main objective of this method is focused upon minimizing the makespan (execution time) and energy consumption.  These two objective functions are elaborated in the algorithm in order to suitably regulate the quality of results based on response, in order to achieve a near optimal solution. The implementation results of the proposed algorithm are evaluated using the CloudSim toolkit for standard workloads (normal and uniform). The advantage of the proposed method is evident from the simulation results, which show a comprehensive reduction in makespan and energy consumption. The outcomes of these results show that the proposed Mean GWO algorithm achieves a 8.85% makespan improvement compared to the PSO algorithm, and 3.09% compared to the standard GWO algorithm for the normal dataset. In addition, the proposed algorithm achieves 9.05% and 9.2% improvement in energy conservation compared to the PSO and standard GWO algorithms for the uniform dataset, respectively

    A comparative analysis of NSGA-II and NSGA-III for autoscaling parameter sweep experiments in the cloud

    Get PDF
    The Cloud Computing paradigm is focused on the provisioning of reliable and scalable virtual infrastructures that deliver execution and storage services. This paradigm is particularly suitable to solve resource-greedy scientific computing applications such as parameter sweep experiments (PSEs). Through the implementation of autoscalers, the virtual infrastructure can be scaled up and down by acquiring or terminating instances of virtual machines (VMs) at the time that application tasks are being scheduled. In this paper, we extend an existing study centered in a state-of-the-art autoscaler called multiobjective evolutionary autoscaler (MOEA). MOEA uses a multiobjective optimization algorithm to determine the set of possible virtual infrastructure settings. In this context, the performance of MOEA is greatly influenced by the underlying optimization algorithm used and its tuning. Therefore, we analyze two well-known multiobjective evolutionary algorithms (NSGA-II and NSGA-III) and how they impact on the performance of the MOEA autoscaler. Simulated experiments with three real-world PSEs show that MOEA gets significantly improved when using NSGA-III instead of NSGA-II due to the former provides a better exploitation versus exploration trade-off.Fil: Yannibelli, Virginia Daniela. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Instituto Superior de Ingeniería del Software. Universidad Nacional del Centro de la Provincia de Buenos Aires. Instituto Superior de Ingeniería del Software; ArgentinaFil: Pacini Naumovich, Elina Rocío. Universidad Nacional de Cuyo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza; ArgentinaFil: Monge, David. Universidad Nacional de Cuyo; ArgentinaFil: Mateos Diaz, Cristian Maximiliano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Instituto Superior de Ingeniería del Software. Universidad Nacional del Centro de la Provincia de Buenos Aires. Instituto Superior de Ingeniería del Software; ArgentinaFil: Rodríguez, Guillermo Horacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Instituto Superior de Ingeniería del Software. Universidad Nacional del Centro de la Provincia de Buenos Aires. Instituto Superior de Ingeniería del Software; Argentin

    Hybrid Meta-heuristic Algorithms for Static and Dynamic Job Scheduling in Grid Computing

    Get PDF
    The term ’grid computing’ is used to describe an infrastructure that connects geographically distributed computers and heterogeneous platforms owned by multiple organizations allowing their computational power, storage capabilities and other resources to be selected and shared. Allocating jobs to computational grid resources in an efficient manner is one of the main challenges facing any grid computing system; this allocation is called job scheduling in grid computing. This thesis studies the application of hybrid meta-heuristics to the job scheduling problem in grid computing, which is recognized as being one of the most important and challenging issues in grid computing environments. Similar to job scheduling in traditional computing systems, this allocation is known to be an NPhard problem. Meta-heuristic approaches such as the Genetic Algorithm (GA), Variable Neighbourhood Search (VNS) and Ant Colony Optimisation (ACO) have all proven their effectiveness in solving different scheduling problems. However, hybridising two or more meta-heuristics shows better performance than applying a stand-alone approach. The new high level meta-heuristic will inherit the best features of the hybridised algorithms, increasing the chances of skipping away from local minima, and hence enhancing the overall performance. In this thesis, the application of VNS for the job scheduling problem in grid computing is introduced. Four new neighbourhood structures, together with a modified local search, are proposed. The proposed VNS is hybridised using two meta-heuristic methods, namely GA and ACO, in loosely and strongly coupled fashions, yielding four new sequential hybrid meta-heuristic algorithms for the problem of static and dynamic single-objective independent batch job scheduling in grid computing. For the static version of the problem, several experiments were carried out to analyse the performance of the proposed schedulers in terms of minimising the makespan using well known benchmarks. The experiments show that the proposed schedulers achieved impressive results compared to other traditional, heuristic and meta-heuristic approaches selected from the bibliography. To model the dynamic version of the problem, a simple simulator, which uses the rescheduling technique, is designed and new problem instances are generated, by using a well-known methodology, to evaluate the performance of the proposed hybrid schedulers. The experimental results show that the use of rescheduling provides significant improvements in terms of the makespan compared to other non-rescheduling approaches

    A bio-inspired scheduler for minimizing makespan and flowtime of computational mechanics applications on federated clouds

    No full text
    Computational Mechanics (CM) concerns the use of computational methods to study phenomena under the principles of mechanics. A representative CM application is parameter sweep experiments (PSEs), which involves the execution of many CPU-intensive jobs and thus computing environments such as Clouds must be used. We focus on federated Clouds, where PSEs are processed via virtual machines (VM) that are lauched in hosts belonging to different datacenters, minimizing both the makespan and flowtime. Scheduling is performed at three levels: a) broker, where datacenters are selected based on their network latencies via three policies, b) infrastructure, where two bio-inspired schedulers based on Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) for VM-host mapping in a datacenter are implemented, and c)VM, where jobs are assigned into the preallocated VMs based on job priorities. Simulated experiments performed with job data from two real PSEs show that our scheduling approach allows for a more agile job handling while reducing PSE makespan and flowtime.Fil: Pacini Naumovich, Elina Rocío. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Cuyo. Facultad de Ciencias Exactas y Naturales; Argentina. Universidad Nacional de Cuyo. Instituto para las Tecnologías de la Informacion y las Comunicaciones; ArgentinaFil: Mateos Diaz, Cristian Maximiliano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Instituto Superior de Ingeniería del Software. Universidad Nacional del Centro de la Provincia de Buenos Aires. Instituto Superior de Ingeniería del Software; ArgentinaFil: Garcia Garino, Carlos Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Cuyo. Instituto para las Tecnologías de la Informacion y las Comunicaciones; Argentina. Universidad Nacional de Cuyo. Facultad de Ingeniería; ArgentinaFil: Careglio, Claudio Ariel. Universidad Nacional de Cuyo. Instituto para las Tecnologías de la Informacion y las Comunicaciones; Argentina. Universidad Nacional de Cuyo. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Mirasso, Aníbal. Universidad Nacional de Cuyo. Facultad de Ingeniería; Argentin

    Quayside Operations Planning Under Uncertainty

    Get PDF

    Design and Management of Manufacturing Systems

    Get PDF
    Although the design and management of manufacturing systems have been explored in the literature for many years now, they still remain topical problems in the current scientific research. The changing market trends, globalization, the constant pressure to reduce production costs, and technical and technological progress make it necessary to search for new manufacturing methods and ways of organizing them, and to modify manufacturing system design paradigms. This book presents current research in different areas connected with the design and management of manufacturing systems and covers such subject areas as: methods supporting the design of manufacturing systems, methods of improving maintenance processes in companies, the design and improvement of manufacturing processes, the control of production processes in modern manufacturing systems production methods and techniques used in modern manufacturing systems and environmental aspects of production and their impact on the design and management of manufacturing systems. The wide range of research findings reported in this book confirms that the design of manufacturing systems is a complex problem and that the achievement of goals set for modern manufacturing systems requires interdisciplinary knowledge and the simultaneous design of the product, process and system, as well as the knowledge of modern manufacturing and organizational methods and techniques

    XXIII Edición del Workshop de Investigadores en Ciencias de la Computación : Libro de actas

    Get PDF
    Compilación de las ponencias presentadas en el XXIII Workshop de Investigadores en Ciencias de la Computación (WICC), llevado a cabo en Chilecito (La Rioja) en abril de 2021.Red de Universidades con Carreras en Informátic
    corecore