跳到主要內容

臺灣博碩士論文加值系統

(44.212.99.208) 您好!臺灣時間:2024/04/17 17:23
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:黃耿深
研究生(外文):Geeng-Shen Huang
論文名稱:分散式系統的負載平衡演算法之效能研究
論文名稱(外文):Performance Analysis of Load Balancing Algorithms in A Workstation-Based Distributed System
指導教授:陳金蓮陳金蓮引用關係
指導教授(外文):Jean-Lien C. Wu
學位類別:碩士
校院名稱:國立臺灣科技大學
系所名稱:工程技術研究所
學門:工程學門
學類:綜合工程學類
論文種類:學術論文
論文出版年:1993
畢業學年度:81
語文別:中文
論文頁數:91
中文關鍵詞:欠載過載廣播排隊延遲切換啟動式價格函數
外文關鍵詞:UnderloadedOverloadedBroadcastingQueueing Delay
相關次數:
  • 被引用被引用:0
  • 點閱點閱:264
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
區域網路(LAN)已廣泛地被安裝及使用於世界各地與各應用領域。然而
,因網路上之各主機(Host)間的負載變異(Variance)及其隨機性(
Randomness)使得系統計算容量之利用率大幅降低,造成計算資源嚴重浪
費,系統效能降低。採取負載平衡正是解決之道。現有負載平衡演算法幾
乎均採用『輪詢』(Polling)方式,進行資訊蒐集。此法耗用過多通訊
資源---通訊網路之頻寬,且因蒐集資訊所生之延遲,甚至可能使得實施
負載平衡得不償失。於本研究中,我們修改三個既有之演算法---『送方
啟動式』(Sender -Initiated)、『收方啟動式』(Receiver-
Initiated)及『對稱啟動式』(Symmetrically Initiated),使其能利
用配合網路協助之『廣播』式資訊蒐集,以降低為追求較高效能所需付出
之代價。我們亦根據『排隊理論』建立其分析模型,分析這些演算法之效
能與所需付出之代價。此處所指之『效能改善』即排隊延遲的降低;而所
謂『代價』則是指每一主機為得到一個單位的『效能改善』,於單位時間
內所需送出之查詢訊息量。此外,我們還獲得三個『守恆定則』(
Conserva-tion Rules),可大幅簡化『均質系統』(Homogeneous
System)負載平衡之分析。另藉由『負載平衡成功機率』(Probability
of Load Balancing Success,PLBS)之分析,我們提出一個新的負載平
衡演算法,稱作『切換啟動式』( Switching Initiated)。此演算法可
根據系統之負載狀況來調整其工作模式,以增進系統效能。它兼俱『送方
啟動式』與﹑『收方啟動式』及『對稱啟動式』三者之優點,而無其缺點
,且所付出之代價最低。由於此演算法之運作非常簡易,且付出之代價很
低,所以可適用於大型系統。文中亦將比較以上所提及的四個演算法之效
能表現及其所需付出之代價。

Local Area Networks constituted of workstations are equipped
immensely all over the world nowadays, however the utilization
of their computing capacity is tackled down by the variance and
randomness of loading between the hosts attached to the
network. This low utilization results in massive waste of
computing resource and reduces the performance of a system.
Load balancing is a remedy for this poor utilization of
computation resource. Almost all the existing load balancing
algorithms perform information gathering by polling. This
approach wastes the communication resource, i.e. the bandwidth
of a network. It may even make the performance of a system
worse than the same one without load balancing because of the
long communication delay nature in the polling approach. In
this thesis, we study the queueing models of three load
balancing algorithms which are the modified versions of
existing (Sender Initiated, Receiver Initiated, and
Symmetrically Initiated) algorithms. Analyses of the
performance are presented based on these models. Modifications
are made in such a way that information gathering in the
network is through broadcasting or multi-casting. The
modifications is to reduce the cost that these algorithms must
pay for improvement of perormance. By the improvement of
performance, we mean the reduction of task queueing delay. The
cost of concern is the volume of messages per unit time and per
unit of improvement in performance. The cost paid by these
algorithms are also analyzed. Besides, we also obtain three
"conservation rules" for simplifying the analysis of a
homogeneous load balancing system. Based upon the study of the
probability of load balancing success, we propose a new
algorithm named Switching-Initiated, which can adapt its
operation mode to the system loading, hence improves the
performance of the system. This algorithm has all the benefits
of the other three algorithms proposed, but has none

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top