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 38 for “"Fair scheduling"”.

  1. Fair scheduling in high performance computing environments

    … introduces a new scheduler—the Rawlsian Fair scheduler—which can distribute resources fairly in situations in which users with different usage profiles are competing for resources in a large, shared computing environment. The Rawlsian Fair scheduler is demonstrated to increase performance …

    ttu Repository record for Fair scheduling in high performance computing environments (opens in a new tab)

  2. Efficient and Fair Scheduling for Wireless Networks

    We then consider the problem of fair end-to-end resource allocation in wireless networks. First, we consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different receiver. The channel …

    uiuc Repository record for Efficient and Fair Scheduling for Wireless Networks (opens in a new tab)

  3. Fair Scheduling in Cloud Datacenters with Multiple Resource Types

    … algorithm design and prototype implementation of fair sharing policies in cloud datacenters with multiple resource types. Specifically, it seeks to address two fundamental resource management problems. First, how should the the computing resources of a large-scale cluster -– such as CPU cores, …

    toronto-retro Repository record for Fair Scheduling in Cloud Datacenters with Multiple Resource Types (opens in a new tab)

  4. A new localized approach to distributed fair scheduling in multihop wireless networks

    Fairness is an important design criteria for medium access control protocol in multi-hop wireless networks. Fairness is a complex problem due to its many dimensions that include consideration of location-dependent contention, spatial reuse of channels, and desire to achieve fully distributed …

    iastate Repository record for A new localized approach to distributed fair scheduling in multihop wireless networks (opens in a new tab)

  5. Fair scheduling in wireless ad-hoc networks of location dependent channel errors

    … the wireless networks has brought the issue of fair allocation of bandwidth among the users. Besides the issues in wired networks scheduling, wireless network has to take into account the characteristics of wireless channel, such as channel errors, location dependent contention, hidden or …

    iastate Repository record for Fair scheduling in wireless ad-hoc networks of location dependent channel errors (opens in a new tab)

  6. Per-session weighted fair scheduling for real time multimedia in multi-rate wireless local area networks

    … a framework that centralizes the task of scheduling uplink and downlink flows in the access point through the concept of virtual packets. We propose a new queuing structure that works with a fair generalized processor sharing based scheduler, integrated with a traffic shaper, for …

    ubc Repository record for Per-session weighted fair scheduling for real time multimedia in multi-rate wireless local area networks (opens in a new tab) Download PDF for Per-session weighted fair scheduling for real time multimedia in multi-rate wireless local area networks (opens in a new tab)

  7. Structure-utilized, Adaptive, and Efficient ML-based Proportional-Fair Scheduling in MIMO Networks for Non-stationary Channels

    Proportional Fair (PF) scheduling is widely used in multi-user MIMO systems to balance throughput and fairness. However, PF scheduling is an NP-hard problem, and hence, practical deployments approximate the optimal solution for lower latency at the cost of sub-optimal performance. More recently, …

    rice Repository record for Structure-utilized, Adaptive, and Efficient ML-based Proportional-Fair Scheduling in MIMO Networks for Non-stationary Channels (opens in a new tab)

  8. Design and Evaluation of Packet Scheduling Algorithms for Providing Quality of Service in Wireless Cellular Networks

    … three algorithms with four other wireless fair scheduling algorithms in this area, and we conclude through both simulations and analysis that WFS is one of the two algorithms that possess all the properties of wireless fair service.

    uiuc Repository record for Design and Evaluation of Packet Scheduling Algorithms for Providing Quality of Service in Wireless Cellular Networks (opens in a new tab)

  9. Lottery Scheduling in the Linux Kernel: A Closer Look

    … performance for a variety of process types, and fair scheduling behavior. Testing is performed, along with an analysis of the results measuring the lottery scheduler against these characteristics. Lottery scheduling is found to provide better than average control over the relative execution rates …

    calpoly Repository record for Lottery Scheduling in the Linux Kernel: A Closer Look (opens in a new tab)

  10. Delay-Optimal MAC Level LTE Scheduling Using Deep Reinforcement Learning for Downlink

    … thesis is to introduce a novel method of LTE scheduling and comparing it to previous research on the same topic. The motivation is to introduce deep reinforcement learning techniques to downlink LTE scheduling in order to find a delay optimal method of scheduling users in an LTE network. …

    buffalo Repository record for Delay-Optimal MAC Level LTE Scheduling Using Deep Reinforcement Learning for Downlink (opens in a new tab)

  11. Scheduling with QoS in parallel I/O systems

    … data centers. It is challenging to provide a scheduling technique that maximizes throughput and can provide QoS guarantees. In this thesis we first introduce the problem of maximizing the throughput for a parallel I/O system that is simultaneously accessed by several concurrent applications. …

    rice Repository record for Scheduling with QoS in parallel I/O systems (opens in a new tab)

  12. Self Synchronization of Moving Vehicles

    … dissertation, we investigate and develop a novel scheduling scheme for conflict-free movement of vehicles at road intersections. We claim that our scheduling scheme not only guarantees conflict-free movement at any intersection, it also provides nonstop movement for the maximum possible number of …

    umkc Repository record for Self Synchronization of Moving Vehicles (opens in a new tab)

  13. Distance-Aware Relay Placement and Scheduling in Wireless Networks.

    … such as relay station placement problems and scheduling problems. In this thesis, I studied a distance-aware relay placement problem and max-min fair scheduling problem in WiMAX mesh networks. To solve these problems, approximation algorithms and heuristic algorithms are proposed. Theoretical …

    ndsu Repository record for Distance-Aware Relay Placement and Scheduling in Wireless Networks. (opens in a new tab)

  14. Distributed Monte Carlo Simulation

    … to support the simulations of multiple users, a scheduling algorithm is required to allocate resources among the users' jobs. In this thesis, a scheduling algorithm is developed that is suitable for Monte Carlo simulation and utilizes the available distributed-computing resources. The unified …

    wvu Repository record for Distributed Monte Carlo Simulation (opens in a new tab)

  15. The Influence of Labor and Employment Conditions on Worker’s Health in the United States

    … schedules, a potential consequence of preempted fair scheduling laws, are getting ‘under the skin’ of workers at young adulthood and early mid-life using biomarkers of cardiovascular health (CVH). I also examine whether CVH outcomes vary by gender, race/ethnicity, education, or employment in the …

    washington Repository record for The Influence of Labor and Employment Conditions on Worker’s Health in the United States (opens in a new tab)

  16. Opportunistic transmission scheduling for next generation wireless communication systems with multimedia services

    … and support of multiple QoS, the transmission scheduling plays a key role in the efficient resource allocation process in wireless systems. The fundamental problem of scheduling the users' transmissions and allocating the available resources in a realistic CDMA wireless system that supports …

    njit Repository record for Opportunistic transmission scheduling for next generation wireless communication systems with multimedia services (opens in a new tab)

  17. Exploiting Interference in Wireless Networks

    … of networks, namely, networks with centralized scheduling with certain goals (such as maximum throughput scheduling and proportional fair scheduling), random access (i.e., ALOHA like) networks and networks with linear coding capability are studied.

    calgary Repository record for Exploiting Interference in Wireless Networks (opens in a new tab)

  18. Controlled virtual time advancement in conjoined emulation and network simulation

    … and fixed a subtle design flaw in TimeKeeper’s scheduling mechanism which could potentially starve some processes of CPU time during execution. The purpose of this thesis is twofold (1) to describe improvements to TimeKeeper’s design including the logic to ensure fair scheduling and (2) to …

    uiuc Repository record for Controlled virtual time advancement in conjoined emulation and network simulation (opens in a new tab)

  19. Quality of service support in the backbone network of the Universal Mobile Telecommunications Systems using DiffServ model

    … router. This thesis proposes an efficient, fair scheduling and link sharing system called DDB - FFQ , which has the capability of assigning decoupled delay bounds and bandwidth allocations. This paper also studies the implementation of Random Early Detection (RED) on a shared-memory buffer …

    ubc Repository record for Quality of service support in the backbone network of the Universal Mobile Telecommunications Systems using DiffServ model (opens in a new tab) Download PDF for Quality of service support in the backbone network of the Universal Mobile Telecommunications Systems using DiffServ model (opens in a new tab)

Page 1 of 2