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 82 for “"FCFS"”.

  1. Local-spin Algorithms for Variants of Mutual Exclusion Using Read and Write Operations

    … known algorithm for first- come-first-served (FCFS) ME that has O(log N) RMR complexity in both the DSM and CC models, and uses only atomic reads and writes. Our algorithm is also adaptive to point contention, i.e., the number of processes that are simultaneously active during a passage by some …

    toronto-retro Repository record for Local-spin Algorithms for Variants of Mutual Exclusion Using Read and Write Operations (opens in a new tab)

  2. A study of three classes of sequencing rules in a simulated job shop

    … rules used were First Come First Serve (FCFS), Shortest Processing Time (SPT), and Probability Sequencing (PS). Due date performance, number of jobs processed in a simulated interval, number of jobs late, mean lateness and in-process inventory level were the measures of performance used. …

    vt Repository record for A study of three classes of sequencing rules in a simulated job shop (opens in a new tab)

  3. Resource Allocation Strategies for Multiple Job Classes

    … and dedicated allocation (DA). For the case of FCFS scheduling, analytic results for response time distribution are used to develop a heuristic algorithm that determines the allocation strategy (SA or DA) that requires fewer processor nodes. The effectiveness of this algorithm is evaluated over …

    waterloo Repository record for Resource Allocation Strategies for Multiple Job Classes (opens in a new tab)

  4. An investigation of the dispatching and expediting rules in buffer management : a thesis presented in partial fulfilment of the requirements for the degree of Master of Technology in Production Technology at Massey University

    … dispatching rules are First-Come-First-Served (FCFS), Shortest Processing Time (SPT) and Minimum Slack Time (MINSLK). Both static and dynamic expediting rules are compared. Reduction in the coefficient of variance for processing times from 100% to 50% corresponds to the process of quality …

    massey Repository record for An investigation of the dispatching and expediting rules in buffer management : a thesis presented in partial fulfilment of the requirements for the degree of Master of Technology in Production Technology at Massey University (opens in a new tab)

  5. A QUEUING MODEL OF THE UNIVERSITY OF KANSAS PACKET-SWITCHING NETWORK

    … of the hardware components are represented as FCFS load-independent servers. The model is evaluated using the Bard-Schweitzer approximation to a modification of the basic Mean Value Analysis algorithm for evaluating multiclass queuing networks. The MVA algorithm is modified to account for …

    ku Repository record for A QUEUING MODEL OF THE UNIVERSITY OF KANSAS PACKET-SWITCHING NETWORK (opens in a new tab)

  6. Laser spectroscopy investigations of jet-cooled metal-containing free radicals.

    … Accurate determination of Franck-Condon factors (FCFs) is critical to laser cooling. Traditionally, FCFs of MORs are determined in LIF/DF measurements. However, the accuracy of so determined FCFs is limited by the interference of the scattering of the excitation laser. In addition, when a pulsed …

    louisville Repository record for Laser spectroscopy investigations of jet-cooled metal-containing free radicals. (opens in a new tab)

  7. GPU compute memory systems

    … First-Ready First-Come First-Serve (FR-FCFS) memory scheduling policy. To stress the proposed model, a massively multithreaded architecture based upon contemporary high-end GPUs is simulated to generate the memory address trace needed. The results show that the hybrid analytical model …

    ubc Repository record for GPU compute memory systems (opens in a new tab) Download PDF for GPU compute memory systems (opens in a new tab)

  8. Large grain data-flow graph restructuring for EMSP signal processing benchmarks on the ECOS workstation system

    … methodology for forcing First Come First Served (FCFS) schedulers to follow a more systematic utilization of available resources. The methods of implementation used take advantage of the Graphical Editor (gred) to insert additional data dependencies into the program structure. The thesis utilizes …

    nps Repository record for Large grain data-flow graph restructuring for EMSP signal processing benchmarks on the ECOS workstation system (opens in a new tab)

  9. A delayed response policy for autonomous intersection management

    … work proposed the first-come-first-served (FCFS) policy in which the reservation requests are served as soon as they are received. The results of simulation show that FCFS outperforms the current traffic systems, traffic light and stop sign, by orders of magnitude. We, however, observe that …

    texas Repository record for A delayed response policy for autonomous intersection management (opens in a new tab)

  10. Resource scheduling strategies to optimise QoS in integrated IoT and fog computing environments

    … various other existing approaches like PSO, FCFS, and JSF by 86.09%, 98.53%, and 98.02% respectively, in terms of total network usage. Additionally, in terms of loop delay, it achieves improvements of 68.64% over PSO, 92.07% over FCFS, and 76.26% over SJF. Furthermore, it presents a novel …

    lancaster Download PDF for Resource scheduling strategies to optimise QoS in integrated IoT and fog computing environments (opens in a new tab)

  11. Scheduling with privacy constraints

    … resource schedulers. The first-come-first-serve (FCFS) scheduling policy and time-division-multiple-access (TDMA) are identified as two extreme policies on the privacy metric, FCFS has the least, and TDMA has the highest. However, on performance based metrics, such as throughput and delay, it is …

    uiuc Repository record for Scheduling with privacy constraints (opens in a new tab)

  12. Generalised analytic queueing network models. The need, creation, development and validation of mathematical and computational tools for the construction of analytic queueing network models capturing more critical system behaviour.

    … closed networks of First-Come-First-Served (FCFS) centres with general service times. The multiserver extension using the building block is validated. Finally the Maximum Entropy approximation is extended to FCFS centres with multiple chains and implemented with computationally efficient …

    bradford Repository record for Generalised analytic queueing network models. The need, creation, development and validation of mathematical and computational tools for the construction of analytic queueing network models capturing more critical system behaviour. (opens in a new tab)

  13. Scheduling techniques for multiple processor systems in real-time environments

    … at run-time using a First-Come-First-Served (FCFS) policy. Research by Shukla and Zaky Shukla 91 developed a new algorithm, the Revolving Cylinder(RC), to ameliorate the inherently non-deterministic output flow of the FCFS scheduling approach currently used in the system. Although the RC …

    nps Repository record for Scheduling techniques for multiple processor systems in real-time environments (opens in a new tab)

  14. Multiuser Usability of Collaborative Virtual Environments

    … models such as the first-come-first-serve (FCFS) model have a problem of disregarding the vital socio-human need of equality in interaction (i.e., EII). This problem may impair the suitability of a model. Other components of a collaborative VE, including interaction devices and communication …

    calgary Repository record for Multiuser Usability of Collaborative Virtual Environments (opens in a new tab)

  15. FLIGHT ARRIVAL SCHEDULING MODELS FOR INCORPORATING COLLABORATIVE DECISION-MAKING CONCEPTS INTO TIME-BASED FLOW MANAGEMENT

    … with the default first-come-first-served (FCFS) scheme. Monte Carlo simulations are conducted using historical flights data under a variety of realistic scenarios. Results show that our proposed heuristic, 2OptSwap, could reduce CTA delay cost between 20% and 30% relative to the FCFS …

    maryland Repository record for FLIGHT ARRIVAL SCHEDULING MODELS FOR INCORPORATING COLLABORATIVE DECISION-MAKING CONCEPTS INTO TIME-BASED FLOW MANAGEMENT (opens in a new tab)

Page 1 of 5