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 144 for “"scheduling algorithms"”.

  1. 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 …

    queens Repository record for Scheduling Algorithms for Real-Time Systems (opens in a new tab)

  2. 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 …

    uts Repository record for Packet scheduling algorithms in LTE systems (opens in a new tab)

  3. 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 …

    njit Repository record for Scheduling algorithms for high-speed switches (opens in a new tab)

  4. Scheduling algorithms for arbitrary communication networks

    We consider the problem of designing scheduling schemes for networks with arbitrary topology and scheduling constraints. We address the optimality of scheduling schemes for packet networks in terms of throughput, delay and fairness. Specifically, we design two scheduling schemes. The first one …

    mit Repository record for Scheduling algorithms for arbitrary communication networks (opens in a new tab)

  5. 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

    duke Repository record for Design of Scheduling Algorithms Using Game Theoretic Ideas (opens in a new tab)

  6. Optimal scheduling algorithms for ad hoc wireless networks

    It is well known that the MaxWeight scheduling algorithm is throughput-optimal in wireless networks. However, its complexity is exponential in the number of links in an ad hoc network. In this work, we consider a greedy variant of the MaxWeight algorithm, called Longest Queue First (LQF). A …

    uiuc Repository record for Optimal scheduling algorithms for ad hoc wireless networks (opens in a new tab)

  7. Scheduling algorithms for throughput maximization in data networks

    … performance implications of throughput optimal scheduling in physically and computationally constrained data networks. We study optical networks, packet switches, and wireless networks, each of which has an assortment of features and constraints that challenge the design decisions of network …

    mit Repository record for Scheduling algorithms for throughput maximization in data networks (opens in a new tab)

  8. Online scheduling algorithms for broadcasting and general cost functions

    In this thesis we study scheduling problems that occur in the client server setting. In this setting there are a set of jobs that are sent by clients over time to a sever. There is a scheduler at the sever that determines how the jobs should be processed. The goal of the scheduler is to process the …

    uiuc Repository record for Online scheduling algorithms for broadcasting and general cost functions (opens in a new tab)

  9. Scheduling algorithms to improve utilization in toroidal-interconnected systems

    … thesis presents the analysis and application of scheduling algorithms that augment a baseline first come first serve (FCFS) scheduler. Restricting ourselves to space-sharing techniques, which constitute a simpler solution to the requirements of cellular computing, we present simulation results …

    mit Repository record for Scheduling algorithms to improve utilization in toroidal-interconnected systems (opens in a new tab)

  10. Scheduling algorithms for high-speed data service over CATV

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1998.

    mit Repository record for Scheduling algorithms for high-speed data service over CATV (opens in a new tab)

  11. An Experimental Evaluation of Real-Time DVFS Scheduling Algorithms

    … The literature presents numerous RT-DVFS scheduling algorithms, which employ different techniques to utilize the CPU idle time to scale the frequency. Many of these algorithms have been experimentally studied through simulations, but have not been implemented on real hardware platforms. …

    vt Repository record for An Experimental Evaluation of Real-Time DVFS Scheduling Algorithms (opens in a new tab)

  12. Online scheduling algorithms for average flow time and its variants

    This dissertation focuses on scheduling problems that are found in a client-server setting where multiple clients and one server (or multiple servers) are the participating entities. Clients send their requests to the server(s) over time, and the server needs to satisfy the requests using its …

    uiuc Repository record for Online scheduling algorithms for average flow time and its variants (opens in a new tab)

  13. Effective Scheduling Algorithms for Cross-Interference Mitigation in Heterogeneous Wireless Networks

    … this thesis presents a novel centralized scheduling mechanism in the time domain to harmonize coexistence of Wi-Fi and LR-WPAN, also refer to as time-slot based scheduling mechanism. The mechanism is achieved by introducing a new command frame, named Access Notification (AN), into the …

    essex Repository record for Effective Scheduling Algorithms for Cross-Interference Mitigation in Heterogeneous Wireless Networks (opens in a new tab)

  14. Tradeoff evaluation of scheduling algorithms for terminal-area air traffic control

    … is also demonstrated that the proposed aircraft scheduling algorithm can be applied to the optimization problem for the coupled operations of arrivals and departures on a single runway.

    mit Repository record for Tradeoff evaluation of scheduling algorithms for terminal-area air traffic control (opens in a new tab)

  15. Efficient scheduling algorithms for quality-of-service guarantees in the Internet

    … networks - and we found that the same set of scheduling techniques can be applied successfully in all these cases to provide per-flow bandwidth, delay and max-min fairness guarantees. We formulated the abstract scheduling problems as a sum of two aspects. First, the particular problem setting …

    mit Repository record for Efficient scheduling algorithms for quality-of-service guarantees in the Internet (opens in a new tab)

  16. Scheduling algorithms for throughput maximization in time-varying networks with reconfiguration delays

    … wireless transmission. We propose control algorithms that stabilize the system whenever possible and have optimal delay scaling. Next, we consider a general queuing network model under reconfiguration delays and interference constraints which includes wireless, satellite and optical …

    mit Repository record for Scheduling algorithms for throughput maximization in time-varying networks with reconfiguration delays (opens in a new tab)

  17. Dynamic rate-control and scheduling algorithms for quality-of-service in wireless networks

    … this thesis, we develop dynamic rate-control and scheduling algorithms to meet quality-of-service requirements on data while making efficient utilization of resources. Ideas from Network Calculus theory, Continuous-time Stochastic Optimal Control and Convex Optimization are utilized to obtain a …

    mit Repository record for Dynamic rate-control and scheduling algorithms for quality-of-service in wireless networks (opens in a new tab)

  18. Design and analysis of a scalable terabit multicast packet switch : architecture and scheduling algorithms

    … three novel switch architectures with cooperated scheduling algorithms to design a terabit backbone switch/router which is able to deliver large capacity, multicasting, and high performance along with Quality of Service (QoS). Our switch designs benefit from unique features of modular switch …

    njit Repository record for Design and analysis of a scalable terabit multicast packet switch : architecture and scheduling algorithms (opens in a new tab)

  19. The delay composition theorem on pipeline systems with non-preemptive priority varying scheduling algorithms

    … to pipeline systems running non-preemptive scheduling algorithm which may assign different relative priorities to a task on different stages.

    uiuc Repository record for The delay composition theorem on pipeline systems with non-preemptive priority varying scheduling algorithms (opens in a new tab)

Page 1 of 8