Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 24 for “"list scheduling"”.

  1. Inherently stable priority list scheduling in an extended scheduling environment

    … addresses non-preemptive static priority list scheduling, a simple, low overhead approach to scheduling tasks on multiprocessors. This type of scheduling is subject to scheduling anomalies, one of which can cause deadlines to be missed by shortening the run-time of one or more tasks. Two …

    nebraska Repository record for Inherently stable priority list scheduling in an extended scheduling environment (opens in a new tab)

  2. List scheduling and simulated annealing in a HW/SW co-design environment

    … have been studied in numerous disciplines. The scheduling problem, in which finding the optimal solution cannot be defined in a polynomial time, belongs to this type of problem. Several methodologies for the scheduling problem have been described in order to obtain efficient results. This thesis …

    alabama Repository record for List scheduling and simulated annealing in a HW/SW co-design environment (opens in a new tab)

  3. Assessing Processor Allocation Strategies for Online List Scheduling of Moldable Task Graphs

    Scheduling a graph of moldable tasks, where each task can be executed by a varying number of processors with execution time depending on the processor allocation, represents a fundamental problem in high-performance computing (HPC). The online version of the scheduling problem introduces an …

    ku Repository record for Assessing Processor Allocation Strategies for Online List Scheduling of Moldable Task Graphs (opens in a new tab)

  4. On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling

    … account for this, compilers perform instruction scheduling after generating the output code. The instruction scheduling problem is to find an optimal schedule given the limitations and capabilities of the architecture. While this can be done optimally, a greedy algorithm known as list scheduling …

    waterloo Repository record for On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling (opens in a new tab)

  5. Suchbasierte Algorithmen für das Scheduling unabhängiger paralleler Tasks

    … zu den Prozessoren benötigt, welche mithilfe von Schedulingverfahren ermittelt werden kann. Jedoch ist bereits das Scheduling voneinander abhängiger Single-Prozessor-Tasks auf ein paralleles System mit zwei Prozessoren NP-schwer, weshalb zur Lösung von Schedulingproblemen häufig …

    qucosa-diss

  6. Stochastic instruction scheduling

    Instruction scheduling is a code reordering transformation used to hide latencies present in modern day microprocessors. Scheduling is often critical in achieving peak performance from these processors. The designer of a compiler's instruction scheduler has many choices to make, including the scope …

    rice Repository record for Stochastic instruction scheduling (opens in a new tab)

  7. Search-based Optimization for Compiler Machine-code Generation

    … nearly every level of compilation. Instruction Scheduling is one of the last compilation tasks. It is part of code generation. Instruction Scheduling replaces the internal graph representation of the program with an instruction sequence. The scheduler should produce some sequence that the …

    oregon Repository record for Search-based Optimization for Compiler Machine-code Generation (opens in a new tab)

  8. Instruction Scheduling for EDGE Architectures

    Instruction scheduling is a code reordering transformation used to hide latencies and expose parallelism in modern day microprocessors. Scheduling is often critical in achieving peak performance on these processors. The instruction scheduler is responsible for dispatching instructions to functional …

    texas Repository record for Instruction Scheduling for EDGE Architectures (opens in a new tab) Restricted access

  9. Mutli-objective trade-off exploration for Cyclo-Static and Synchronous Dataflow graphs

    … optimization of resource sharing, buffering and scheduling across a multi-dimensional latency-throughput-area objective space. This requires techniques that can find the Pareto-optimal set of implementations for the designer to choose from. In this work, we address the problem of multi-objective …

    texas Repository record for Mutli-objective trade-off exploration for Cyclo-Static and Synchronous Dataflow graphs (opens in a new tab)

  10. MASES : mobility and slack enhanced scheduler for synchronous dataflow graphs

    … requires optimization of pipelined scheduling of tasks on different processing elements (PEs). This poses the problem of finding the optimal solution across a multi-dimensional latency-throughput-area objective space. In this report, we address the problem of pipelined scheduling of …

    texas Repository record for MASES : mobility and slack enhanced scheduler for synchronous dataflow graphs (opens in a new tab)

  11. Spatial Scheduling Algorithms for Production Planning Problems

    … large-scale manufacturing industries. Spatial scheduling problems (SSP) involve the non-overlapping arrangement of jobs within a limited physical workspace such that some scheduling objective is optimized. Since jobs are heavy and occupy large areas, they cannot be moved once set up, requiring …

    vcu Repository record for Spatial Scheduling Algorithms for Production Planning Problems (opens in a new tab)

  12. An Ecosystem for Evaluating Domain-Specific System on Chip (DSSoC) Devices: Productive Application Deployment and Scheduling Perspectives

    … addressing these challenges through a uniquely holistic view of heterogeneous runtime design with respect to resource management and scheduling, accelerator integration, and compilation frameworks. The presentation opens with a discussion of resource management policies and presents novel …

    arizona-thes Repository record for An Ecosystem for Evaluating Domain-Specific System on Chip (DSSoC) Devices: Productive Application Deployment and Scheduling Perspectives (opens in a new tab)

  13. A Petri net formulation for the general scheduling problem

    … a new Petri net formulation for the general scheduling problem. The first part of this thesis concerns the development of the Petri net formulation. The Petri net formulation is a synthesis of concepts from three classes of Petri nets, marked graphs, timed Petri nets and coloured Petri nets. …

    ubc Repository record for A Petri net formulation for the general scheduling problem (opens in a new tab) Download PDF for A Petri net formulation for the general scheduling problem (opens in a new tab)

  14. Scheduling tasks with precedence constraints on heterogeneous distributed computing systems

    <p>Efficient scheduling is essential to exploit the tremendous potential of high performance computing systems. Scheduling tasks with precedence constraints is a well studied problem and a number of heuristics have been proposed.</p> <p>In this thesis, we first consider the problem of scheduling …

    utk-theses Repository record for Scheduling tasks with precedence constraints on heterogeneous distributed computing systems (opens in a new tab)

  15. Energy-Centric Scheduling for Real-Time Systems

    … dependent on the system speed. Real-time scheduling and energy efficiency are therefore tightly connected issues, being addressed together in this work. Several scheduling approaches for low energy are described in the thesis, most targeting variable speed processor architectures. At task …

    lund Repository record for Energy-Centric Scheduling for Real-Time Systems (opens in a new tab) Download PDF for Energy-Centric Scheduling for Real-Time Systems (opens in a new tab)

  16. Fair, responsive scheduling of engineering workflows on computing grids

    This thesis considers scheduling in the context of a grid computing system used in engineering design. Users desire responsiveness and fairness in the treatment of the workflows they submit. Submissions outstrip the available computing capacity during the work day, and the queue is only caught up …

    whiterose Download PDF for Fair, responsive scheduling of engineering workflows on computing grids (opens in a new tab)

  17. Objective-Driven Strategies for HPC Job Scheduling

    … packing efficiency and fairness, (2) advanced scheduling algorithms, and (3) job resource utilization prediction techniques. To ensure high relevance of the results, this study emphasizes scheduling objectives. Therefore, scheduling quality metrics are investigated first, yielding a set of …

    ucf Repository record for Objective-Driven Strategies for HPC Job Scheduling (opens in a new tab)

  18. Haima: Sistema de Informação de Apoio a Gestão de OPME para a Unidade de Hemodinâmica do Hospital Universitário Onofre Lopes

    … a large part of hospital processes, from scheduling the procedure to accounting information, through logistics, consumption and billing. This flow contributes to its assistance and marketing characteristics to be considered complex, since it involves patients, doctors, health …

    brazil-ufrn Repository record for Haima: Sistema de Informação de Apoio a Gestão de OPME para a Unidade de Hemodinâmica do Hospital Universitário Onofre Lopes (opens in a new tab)

  19. Approximation Algorithms for Scheduling and Fair Allocations

    … on two main topics, max-min allocation and schedulingjobs with precedent constraints on machines with communication delays. New approximation algorithms are given in Chapter 2, 4 and 5, where linear programming plays a fairly important role on algorithm designs, while Chapter 3 contains …

    washington Repository record for Approximation Algorithms for Scheduling and Fair Allocations (opens in a new tab)

  20. MULTI-SCALE SCHEDULING TECHNIQUES FOR SIGNAL PROCESSING SYSTEMS

    … the performance critically depends on the scheduling techniques, which in general allocate computation and communication resources for competing processing tasks in the application to optimize performance metrics such as power consumption, throughput, latency, and accuracy. Signal …

    maryland Repository record for MULTI-SCALE SCHEDULING TECHNIQUES FOR SIGNAL PROCESSING SYSTEMS (opens in a new tab)

Page 1 of 2