fcfs

Caveat : we will not be able to accomodate all requests , we reserve the right to choose candidates on a FCFS basis .

敬告：我们不会容纳所有的要求，我们保留按先来先服务原则选择合作者。

A model of system simulation based on FCFS queue dispatching method for multiprocessor system

一种基于FCFS调度策略的多处理机系统的仿真模型

The research about the scheduling algorithm . The contents include : the FCFS algorithm ;

上行信道调度算法的研究，具体内容包括：先到先服务（FCFS）算法的研究；

Different with the traditional FCFS discipline , the strategy of feedback priority was proposed .

不同于传统的先进先出服务规则，提出了反馈优先的服务策略。

FCFS Dynamic Optimized Patching Multicast is used in service for lukewarm movies .

采用FCFS动态窗口优化补缀多播算法来满足一般影片的点播请求。

First the establishment of mathematical model for the FCFS process scheduling algorithm , then theoretical analysis on the model and last experimental simulation .

本文先建立了FCFS进程调度算法的数学模型，再对模型先进行理论分析和实验模拟。

As for the allocation of data slots , the paper adopts a simple FCFS ( First Come First Serve ) algorithm .

对于数据时隙的分配，采用了最简单的先来先服务（FCFS）算法。

The FCFS with priority algorithm ;

支持优先级的FCFS算法的研究；

At last , it is proved this arithmetic could overcome the disadvantage of FCFS in delay equity and partition service .

最后，证明了该算法在克服FCFS算法在延迟公平和服务请求大小区分方面不足的有效性。

Based the model parameters , it presents QoS parameters of FCFS , PQ , WRR and WFQ scheduling algorithms .

结合该模型的相关参数，给出了FCFS，PQ，WRR以及WFQ调度算法的QoS指标。

By means of network calculus , the real time behavior of switched EtherNet with FCFS scheduling and IEEE 802.1P scheduling were analyzed .

基于网络演算理论，对FCFS调度和IEEE802.1P调度的交换式以太网实时性进行了分析。

Backfilling is based on the FCFS algorithm , which backfills smaller queued jobs into idle CPUs to improve CPU utilization .

该算法是在FCFS算法的基础上，将队列中较小的作业回填（Backfill）到空闲CPU，以提高CPU利用率。

The efficiency and reliability of the ACA for the ASP was investigated by comparing the sequencing results of FCFS method for different numbers of landing aircraft .

通过比较FCFS调度方法和ASP蚁群算法对不同航班队列的排序结果验证了ASP蚁群算法求解问题的可行性和求解效果。

The numerical examples show that compared to the sorting method with the traditional FCFS way , the algorithm can significantly reduce the cost of distribution centers and improve picking efficiency .

算例表明，与传统先到先服务的分拣方法相比，该算法的应用能够明显降低配送中心成本，提高分拣效率，具有良好的应用前景。

This paper analyzes the statistical characteristic of the request service time , and models the Web server and Web server cluster with M / G / 1 FCFS queuing model .

本文分析了Web请求服务时间的数字特性，并使用M/G/1FCFS排队模型对Web服务器及Web集群服务器进行了建模。

And we analyze three task scheduling schemes based on this task set module , which include hybrid preemptive scheduling , priority-based grouping scheduling and FCFS scheduling .

在该任务模型上分析了二种任务调度机制，包括基于优先级的分组调度机制、混合抢占调度机制、FCFS调度机制。

A queuing model was first built for the pipeline computer system . This model is M / D / 1 / ∞ / FCFS with multiple constant vacations and cycle service .

首次为流水线计算机系统结构建立了排队模型&多重定长休假、循环服务的M/D/1/∞/FCFS。

QoS is a concept of a contract on information transmission & sharing between network users . The concept smashed traditional FCFS mechanism of IP networks , and make different data differently treated .

QoS概念是网络上相互通信的用户之间关于信息传输与共享的质的约定，它打破了传统IP网络的FCFS模式，使得网络对数据业务采取区别对待。

This paper presents a new algorithm which adopts open loop and close loop congestion control . It cooperates the permits and time stamps schemes , together with the FCFS scheduling policy .

