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 447 for “"Scheduling Algorithms"”.
-
Dynamic Scheduling Algorithms: Theory and Practice
… we investigate the dynamic problems of interval scheduling. The emphasis is on interval scheduling in the following contexts: single machine, multiple machines, and elastic mixed-criticality real-time systems. We analyze the complexity of these problems and find dynamic algorithms that …
-
Packet scheduling algorithms in LTE systems
… the QoS requirements for LTE networks, packet scheduling has been employed. Packet scheduling decides when and how different packets are delivered to the receiver. It is responsible for smart user packet selection to allocate radio resources appropriately. Therefore, packet scheduling should be …
-
Workflow Scheduling Algorithms in the Grid
… resources in the Grid, effective and efficient scheduling algorithms are fundamentally important. However, scheduling problems are well known for their intractability, and many of instances are in fact NP-Complete. The situation becomes even more challenging in the Grid circumstances due to some …
-
Scheduling Algorithms for Real-Time Systems
… following original contributions on real-time scheduling algorithms. The first topic studied in the thesis is minimizing the total penalty to be paid in scheduling a set of soft real-time tasks. The problem is NP-hard. We prove the properties of any optimal scheduling algorithm. We also derive …
-
Scheduling algorithms for high-speed switches
… low complexity. However, none of the existing algorithms can meet these requirements. Several algorithms for VOQ switches are introduced in this dissertation in order to improve upon existing algorithms in terms of implementation or QoS features. Initially, the earliest due date first matching …
-
Scheduling algorithms for improved CI performance
… This project evaluates the performance of seven algorithms for job scheduling in a Jenkins based CI environment. Using five separate performance metrics, we look at the trade-offs between different algorithms and discuss their relevance to the experience of using the CI service. Evaluations were …
-
ON PERIODIC REAL-TIME SCHEDULING ALGORITHMS
The problem of scheduling a set of periodic-time-critical tasks on a single-processor computing system is investigated. A periodic-time-critical task is a computational procedure consisting of an infinite sequence of requests, arising periodically, each of which has a prescribed deadline. The …
-
High-performance scheduling algorithms for wireless networks
The problem of designing scheduling algorithm for multi-channel (e.g., OFDM-based) wireless downlink networks is considered, where the system has a large bandwidth and proportionally large number of users to serve. For this system, while the classical MaxWeight algorithm is known to be …
-
Quality-Aware Scheduling Algorithms in Renewable Sensor
… renewable sensor networks via sensor duty cycle scheduling, where a renewable sensor network consisting of a set of heterogeneous sensors and a stationary base station need to be scheduled to monitor a set of targets in a monitoring area (e.g., some critical facilities) for a specified period, by …
-
Network Performance Analysis of Packet Scheduling Algorithms
Some of the applications in modern data networks are delay sensitive (e.g., video and voice). An end-to-end delay analysis is needed to estimate the required network resources of delay sensitive applications. The schedulers used in the network can impact the resulting delays to the applications. …
-
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 …
-
Crossbar scheduling algorithms for input-queued switches
… crossbar switches is to develop crossbar scheduling algorithms that can compute high-quality matchings -- i.e., those that result in high switch throughput (ideally 100%) and low queueing delays for packets -- yet have a very low time complexity to support high link speeds. Indeed, there …
-
Designing Scheduling Algorithms via a Mathematical Perspective
… S1} and \ref{chapter: S2} contain my work on scheduling with precedence constraints and communication delays. New algorithms for scheduling and resource allocation problems have far reaching implications, as problems in scheduling and resource allocation are a foundational playground for …
-
A performance evaluation of multiplexer scheduling algorithms
… device for service differentiation is the scheduling algorithms implemented at the switch and router queues. The objective of this thesis has been to provide a comprehensive performance study of these scheduling algorithms. The main scheduling algorithms are First In First Out (FIFO), …
-
Design of Scheduling Algorithms Using Game Theoretic Ideas
<p>Scheduling a set of jobs over a collection of machines to optimize a certain quality-of-service measure is one of the most important research topics in both computer science theory and practice. In this thesis, we design algorithms that optimize {\em flow-time} (or delay) of jobs for scheduling …
-
Energy-efficient scheduling algorithms for real -time systems
… analyze the problem of online energy aware I/O scheduling for embedded real-time systems. We introduce the concept of device slack to represent the length of time that a device can be put in the low power state without causing any job to miss its deadline. Based on the concept of device slack, …
Page 1 of 23