join a queue

与join a queue相关的网络例句 [注：此内容来源于网络，仅供参考]

This invention discloses a multi-queue sequence buffer management circuit and a method based on a pipeline applying a pipeline structure including: an arbitration circuit selecting one for process from read, write and distribution buffer requests, a buffer slot state module designing state of the slot requiring operation and queue numbers and assigning idle slots, a buffer slot filter module filtering the slot, a buffer slot filter module filtering the slot states not belonging to the current operation queues nor idle aligned in terms of the head pointer, a queue slot selection module computing continuous idle slot numbers from the slot pointed by the head pointer and refreshing the head pointer and selecting preparing slots, a queue slot prior queuing module refreshing the read pointer and result numbers of the current operation queues with the pointer of the first prepare slots and their numbers which can support multi-queue to share one buffer space, queues can access the buffer in overlap.

本发明公开一种基于流水线的多队列顺序化缓冲管理电路及方法，本发明电路采用流水线结构，包括：仲裁电路，从读、写、分配缓冲请求中选取一路进行处理；缓冲槽口状态设置模块，设置请求操作的槽口状态和队列号，分配空闲槽口；缓冲槽口滤除模块，滤除不属于当前操作队列且非空闲态的槽口状态，按头指针对齐；队列槽口选择模块，计算头指针指向槽口起的连续空闲槽口数并更新头指针，选出预备态的槽口；队列槽口优先排队模块，用第一个预备态槽口的指针和预备态槽口数分别更新当前操作队列的读指针和结果数；本发明可以支持多个队列共享一个缓冲空间，各类指令队列能对缓冲进行交叉访问，并对指令结果的写入读出进行顺序化管理。

In Chapter 2,I consider a queuing system in which there are two exponential servers, each having his own queue, and arriving customers will join the two queues separately, and analyze the two-dimensional Markov process representing the numbers of jobs in the two stations. A functional equation for the generating function of the stationary distribution of this two-dimensional process is derived and solved through the theory of Riemann-Hilbert boundary value problems. In Chapter 3, I consider the system with two parallel queues, in which arrivals join the shorter queue.I describe the problem of coupling and show that the generating function Fcan be continued as a meromorphic function to the whole complex plane.

全文包括三大部分：第一章介绍了基本的背景、研究进展和文章主要采用的方法；第二章研究的是有两个服务员共享的简单的排队方式的模型，即每个服务员有各自的队列，两队队长互不相关，分析了代表两个队长的二维马尔柯夫过程，推导出了二维过程的平稳分布的母函数的方程，并运用Riemann—Hilbert边值问题理论解出了母函数的表达式；第三章研究的是JSQ-PS模型(the joining the shortest queue model with processor sharing)，模型是组合了加入最短队模型和处理器共享模型而成的有用排队模型。

A task's svc hook method can use ACE_Task::getq to dequeue messages placed onto the message queue and process them concurrently. The getq method blocks until either a message is available on the message queue or the specified absolute timeout elapses. The blocking nature of getq allows the thread of a task to block and only wake up when there's work available on the message queue.

一个任务的svc挂钩可以使用ACE_Task：：getq来出队消息和并发处理他们。getq方法阻塞直到在队列上有一个消息可用或者制定的超时发生。getq允许线程在惹任务中阻塞，仅在消息队列中有工作可作才被唤醒。

与join a queue相关的网络解释 [注：此内容来源于网络，仅供参考]

join a bus queue：加入到排队等车的行列

apologize to the teacher 向老师道歉 | join a bus queue 加入到排队等车的行列 | avoid eye contact with other people 避免与对方的眼睛接触