本文提出了一种同时采用开环和闭环控制，结合许可证控制和时间戳调度策略，以FCFS方式服务的拥塞回避新算法。

Based on the Tree Splitting Algorithm and First Come First Service ( FCFS ) Splitting Algorithm , the ESA Algorithm can take both the packets arrival time and their generation time into consideration .

该算法继承了树形冲突分解算法和先到先服务算法的优点，不仅考虑了碰撞分组产生的时间，还考虑了分组的产生间隔，从而有效地提高了冲突分解算法的性能。

Based on the analysis of feature of VOD system , a strategy of load balancing was introduced , which used hot-spot distributing and FCFS queue methods to enhance load ability of the service system .

在分析视频点播系统特点的基础上，提出一个负载均衡策略，利用热点分布、FCFS队列等方法，提高系统负荷能力，有较好的实用性。

Because of its fitness to be combined with a FCFS scheduler , RED-BC is easy to implement by upgrading the original RED module with a small calculation resource consuming .

该算法可以与FCFS调度策略结合使用，实现简单、计算资源消耗较小，易于推广，可以通过现有的RED模块升级实现。

The performance is evaluated by using average throughput , average delay and average loss rate compared to the conventional First Come First Serve ( FCFS ) principle . Simulation results demonstrate the advantages of the proposed algorithm .

对照传统的先到先服务（FCFS）方法，进行了仿真分析，结果表明平均吞吐率、平均时延及平均丢包率均有改善。

Compare with the FCFS algorithm and the backfill algorithm with no prediction execution time parameter , the load of the system resources can reach the better performance by the backfill algorithm with the prediction execution time parameter .

相比于FCFS算法和无预测时间参数的回填算法，有预测时间参数的回填算法可获得更好的资源负载性能。

The development of modeling for access way of loop LAN is reported . Moreover , the mathematical analysis and simulating experiment for feedback M / G / 1 [ K ] / S / FCFS model are also given .

本文报道了环形LAN存取方式建模的研究进展，并为其中的反馈式M/G/1[K]/S/FCFS模型进行了数学解析和仿真实验。

The FCFS can be divided into four steps : base time calculation , virtual simulation process , matching calculation and adjustment calculation . In the realizing process of the FCFS , job point , job chain model and neural network algorithms are adopted .

利用FFCS方法进行仿真分为基准计算、虚拟仿真推进、匹配计算和调整量计算4个步骤，并在方法的实现过程中采用作业节点、作业链模型和神经网络算法。

Firstly , we construct a dynamic optimal control model for FCFS scheduling strategy ; then , we present the more useful model for DM scheduling algorithm , so , the aperiodic soft real-time system is a single server queue system with multiple priorities .

首先给出了先来先服务调度策略的一些结果；然后在此基础上构造了针对DM调度算法的最优控制模型，此时非周期软实时系统是一个多优先级的单服务台排队系统。

M / G / 1 queuing system for two types of negative customers is discussed . One is that those who first come are first served ( FCFS ) . The other is that those who come late are first served ( LCFS ) .

主要探讨了两类负顾客的M/G/1排队系统，一类是先到先服务（FCFS），另一类是后到先服务（LCFS）。

Through the analysis on the physical mechanism of the Double Loop LAN , the queue model of the integrated services LAN which is M / D / 1 [ K ] / ∞ / FCFS is obtained , and the mathematical resolution and the simulation experiment is carried through .

通过对该双环LAN物理运行原理的分析，得到了综合业务下（网中设定的信元长度符合综合业务网的要求）双环LAN排队模型为M/D/1[K]/∞/FCFS，并进行了数学解析和模拟实验。

If the unicast packet is regarded as multicast packet with one destination port , MSFS is equal to FCFS unicast scheduling algorithm . Therefore , MSFS can be integrated FCFS smoothly on network where unicast and multicast coexists . 5 .

如果将单播报文看成是扇出数为1的组播报文，MSFS等价于FCFS单播调度算法，因此在单播和组播并存的互连网络中，MSFS能够与FCFS进行无缝集成。