跳到主要內容

簡易檢索 / 詳目顯示

研究生: 陳麗秋
Chen Li-Chiou
論文名稱: 分散式伺服器最佳分割之演算法則
A Partition Algorithm for the Establishment of Optimal Distributed Servers
指導教授: 劉文卿
Liou Wen-Ching
學位類別: 碩士
Master
系所名稱: 商學院 - 資訊管理學系
Department of Management Information System
論文出版年: 1994
畢業學年度: 82
語文別: 英文
論文頁數: 60
中文關鍵詞: 裴氏網分散式系統伺服器圖形分割
外文關鍵詞: Petri-Net, Distributed System, Server, Graph Partition
相關次數: 點閱:251下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  •   本篇論文以裴氏網(Petri-Net)描述系統,提出一啟發式的演算法則

    , 將此裴氏網分割為數個子系統,以便建構為分散式系統中獨立運作的

    伺服器。吾人設計一系列的模擬實驗,以測試此演算法的績效。而後,本

    篇論文列出影響分割的變數及各變數間的關係,並分析本演算法之特性。

    而根據模擬實驗的結果分析,吾人對分散式環境之應用系統發展提出建議


    In this thesis, we use the Petri-Net to model a system, and we

    propose a heuristic algorithm to partition the Petri-Net into

    several autonomous servers. We then conduct a series of simula-

    tion experiments to test the performance of the algorithm and

    to identify the variables which influence the partition of the

    Petri-Net. Some factors influencing the properties of a

    partition are identified and their inter-relationships are

    shown. Based upon the simulation, we provide some suggestions

    for the develop- ment of the application in the distributed

    system environment.

    CONTENTS
    LIST of FIGURES ii
    LIST of TABLES iii
    ABSTRACT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
    1. INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
    2. LITERATURE REVIEW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
    2.1 Petri-Net . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .4
    2.2 Distributed System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
    2.3 Graph Partition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
    3. DEFINITION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
    4. ALGORITHM AND SIMULATION FOR ARTITIONING
    THE PETRI-NET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
    4.1 Algorithm for Partitioning the Petri-Net . . . . . . . . . . . . . . . . . . . . . . . . . . .18
    4.2 Experiment Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
    4.3 Result Analyses . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
    4.3.1 The Influential Factors for TCF . . . . . . . . . . . . . . . . . . . . . . . . . . . .25
    4.3.2 The Influential Factors for Balance Value . . . . . . . . . . . . . . . . . . .31
    5. MODIFICATION OF THE PARTITION ALGORITHM . . . . . . . . . . . . . . . . . . . . . . . . . .38
    5.1 Modified Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
    5.2 Experiments for the Modified Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . .42
    6. CONCLUSION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .50
    REFERENCES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .51
    APPENDIX . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .53

    [AD091] G. Adomi and A. Poggi, "Actions representation in a 4-D space, "
    [nt.J.Man- A1achine Studies, vol. 35, 1991, pp.825-841.
    [AGH90] G. Agha, "Concurrent object-oriented programming, "Communication
    of the ACM, vol. 33, no. 9, Sep.1990, pp.125-141.
    [BR093] H.1. Broersma, R. 1. Faudree, J. van den Heuvel and H. 1. Veldman,
    "Decomposition of bipartite graphs under degree constraints, "
    Networks, vol. 23,1993, pp.159-164.
    [COU91] G. F. Coulouris and J. Dollimore, Distributed Systems Concepts and
    Design Addition-Wesley, 1991.
    [GEH84] N. H. Gehani and T. A. Cargill, "Concurrent programming in the Ada
    language: The polling bias, "Software-Practice and Experience,
    vol. 14, no. 5, May 1984, pp.413-427.
    [HER91] L. Herault and J-J Niez, "Neural network and combinatorial
    optimization: a study of N-P complete graph problems, "Neura!
    Network: Advance and Applications, E. Gelenbe, Ed. North-Holland:
    Elsevier Science Publishers B. V., 1991, pp.165-213.
    [HOG89] R. V. Hogg and E. A. Tanis, Probability and Statistical Inference.
    Macmillan Publishing Company, 1989.
    [KER70] B. W. Kernighan and S. Lin, "An efficient heuristic procedure for
    partitioning graphs, "Be!! Syst. Technic.I. vol. :,),9, Feb. 1970,
    pp.291-307.
    [KlM92] J-U Kim. C-H Lee, and M. Kim , "Efficient multiple-way networkpartitioning
    algorithm, "Computer-Aided Design. vol. 25, no. 5,
    May 1992, pp.269-280.
    [KLE85] L. Kleinrock, "Distributed systems, "Communication of the ACM,
    vol. 28, no. 11, Nov. 1985, pp.1200-1212.
    [MEY93] B. Meyer, "Systematic concurrent object-oriented programming,"
    Communication of the AC1Vl, vol. 36, no. 9, Sep. 1993, pp.56-80.
    [MUR86] T. Murata, N. Komoda, K. Matsumoto, and K. Haruna, "A Petri Netbased controller for flexible and maintainable sequence control and its
    applications in factory automation, "IEEE Transactions on IndustriaL
    ELectronics, vol. IE-33,no. 1, Feb. 1986, pp.I-8.
    [MUR89] T. Murata, "Petri Nets: Properties, analysis and applications, "
    Proceedings of the IEEE, vol. 77, no. , Apr. 1989, pp.541-5S0.
    [P AP82] C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization
    Algorithm and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
    [PAP92] Y. E. Papelis and T. L. Casavant, "Specification and analysis of parallel/distributed software and systems by Petri Nets with transition enabling
    functions, "IEEE Transactions on Software Engineering, vol. IS,
    no. 3, March 1992, pp.252-261.
    [PETS 1] 1. L. Peterson, Petri-Net Theory and the Modeling of Systems.
    Englewood Cliffs, N.J.: Prentice-Hall, July 1981.
    [TA093] L. Tao and Y. Zhao, "Multi-way graph partition by stochastic
    probe, "Computers Ops Res., vol. 20, no. 3,1993, pp.321-347.
    [TOR85] A. A. Torn, "Simulation nets, a simulation modeling nnd validntion tool,"Simulation, Aug. 1985, pp.70-74.
    [ZH092] M. C. Zhou, F. DeCesme, A. A. Desrochers, "A hybrid methodology for synthesis of Petri Net models for manufacturing systems, "IEEE
    Transitions on Robotics and Auwmacion. vol. S, no. 3, June 1992.pp.350-360.

    無法下載圖示 (限達賢圖書館四樓資訊教室A單機使用)
    QR CODE
    :::