English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 111321/142230 (78%)
Visitors : 48416351      Online Users : 1025
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 學位論文 >  Item 140.119/35192
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/35192


    Title: 中央政府預算編製作業在多層式架構中派工法則之研究
    Authors: 陳志良
    Contributors: 陳春龍
    曾淑峰



    陳志良
    Keywords: 多層式架構
    應用伺服器
    派工法則
    負載平衡
    Date: 2002
    Issue Date: 2009-09-18 14:24:17 (UTC+8)
    Abstract: 中文摘要

    主計處每年必需編製中央政府總預算書至立法院審議,而目前總預算書的編製是由八百餘家單位預算及分預算機關使用主從式架構的預算編製系統執行編製作業,然後逐層由上級機關彙編而成。本研究欲探討的是若此一主從式架構的系統改採多層式架構時,在其眾多效能的問題之中,討論應用伺服器叢集上的派工法則在工作平均等待時間的表現情況。
    使用預算編製作業系統的機關及使用者幾乎是固定而且範圍容易掌握。所以,本研究在此前提下,從部份使用者的作業習慣及資料庫中,估算出模擬模型所需之數據、機率分配及公式。在選擇派工法則的部份,則除了一般常用之「輪流法(Round-robin, RR)、最少連線數法(Least Connections, LC)及最小負載法(Least Load, LL)」之外,本研究另提出「估計負載法(Estimated Load, EL)」。即是因為在瞭解使用者端特性的前提下,事先計算影響負載的數據,便可以估算負載情況並運用在派工法則上。
    本研究的結果顯示EL法在各項工作的服務時間估算誤差愈小時,其表現的結果愈好,其各項工作的平均等待時間相當接近做為測試基準的最小負載法。
    Abstract

    The Directorate-General of Budget, Accounting and Statistics (DGBAS) of the Executive Yuan (EY) is responsible to compile the General Budget for Central Government and submit to Legislative Yuan every year. The sources of General Budget are processed by 832 government agencies and subordinate agencies by using the same software that is based on client/server architecture. This paper discusses about performance of dispatching rules on cluster-based application servers when this software architecture transferring to n-tiered architecture.
    We carry out the comparative studies using four dispatching rules, namely, Round-robin (RR), Least Connections (LC), Estimated Load (EL), and Least Load (LL). The LL rule is used as the baseline in our analysis and the performance metric is average waiting time. Unlike general web-based software, we know clients who use this software. So we can estimate job arrival rate, job size, and even service time. In view of this, we proposed the EL rule in this paper.
    Our analyses indicate that the EL rule performs very well. As long as accuracy in estimating service time getting better, the EL rule is a good choice.
    Reference: 陸、參考文獻
    [1] Alcott, T., Cheng, M., Cocasse, S., Draeger, D., Modjeski, M. and Wang H., “Failover and Recovery in WebSphere Application Server Advanced Edition 4.0”, IBM Corp., December 18, 2001
    [2] Chappell, D., “Understanding Microsoft Windows 2000 Distributed Services”, Microsoft Press, 2000
    [3] De Turck, F., Vanhastel, S., Volckaert, B. and Demeester, P., “A generic middleware-based platform for scalable cluster computing” Future Generation Computer Systems 18 (2002) 549-560
    [4] Ewald, T., “Use Application Center or COM and MTS for Load Balancing Your Component Servers”, Microsoft Journal
    [5] Feiler, J., “Application Servers Powering the Web-Based Enterprise”, Morgan Kaufmann
    [6] Goodyear, M., “Enterprise System Architectures – Building Client/Server and Web-based Systems”, Andersen Consulting, 2000
    [7] Gorton, I. and Liu, A., “Evaluating the Performance of EJB Components”, IEEE INTERNET COMPUTING, May/June 2003
    [8] Guo, Y. and Wendel, P., “Developing a distributed scalable Java component server”, Future Generation Computer Systems 17 (2001) 1051-1057
    [9] Hunt, G.D.H., Goldszmidt, G.S., King, R.P. and Mukherjee, R., “Network Dispatcher: a connection router for scalable Internet Services”, Computer Networks and ISDN Systems, 30(1998) 347-357
    [10] Lamb, J.M., “Windows 2000 Clustering and Load Balancing”, Prentice Hall PTR, 2002
    [11] Lau, Y.T., “The Art of Objects – Object-Oriented Design and Architecture”, Addison-Wesley, 2001
    [12] Law, A.M. and Kelton, W.D., “Simulation Modeling and Analysis”, McGraw-Hill, third edition, 2000
    [13] Liu, Z., Niclausse N., Jalpa-Villanueva, C., “Traffic model and performance evaluation of Web servers”, Performance Evaluation 46 (2001) 77-100
    [14] Ponnachatgh, P., “Application Server Benchmarking Fundamentals”, Sybase Inc.
    [15] Promodel Corp., “Promodel Reference Guide”, Promodel Corp., 2001
    [16] Promodel Corp., “Promodel User Guide”, Promodel Corp., 2001
    [17] Satzinger, J.W., Jackson, R.B., Burd, S.D., “Systems Analysis and Design in a Changing World”, Course Technology, a division of Thomson Learning, 2000
    [18] Schroeder, T., Goddard, S. and Ramamurthy, B., “Scalable Web Server Clustering Technologies”, IEEE Network, May/June 2000
    [19] Sybase, Inc. “Building Internet and Enterprise Applications”, PowerBuilder 8, June 2001(Document ID: 77878-01-0800-02)
    [20] Sybase, Inc. “Programmer’s Guide”, EAServer 4.1, December 2001(Document ID: 38036-01-0410-01)
    [21] Teo, Y.M. and Ayani, R., “Comparison of load balancing strategies on cluster-based Web servers”, Simulation, San Diego, Nov/Dec 2001
    [22] Wolf, D., Technical Evangelist, Sybase, Inc. “Load Balancing and Failover Using Sybase Enterprise Application Server”, A Technical Paper from Sybase, Inc.
    [23] 倍力技術小組,”PowerBuilder 8.0 分散式進階應用(上)(下)”,儒林,2001
    [24] 行政院主計處電子處理資料中心GBA小組, “中央政府歲計會計系統推廣訓練教材”, 2003
    [25] http://www.w3.org/History/1989/proposal.html
    Description: 碩士
    國立政治大學
    資訊管理研究所
    90356038
    91
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0090356038
    Data Type: thesis
    Appears in Collections:[資訊管理學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    35603801.pdf48KbAdobe PDF2804View/Open
    35603802.pdf42KbAdobe PDF2815View/Open
    35603803.pdf49KbAdobe PDF2890View/Open
    35603804.pdf61KbAdobe PDF2888View/Open
    35603805.pdf78KbAdobe PDF22802View/Open
    35603806.pdf171KbAdobe PDF23272View/Open
    35603807.pdf615KbAdobe PDF2972View/Open
    35603808.pdf374KbAdobe PDF2888View/Open
    35603809.pdf52KbAdobe PDF2864View/Open
    35603810.pdf44KbAdobe PDF2948View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback