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 28 for “"Scheduling schemes"”.

  1. Analytical Modelling of Scheduling Schemes under Self-similar Network Traffic. Traffic Modelling and Performance Analysis of Centralized and Distributed Scheduling Schemes.

    … has drawn many research efforts. Traffic scheduling schemes which play a critical role in managing network transmission have been pervasively studied and widely implemented in various practical communication networks. In a sophisticated communication system, a variety of applications …

    bradford Repository record for Analytical Modelling of Scheduling Schemes under Self-similar Network Traffic. Traffic Modelling and Performance Analysis of Centralized and Distributed Scheduling Schemes. (opens in a new tab)

  2. Design and analysis of scalable scheduling schemes for high-speed input-queued packet switches

    … when using either maximum-weight matching schemes or iterative maximal-weight matching schemes with a significant speedup. These different approaches require either high computation complexity or high memory costs that can make them infeasible. Therefore, there is a need for low-complexity …

    njit Repository record for Design and analysis of scalable scheduling schemes for high-speed input-queued packet switches (opens in a new tab)

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

  4. Centralized Wireless Networks With User Arrivals and Departures

    … to systems with multiple user classes, and to scheduling schemes that use residual filesize information. For the latter problem, the performance of filesize based scheduling is compared with filesize unaware schemes.

    uiuc Repository record for Centralized Wireless Networks With User Arrivals and Departures (opens in a new tab)

  5. Group scheduling in cellular networks

    … of these resources is very much needed. Scheduling is a key component and having a scheduling scheme which can meet the Qos requirements such as Throughput, Fairness and Delay is important. A new dimension to scheduling known as Group Scheduling has been designed in this project. Common …

    umkc Repository record for Group scheduling in cellular networks (opens in a new tab)

  6. Performance evaluation of vector machine architectures

    … as a function of their architectural features, scheduling schemes, compiler optimization capabilities, and program parameters. The results of this study also provide a base for comparing vector machines with horizontal superscalar machines.

    uiuc Repository record for Performance evaluation of vector machine architectures (opens in a new tab)

  7. Maximizing throughput while maintaining fairness and priority in wireless ad-hoc networks

    … Graph or Conflict Matrix' and presented scheduling schemes to address issues like network throughput, fairness and QoS (priority) in a network. We particularly studied the transmission patterns in a network given a specific conflict graph which in turn depends on factors like number of …

    umkc Repository record for Maximizing throughput while maintaining fairness and priority in wireless ad-hoc networks (opens in a new tab)

  8. Performance Analysis of Wireless Networks with QoS Adaptations

    … affect the QoS provided by several queuing and scheduling schemes such as FIFO, priority, weighted fair queuing, and the application of the stretch-optimal algorithm to scheduling.

    unt Repository record for Performance Analysis of Wireless Networks with QoS Adaptations (opens in a new tab)

  9. Scheduling in multiple processor real-time systems.

    … to investigate the effects of different dynamic scheduling heuristic rules on the design of Real-Time Systems (RTS) which allow for the execution of complex responses. Complex responses are characterized by the concurrent nature of activity execution. RTS design will be done through the use of a …

    ottawa-retro Repository record for Scheduling in multiple processor real-time systems. (opens in a new tab)

  10. On Program Restructuring, Scheduling, and Communication for Parallel Processor Systems

    … covered are program restructuring, partitioning, scheduling and interprocessor communication, classification and utilization of program parallelism, and synchronization and hardware design issues of specialized units. All this work was performed focusing on a single goal: maximizing program …

    uiuc Repository record for On Program Restructuring, Scheduling, and Communication for Parallel Processor Systems (opens in a new tab)

  11. Chare kernel and its implementation on multicomputers

    … parallel programs. It is responsible for the scheduling of parallel actions--chares, and the manipulating of data exchange between chares, so that programmers can concentrate on exploring parallelism. The chare kernel provides several dynamic scheduling schemes to support applications with …

    uiuc Repository record for Chare kernel and its implementation on multicomputers (opens in a new tab)

  12. Ensuring Service Level Agreements for Composite Services by Means of Request Scheduling

    … problem this thesis focuses on using request scheduling for meeting Service Level Agreements (SLAs). The special focus is given to composite services specified by means of workflow languages. The proposed solution suggests using two level scheduling: global and local. The global policies …

    sask Repository record for Ensuring Service Level Agreements for Composite Services by Means of Request Scheduling (opens in a new tab)

  13. Quality and Utility - On the Use of Time-Value Functions to Integrate Quality and Timeliness Flexible Aspects in a Dynamic Real-Time Scheduling Environment

    Scheduling methodologies for real-time applications have been of keen interest to diverse research communities for several decades. Depending on the application area, algorithms have been developed that are tailored to specific requirements with respect to both the individual components of which an …

    passau-thes Repository record for Quality and Utility - On the Use of Time-Value Functions to Integrate Quality and Timeliness Flexible Aspects in a Dynamic Real-Time Scheduling Environment (opens in a new tab)

  14. A Visual Simulation Life-Cycle Of The Queston Physician Network

    … clinic to identify recommended staffing and scheduling schemes. Object-oriented programming allows the objects in the model to be instantiated at the time of execution. This feature permits the creation of one flexible generic clinic that can be reused to produce several identical clinics at …

    vt Repository record for A Visual Simulation Life-Cycle Of The Queston Physician Network (opens in a new tab)

  15. The bus structure for a polymorphic computer system

    … an insight into bus interaction for various scheduling schemes and system configurations, in order that these unique system architectures may evolve.<br/><br/>This Thesis discusses the issues relevant to the application of cellular computer systems and their projected performance …

    southwales Repository record for The bus structure for a polymorphic computer system (opens in a new tab)

  16. Applying Multi-Packet Reception with DTN in Vehicular Ad-hoc Networks

    … services by using self-organized routing schemes. VANET usually fits in Delay Tolerant Network (DTN) in which nodes are partially connected and existing path may not available between partial nodes due to limited distance for wireless transmissions. To achieve successful packets delivery …

    unm Repository record for Applying Multi-Packet Reception with DTN in Vehicular Ad-hoc Networks (opens in a new tab)

  17. Group scheduling for public safety communications in cellular networks

    … regardless of other groups' requirements. Group Scheduling is implemented in this project to achieve protected performance for different groups. Then schemes are developed to schedule between groups to achieve a tradeoff between throughput and fairness. Different scheduling schemes like Maximum …

    umkc Repository record for Group scheduling for public safety communications in cellular networks (opens in a new tab)

  18. Achieving Quality of Service in Group Scheduling in Cellular Networks

    … time and Non real time traffic which helps in scheduling priorities to the packets. With increase in need for QoS in the commercial networks, scheduling schemes such as MLWDF (Modified Largest Weighted Delay First) are playing a prominent role in deciding factors of packet selection. But most …

    umkc Repository record for Achieving Quality of Service in Group Scheduling in Cellular Networks (opens in a new tab)

  19. Demonstration of an Effective 4G LTE Network Simulator to Analyze Performance and Ensure Reliable Communication

    … Austria. Using this simulator we study different scheduling schemes to evaluate performance and demonstrate how important the role of scheduling scheme is to overcome network congestion. We study various features of LTE that help in increasing throughput for various traffic models over a network …

    umkc Repository record for Demonstration of an Effective 4G LTE Network Simulator to Analyze Performance and Ensure Reliable Communication (opens in a new tab)

  20. Scheduling policies for disks and disk arrays

    … to have stringent response time requirements. Scheduling of disk requests is intended to improve their response time, reduce disk service time, and increase disk access bandwidth with respect to the default FCFS scheduling policy. Shortest Access Time First policy has been shown to outperform …

    njit Repository record for Scheduling policies for disks and disk arrays (opens in a new tab)

Page 1 of 2