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

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

  2. Fair Scheduling and Resource Allocation for Public Services

    … and well-being of communities. Efficient and fair outcomes of such operations are needed to ensure the resources are well-utilized and their benefit is distributed fairly. In this thesis, we study the tradeoffs between efficiency and fairness for prediction, allocation, and ranking tasks. …

    uic

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

  4. 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)

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

  6. Learned scheduling for database management systems

    … database management systems need efficient job scheduling. Currently systems use simple heuristics ignoring the characteristics of database workloads. Therefore, we created an effective scheduler that uses machine learning techniques, such as reinforcement learning and neural networks, and does …

    mit Repository record for Learned scheduling for database management systems (opens in a new tab)

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

  8. 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)

  9. 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)

  10. 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)

  11. 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)

  12. 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)

  13. Adaptive radio resource management schemes for the downlink of the OFDMA-based wireless communication systems

    … that distribute the scarce resources more fairly among network users while efficiently using the resources to maximize system throughput. Four scheduling algorithms have been formulated and analysed based on fairness, throughputs and delay. This was done for users demanding different …

    cape-town Repository record for Adaptive radio resource management schemes for the downlink of the OFDMA-based wireless communication systems (opens in a new tab)

  14. Dynamic Channel -Aware Bandwidth Management in IEEE 802.11 Networks

    … allocation by the central BM, in this work: fair, price-based, and utility-based. All our channel allocation policies endeavor to provide minimum throughput guarantees to the network flows. In the absence of wireless fair scheduling at the MAC-layer in current IEEE 802.11 products, we propose …

    uiuc Repository record for Dynamic Channel -Aware Bandwidth Management in IEEE 802.11 Networks (opens in a new tab)