963 research outputs found

    Overlay-Centric Load Balancing: Applications to UTS and B&B

    Get PDF
    International audienceTo deal with dynamic load balancing in large scale distributed systems, we propose to organize computing resources following a logical peer-to-peer overlay and to distribute the load according to the so-defined overlay. We use a tree as a logical structure connecting distributed nodes and we balance the load according to the size of induced subtrees. We conduct extensive experiments involving up to 1000 computing cores and provide a throughout analysis of different properties of our generic approach for two different applications, namely, the standard Unbalanced Tree Search and the more challenging parallel Branch-and-Bound algorithm. Substantial improvements are reported in comparison with the classical random work stealing and two finely tuned application specific strategies taken from the literature

    Algorithmic And Mathematical Programming Approaches To Scheduling Problems With Energy-Based Objectives

    Get PDF
    This dissertation studies scheduling as a means to address the increasing concerns related to energy consumption and electricity cost in manufacturing enterprises. Two classes of problems are considered in this dissertation: (i) minimizing the makespan in a permutation flow shop with peak power consumption constraints (the PFSPP problem for short) and (ii) minimizing the total electricity cost on a single machine under time-of-use tariffs (the SMSEC problem for short). We incorporate the technology of dynamic speed scaling and the variable pricing of electricity into these scheduling problems to improve energy efficiency in manufacturing.The challenge in the PFSPP problem is to keep track of which jobs are running concurrently at any time so that the peak power consumption can be properly taken into account. The challenge in the SMSEC problem is to keep track of the electricity prices at which the jobs are processed so that the total electricity cost can be properly computed. For the PFSPP problem, we consider both mathematical programming and combinatorial approaches. For the case of discrete speeds and unlimited intermediate storage, we propose two mixed integer programs and test their computational performance on instances arising from the manufacturing of cast iron plates. We also examine the PFSPP problem with two machines and zero intermediate storage, and investigate the structural properties of optimal schedules in this setting. For the SMSEC problem, we consider both uniform-speed and speed-scalable machine environments. For the uniform-speed case, we prove that this problem is strongly NP-hard, and in fact inapproximable within a constant factor, unless P = NP. In addition, we propose an exact polynomial-time algorithm for this problem when all the jobs have the same work volume and the electricity prices follow a so-called pyramidal structure. For the speed-scalable case, in which jobs can be processed at an arbitrary speed with a trade-off between speed and energy consumption, we show that this problem is strongly NP-hard and that there is no polynomial time approximation scheme for this problem. We also present different approximation algorithms for this case and test the computational performance of these approximation algorithms on randomly generated instances

    Algorithms for Scheduling Problems

    Get PDF
    This edited book presents new results in the area of algorithm development for different types of scheduling problems. In eleven chapters, algorithms for single machine problems, flow-shop and job-shop scheduling problems (including their hybrid (flexible) variants), the resource-constrained project scheduling problem, scheduling problems in complex manufacturing systems and supply chains, and workflow scheduling problems are given. The chapters address such subjects as insertion heuristics for energy-efficient scheduling, the re-scheduling of train traffic in real time, control algorithms for short-term scheduling in manufacturing systems, bi-objective optimization of tortilla production, scheduling problems with uncertain (interval) processing times, workflow scheduling for digital signal processor (DSP) clusters, and many more

    MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem

    Get PDF
    We consider the No-idle Permutation Flowshop Scheduling Problem (NPFSP) with a total tardiness criterion. We present two Mixed Integer Linear Programming (MILP) formulations based on positional and precedence variables, respectively. We study six local search procedures that explore two different neighborhoods by exploiting the MILP formulations. Our computational experiments show that two of the proposed procedures strongly outperform the state-of-the-art metaheuristic. We update 63% of the best known solutions of the instances in Taillards’ benchmark, and 77% if we exclude those instances for which we proved that the previous best known solutions are optimal

    Optimal scheduling for refueling multiple autonomous aerial vehicles

    Get PDF
    The scheduling, for autonomous refueling, of multiple unmanned aerial vehicles (UAVs) is posed as a combinatorial optimization problem. An efficient dynamic programming (DP) algorithm is introduced for finding the optimal initial refueling sequence. The optimal sequence needs to be recalculated when conditions change, such as when UAVs join or leave the queue unexpectedly. We develop a systematic shuffle scheme to reconfigure the UAV sequence using the least amount of shuffle steps. A similarity metric over UAV sequences is introduced to quantify the reconfiguration effort which is treated as an additional cost and is integrated into the DP algorithm. Feasibility and limitations of this novel approach are also discussed

    A survey of scheduling problems with setup times or costs

    Get PDF
    Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

    Solving large permutation flow-shop scheduling problems on GPU-accelerated supercomputers

    Get PDF
    Makespan minimization in permutation flow-shop scheduling is a well-known hard combinatorial optimization problem. Among the 120 standard benchmark instances proposed by E. Taillard in 1993, 23 have remained unsolved for almost three decades. In this paper, we present our attempts to solve these instances to optimality using parallel Branch-and-Bound tree search on the GPU-accelerated Jean Zay supercomputer. We report the exact solution of 11 previously unsolved problem instances and improved upper bounds for 8 instances. The solution of these problems requires both algorithmic improvements and leveraging the computing power of peta-scale high-performance computing platforms. The challenge consists in efficiently performing parallel depth-first traversal of a highly irregular, fine-grained search tree on distributed systems composed of hundreds of massively parallel accelerator devices and multi-core processors. We present and discuss the design and implementation of our permutation-based B&B and experimentally evaluate its parallel performance on up to 384 V100 GPUs (2 million CUDA cores) and 3840 CPU cores. The optimality proof for the largest solved instance requires about 64 CPU-years of computation-using 256 GPUs and over 4 million parallel search agents, the traversal of the search tree is completed in 13 hours, exploring 339 Tera-nodes

    Cloud manufacturing – scheduling as a service for sheet metal manufacturing

    Get PDF
    Cloud manufacturing refers to a new concept of using centralized cloud computing for manufacturing information systems to support distributed and dynamic collaborative manufacturing environment. The core of cloud manufacturing is to provide service to geographically distributed manufacturers centralized services. This paper introduces a cloud based production scheduling system for sheet metal manufacturing and discusses the requirements of scheduling as a service. A genetic algorithm based scheduling application has been developed to serve distributed manufacturing lines in form of cloud manufacturing. The characteristics of the prototype system are described and performance estimates are tested.fi=vertaisarvioitu|en=peerReviewed

    Parallel Branch-and-Bound in Multi-core Multi-CPU Multi-GPU Heterogeneous Environments

    Get PDF
    International audienceWe investigate the design of parallel B&B in large scale heterogeneous compute environments where processing units can be composed of a mixture of multiple shared memory cores, multiple distributed CPUs and multiple GPUs devices. We describe two approaches addressing the critical issue of how to map B&B workload with the different levels of parallelism exposed by the target compute platform. We also contribute a throughout large scale experimental study which allows us to derive a comprehensive and fair analysis of the proposed approaches under different system configurations using up to 16 GPUs and up to 512 CPU-cores. Our results shed more light on the main challenges one has to face when tackling B&B algorithms while describing efficient techniques to address them. In particular, we are able to obtain linear speed-ups at moderate scales where adaptive load balancing among the heterogeneous compute resources is shown to have a significant impact on performance. At the largest scales, intra-node parallelism and hybrid decentralized load balancing is shown to have a crucial importance in order to alleviate locking issues among shared memory threads and to scale the distributed resources while optimizing communication costs and minimizing idle time

    A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems

    Get PDF
    Solving exactly large scale instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel Branch and Bound algorithm for computational grids. We consequently propose new ways to efficiently deal with some crucial issues, mainly dynamic adaptive load balancing, fault tolerance, global information sharing and termination detection of the algorithm. A special coding of the work units distributed and folded/unfolded during the exploration of the search tree allows to optimize the involved communications. The algorithm has been implemented following a large scale idle time stealing paradigm. It has been experimented on a Flow-Shop problem instance (Ta056) that has never been solved exactly. The optimal solution has been found with proof of optimality within 25 days using about 1900 processors belonging to 9 Nation-wide distinct clusters (administration domains). During the resolution, the worker processors were exploited with an average to 97% while the farmer processor was exploited only 1.7% of the time. These two rates are good indicators on the parallel efficiency of the proposed approach and its scalability
    corecore