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 12 of 12 for “"Non-preemptive priority"”.
-
The delay composition theorem on pipeline systems with non-preemptive priority varying scheduling algorithms
… theorem, namely each task has the same relative priority across all stages. We extend the theorem to pipeline systems running non-preemptive scheduling algorithm which may assign different relative priorities to a task on different stages.
-
A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types
… a ConWIP execution system and introduce a new priority scheme to maximize the system performance. In this scheme, we identify the bottleneck machine based on overall workload and classify machines into two categories: the bottleneck machine and the non-bottleneck machine(s). Assemblies with the …
-
Medium access delay evaluation for distributed queueing dual bus (DQDB) MAC protocol
… modeled as a M/G/1 queueing system with a single priority level, then it is remodeled as a non-preemptive priority system with three priority levels. By employing these models, the approximate medium access delay analysis of a DQDB network is investigated for a metropolitan area network containing …
-
A queueing analysis of a multichannel, integrated voice and data communications system
… class with the shorter average length, is given non-preemptive priority over voice. The queueing model is analyzed as a continuous-time Markov chain with an infinite state space. The infinite set of steady state balance equations is truncated, then solved numerically using the linear programming …
-
ON PERIODIC REAL-TIME SCHEDULING ALGORITHMS
… are extended and generalized. The class of priority-driven algorithms is shown to be asymptotically optimal in time complexity. When tasks to be scheduled are dependent, an optimal algorithm and its characterization are devised and analyzed. A class of non-preemptive priority-driven …
-
Three Priority Queuing Models Motivated by Healthcare Management
In this thesis, we study three priority queueing models in healthcare management. In the first chapter, we analyze the impact of incentive misalignment between ED and physicians. We analyze two scheduling rules: physician self-schedule and centralized schedule. For the first scheduling rule, we …
-
Probabilistic Models for Order-Picking Operations with Multiple in-the-Aisle Pick Positions
… and two levels of pick positions are considered. Non-preemptive priority queueing and non-priority queueing models are used to analyze storage and retrieval requests in the MIAPP-NALT system. Retrieval requests are given a higher priority than storage requests; alternately, storage and retrieval …
-
Analysis of novel high-performance switch architectures for broadband-ISDN.
… a new scheduling policy called head-of-line priority selection, which reduces the head-of-line blocking and thus improves the performance of the LIB switch substantially. A 16 x 16 switch under uniform random traffic can achieve a throughput of 87.5%. A three-stage interconnection network …
-
Θέματα θεωρίας συστημάτων εξυπηρέτησης με επαναλαμβανόμενους πελάτες
… a close down period. The ordinary customers have preemptive repeat priority, when the server performs a start up time in order to serve a retrial customer, and non-preemptive priority when the server is busy with this type of customer. During the close down period no retrial customers can access …
-
An Application of Matrix Analytic Methods to Queueing Models with Polling
… policies that are considered include exhaustive, non-preemptive priority, and preemptive resume priority. In Chapter 3, this model is generalized to allow for a maintenance float of f spare machines that can be turned on to replace a failed machine. Additionally, the possible server behaviours are …
-
A Generalization of M/G/1 Priority Models via Accumulating Priority
Priority queueing systems are oftentimes set up so that arriving customers are placed into one of $N$ distinct priority classes. Moreover, to determine the order of service, each customer (upon arriving to the system) is assigned a priority level that is unique to the class to which it belongs. In …