NDLTD logo NDLTD Union Catalog and Global ETD Search

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 13 of 13 for “"process scheduling"”.

  1. Statistical closed-loop process scheduling

    Remus, James D.

    rit Repository record

  2. Smart scheduling : optimizing Tilera's process scheduling via reinforcement learning

    Hanus, DeborahMassachusetts Institute of Technology2013

    As multicore processors become more prevalent, system complexities are increasing. It is no longer practical for an average programmer to balance all of the system constraints to ensure that the system will always perform optimally. One apparent solution to managing these resources efficiently is …

    mit Repository record

  3. Optimizing Integrated Continuous Biomanufacturing Throughput: Resource Constraints and Process Scheduling

    Haddad, AnaMassachusetts Institute of Technology2024

    … models will be created to evaluate optimal process scheduling given resource constraints. The analysis results showed that, at this time, labor is not a constraint to the system’s available capacity and that improvements to process scheduling can increase the system’s throughput at current …

    mit Repository record

  4. Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems

    Hegazy, Tamir A.Virginia Tech2001

    … an adaptation model is considered where processes are replicated for sharing workload increases. A real-time Ethernet system model is considered where message collisions are resolved. Given such models, the objective is to maximize aggregate application benefit and minimize aggregate …

    vt Repository record

  5. Implementing pull production within an aerospace assembly operation

    Lennox, Kevin MichaelMassachusetts Institute of Technology2006

    … and scheduled at multiple points in the process, to a pull system driven by a bin size or finished goods supermarket. Some of the key issues addressed include system design for highly variable processes, experimentation with various forms of Kanban, and the use of value stream mapping as …

    mit Repository record

  6. Verifying the Performance of Network Control Algorithms

    Arun, VenkatMassachusetts Institute of Technology2023

    … tools to analyze congestion control and process scheduling algorithms. These tools prove performance properties and find counter-examples where widely deployed heuristics fail. We will also prove that current end-to-end congestion control algorithms that bound delay cannot avoid …

    mit Repository record

  7. Achieving predictable timing and fairness through cooperative polling

    Sinha, AnirbanUniversity of British Columbia2007

    … this work, we present a starvation-free, fair, process scheduling algorithm that provides predictable and low latency execution without the use of reservations and assists adaptive time sensitive tasks with achieving consistent quality through cooperation. We combine an event-driven application …

    ubc Repository record

  8. Performance evaluation of an auction based manufacturing system using generalized stochastic Petri nets.

    Biswas, Shubhabrata.University of Windsor1995

    … eliminates the requirement of a costly pre process scheduling run, which can prove to be inappropriate in the event of unforseen machine breakdowns or changes in machining capacities. One of the major drawbacks is the lack of predictability of the exact behaviour of the shop floor. It is …

    windsor Repository record

  9. Rethinking the design and implementation of the i/o software stack for high-performance computing

    Zhang, Xuechen2012

    … different layers, including operating system process management layer and MPI-IO middleware layer on compute server side, and parallel file system layer and disk I/O scheduling layer on data server side. This dissertation makes four contributions towards solving each of the issues.</p> …

    wayne-thes Repository record

  10. An investigation into the parallel implementation of JPEG for image compression

    Darbyshire, PaulVictoria University of Technology1998

    … to be run on a group of transputers. The processor-farm paradigm is adopted. This research shows this to be the best paradigm for use with the JPEG baseline algorithm on the measured component times within the algorithm. The speedup of the parallel algorithm is investigated and measured …

    vu-aus Repository record

  11. Scheduling on Asymmetric Architectures

    Blagojevic, FilipVirginia Tech2008

    We explore runtime mechanisms and policies for scheduling dynamic multi-grain parallelism on heterogeneous multi-core processors. Heterogeneous multi-core processors integrate conventional cores that run legacy codes with specialized cores that serve as computational accelerators. The term …

    vt Repository record

  12. Implementace jednoduchého operačního systému

    Bucek, MatějVysoké učení technické v Brně. Fakulta informačních technologií

    Tato práce se zabývá návrhem a implementací jednoduchého operačního systému pro architekturu RISC-V v jazyce C++. Systém využívá OpenSBI (SEE) a U-Boot pro zavedení a poskytuje základní funkcionalitu, včetně správy a ochrany paměti, plánování procesů, ovladačů zařízení a částečné podpory …

    brno-tech Repository record

  13. ΑΝΑΛΥΣΗ ΚΑΙ ΣΧΕΔΙΑΣΜΟΣ ΤΟΥ ΠΥΡΗΝΑ ΤΟΥ ΛΕΙΤΟΥΡΓΙΚΟΥ ΣΥΣΤΗΜΑΤΟΣ ΤΗΣ ΠΟΛΥΕΠΕΞΕΡΓΑΣΤΙΚΗΣ ΜΗΧΑΝΗΣ SIMULA

    Παπασπυρόπουλος, ΓεώργιοςΠανεπιστήμιο Πατρών1989

    … (DES) IS THE LEAST IMPACTED BY PARALLEL PROCESSING EVEN THOUGH MOST OF ITS APPLICATIONS REQUIRE TREMENDOUS AMOUNTS OF PROCESSING TIME. THE COMMON APPROACH OF PARALLELIZING INDIVIDUALLY SPECIAL PURPOSE PROGRAMS LEADS TO VERY LIMITED IMPROVEMENTS IN PERFORMANCE. WE PROPOSE HERE THE …

    greece Repository record