skeleton distribution 中文意思是什麼

skeleton distribution 解釋
粒徑分佈
  • skeleton : n 1 骨骼，骷髏；（房屋、傘、扇子等的）骨架；殘骸；（葉子的）脈絡；筋。2 骨瘦如柴的人[動物]。 3 梗...
  • distribution : n 1 分配，分發，配給；分配裝置[系統]；配給品；配給量；【經濟學】配給方法，配給過程；分紅；【法律...
  1. In this dissertation, we first state briefly the developmental history, the present condition of queueing theory, the markovization of queueing system and the research situation for several types of ergodicity, and induce the preliminary knowledge of markov processes and markov skeleton processes, and then the dissertation discusses mainly focus on several problems which exist in researching gi / g / l queueing system, which are categoried as follows : ( i ) non - equilibrium theory for gi / g / 1 queueing system ( l ) we present the equation which satisfies the transient distribution of l ( t ) for the three special cases m / m / 1, gi / m / 1 and m / g / 1 queue of gi / g / 1 queueing system, and proves that the length l ( t ) of gi / g / 1 queueing system satisfy three types of equation, and their minimal nonnegative solution are unique bounded solutions

    歸納了馬爾可夫過程和馬爾可夫骨架過程的有關的初步知識。然後，本文重點討論了當前在gi g 1排隊系統中待研究的如下幾個問題： （一） gi g 1排隊系統的非平衡理論（ 1 ）給出gi g 1排隊系統及其三個特例m m 1 ， gi m 1和m g 1排隊系統的隊長l （ t ）的瞬時分佈所滿足的方程。證明gi g 1排隊系統的隊長l （ t ）滿足三種不同方程，並且是這些方程的最小非負解，也是唯一有界解。
  2. Additionally, provided that not all interarrival times distribution and ser - vice times distribution are of density function, the integral representation of the transient disribution of the queue length of these four queueing systems as indicated above is obtained by applying the theory of markov skeleton processes

    此外，當到達間隔分佈和服務時間分佈不都有密度函數時，應用馬爾可夫骨架過程理論，亦可得到上述四個排隊系統的瞬時隊長分佈的積分表示。在處理上述這兩個內容截然不同的部分時，所使用的基本方法是一致的。
  3. Through walks, please come in, carries on internal promotion and exterior exchange, by the original traditional industry sole service pattern, promotes as the nowadays take the skeleton line transportation, the warehousing allocation, the loading and unloading processing, the physical distribution consultation serves the enterprise as body comprehensive third party physical distribution

    通過「走出去，請進來」 ，進行內部提升和外部交流，由原來傳統產業的單一服務模式，升級為現今以干線運輸倉儲配送裝卸加工物流咨詢為一體的綜合性第三方物流服務企業。
  4. As the application of distributed computing is used much more widely ， distributed database becomes a significant part of information management it avoids a lot of disadvantages of conventional centralized database ， and is applicable to many situations distributed database is a set of data which is the unity logic ， but in fact these data is located on different sites it is of high availability ， easy expansibility ， high concurrency ， high efficiency and etc in distributed system ， data redundancy is a method to improve the speed of query and the availability of system distributed query should shield the lower level details of data redundancy from end users ， distributed transaction should ensure data from disaccord this paper introduces basic conceptions of distributed database firstly ， discusses distributed transaction and concurrent control ， describes the development prototype mysql ’ s characters ， architecture and executive mechanism ， then shows the skeleton model of dpsql and exposes the strategy and algorithm of distributed query and distributed transaction ， at last analyzes the extra expenses and response delay of distributed processes this paper exposes the implementation mechanism of distributed query and distributed transaction emphatically distributed query uses the strategy of “ read one ， write a11 ” s0 in such a system if user ’ s requests are read - - only for the most part and the distribution of data redundancy is plausible ， efficiency is very high distributed transaction uses two - 。 phase commit protocol to ensure the consistency of global data ， which has less communication overhead

    分散式查詢需要向用戶屏蔽數據冗餘分散的底層細節，分散式事務處理要保證全局數據完整，這都是傳統集中式數據庫不曾面臨的問題。本文首先介紹了分散式數據庫的概念性問題；接著討論了分散式事務涉及的定義及演算法；然後描述了dpsql的原型mysql的特性、結構和執行機制；繼而給出了dpsql的梗概模型，闡述了實現分散式查詢和分散式事務處理的策略及演算法；最後分析了進行分散式處理給系統增加的額外開銷和客戶端的額外響應延遲。本文重點描述了分散式查詢和分散式事務處理的實現機制，分散式查詢採用」讀一個寫全部」的本地優先策略，在讀操作頻繁的系統中，只要庫的分佈合理，單機效率極高，幾乎無任何附加開銷和延遲，而以整個系統的角度看來，吞吐量就更是優于單機系統；分散式事務處理採用兩階段提交協議，通信次數較少並能確實保證副本一致。
分享友人
分享到 Line

分享到臉書