中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/7689
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 78937/78937 (100%)
造访人次 : 39854178      在线人数 : 348
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/7689


    题名: 最佳化交換處理系統之權重選擇;Choosing Optimal Queue Weights for Switched Processing Systems
    作者: 鄭文智;Wen-Chih Cheng
    贡献者: 統計研究所
    关键词: 佇列權重;最短處理時間優先服務法則;最大內積策略;等待時間;模擬;交換處理系統;Shortest Processing Time First (SPTF) rule;the MaxProduct policies;delay;Switched Processing Systems;queue weights;simulation
    日期: 2007-06-11
    上传时间: 2009-09-22 11:02:18 (UTC+8)
    出版者: 國立中央大學圖書館
    摘要: 交換處理系統對許多領域來說是個重要的模型如通訊網路、電腦網路與製造業網路。它可被刻劃成是具有彈性的、獨立的服務能力,以及多層的工作流量的模型。過去幾年,非常豐富的文獻資料都在發展能夠同時具備最大吞吐量與達到某種程度穩定性的控制策略。近年來,研究轉向於改善服務品質表現如等待時間與存貨。本研究探討一種使吞吐量最大的控制策略稱為最大內積控制策略。其目的是希望在使用最大內積控制策略之下能對每一個佇列放置最佳佇列權重以有效地改進等待的表現值。我們所提出的方法動機是源自於有名的最短處理時間優先服務的法則。對於輸入流量不變的例子,我們介紹一個一維度方向的搜尋方法以尋找最佳佇列權重。對於輸入流量可變化的情形,我們也提出一個更有彈性且實用的搜尋方法。模擬結果顯示對於不同的系統輸入,我們提出的方法都可以顯著地改善平均等待時間與九十五百分比的等待時間。 Switched Processing Systems (SPS) represent crucial models for many applications in communication, computer, and manufacturing networks. They are characterized by flexible, independent service capabilities and multiple classes of job flows. Over the years, a fairly rich literature has been developed for maximizing the system’s throughput and at the same time constructing scheduling policies that maintain a certain level of system stability. Recently, research has been shifted to improving the quality of service (QoS) performance with respect to the performance metrics such as delay and backlog. In this study, we investigate a class of throughput maximizing scheduling policies called MaxProduct policies. The goal is to place the optimal weight on each queue so that the delay performance under the MaxProduct policies can be significantly improved. The proposed approach is motivated by the well known Shortest Processing Time First (SPTF) rule. For systems where the input traffic does not change, a one-dimensional search procedure for finding the optimal queue weights is introduced. For systems where the input traffic statistics might change, a more flexible and practical search procedure is suggested. The simulation results reveal that our proposed methods can substantially improve the average system delay and the 95th percentile of delays for various types of input traffic.
    显示于类别:[統計研究所] 博碩士論文

    文件中的档案:

    档案 大小格式浏览次数


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明