緩沖延遲 的英文怎麼說
中文拼音 [huǎnchōngyánchí]
緩沖延遲
英文
buffer delay-
Enables player afterimage effects. the character ' s frames are stored in a history buffer, and are displayed after a delay as afterimages
產生游戲者殘影效果。將人物畫面存儲在歷史緩沖中，並延遲一段時間作為殘影顯示。Newer events will be delayed at most five minutes if the provider is under heavy load, assuming they are not dropped because of a full buffer
如果提供程序承擔的負荷繁重，則較新事件的延遲時間最多為5分鐘，前提是這些事件沒有因為緩沖區已滿而被丟棄。This paper presents a theoretic analysis of the temporal characteristics of output buffer in switch, gives the probability distribution function of delay and average queuing time, and compares the end - to - end delay between traditional and switched ethernet. vlan is one of important technologies that switch has to implement. switch has to rapidly and efficiently find and maintain an un - looped topology
在建立交換機的延遲模型基礎上，推導出輸出緩沖延遲分佈、隊列大小等特性；接著比較傳統總線型以太網和交換式以太網的端到端延遲，為交換機以及交換式以太網的設計和分析提供可靠的理論基礎。Moreover, by choosing different kinds of write - back strategy, log management system can cooperate with buffer management to implement commit delay and group commit
日誌管理模塊還通過對日誌回寫策略的調整，配合數據緩沖器進行延遲提交，成組提交，從而達到提高系統效率的目的。The efficiency of file operation was improved, by the pre - read and wait - write buffer technology was applied to the operation of file read and write
3 .在流媒體文件讀寫操作中採用預讀取和延遲寫緩沖技術，提高流媒體文件讀寫效率。To delivery continues multimedia data in network, we use buffering, adaptive rate control and retransmitting to do with the latency and jitter of network transmitting
為了保證多媒體數據在網路上傳輸的連續性，我們使用了一定的緩沖、動態速率調整、重傳等技術以克服當前internet網路傳輸的延遲、抖動等帶來的不利因素。An algorithm of path - based timing optimization by buffer insertion is presented. the algorithm adopts a high order model to estimate interconnect delay and a nonlinear delay model based on look - up table for gate delay estimation. and heuristic method of buffer insertion is presented to reduce delay. the algorithm is tested by industral circuit case. experimental results show that the algorithm can optimize the timing of circuit efficiently and the timing constraint is satisfied
提出了一種基於路徑的緩沖器插入時延優化演算法，演算法採用高階模型估計連線時延，用基於查表的非線性時延模型估計門延遲.在基於路徑的時延分析基礎上，提出了緩沖器插入的時延優化啟發式演算法.工業測試實例實驗表明，該演算法能夠有效地優化電路時延，滿足時延約束For vertex and index buffers, the application discards the entire buffer. a pointer to a new memory area is returned so that the direct memory access and rendering from the previous area do not stall
對于頂點和索引緩沖區，應用程序將丟棄整個緩沖區，並返回指向新內存區域的指針，以便直接內存訪問（ dma ）和從以前區域進行的呈現不會出現延遲。Due to the concern of process variation, the delay of each clock buffer is treated as a range instead of a single value
在製程變異上面，每個時鐘緩沖器的延遲值被表示為一個范圍值。Fold return formation postulate to be : heart somewhere or much place are one - way block sluggish ; impulse is conducted in another way slow ; defer of cardiac muscle of yuanduan of place of block sluggish is excited ; place of block sluggish carries cardiac muscle nearly again excited
折返形成的基本條件為：心臟某處或多處單向阻滯；沖動在另一途徑傳導緩慢；阻滯部位遠端心肌延遲激動；阻滯部位近端心肌再激動。Abstract : in a network system, overflow or overwrite of message buffer will cause missing of messages. for a timed token network, message transmission time and the message buffering space allocation in a node are very important issues on network real time capability. this paper analyses the message buffering mechanism, describes the relationship of message buffering space and message transmission bandwidth allocation, and proposes a space determination method of message buffer for ltpb network. the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived. it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time
文摘:在網路系統中，節點緩沖區內消息發生覆蓋或溢出會造成消息的丟失，對于限時令牌網路，節點消息發送時間和消息緩沖容量的分配是影響消息實時性的重要因素.針對令牌傳遞網路分析了節點消息緩沖機制，說明了消息緩沖容量的確定與網路帶寬分配方法的關系，並提出了消息緩沖容量的確定方法，導出了避免消息覆蓋或溢出所需的最大發送和接收緩沖容量余度.指出在消息的產生間隔大於該消息的最大允許的延遲時間和接收節點響應時間的條件下，發送和接收端的消息緩沖容量等於被緩沖消息的長度In a network system, overflow or overwrite of message buffer will cause missing of messages. for a timed token network, message transmission time and the message buffering space allocation in a node are very important issues on network real time capability. this paper analyses the message buffering mechanism, describes the relationship of message buffering space and message transmission bandwidth allocation, and proposes a space determination method of message buffer for ltpb network. the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived. it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time
在網路系統中，節點緩沖區內消息發生覆蓋或溢出會造成消息的丟失，對于限時令牌網路，節點消息發送時間和消息緩沖容量的分配是影響消息實時性的重要因素.針對令牌傳遞網路分析了節點消息緩沖機制，說明了消息緩沖容量的確定與網路帶寬分配方法的關系，並提出了消息緩沖容量的確定方法，導出了避免消息覆蓋或溢出所需的最大發送和接收緩沖容量余度.指出在消息的產生間隔大於該消息的最大允許的延遲時間和接收節點響應時間的條件下，發送和接收端的消息緩沖容量等於被緩沖消息的長度Router delays : packets are re - assembled when received by routers and buffered in memory until they can be transmitted on the next hop
路由延遲：包被路由器接收后重新組裝並保存在緩沖區中直到他們發送到下一站。分享友人