A study on protocol design and combinatorial optimization in resource assignment type problems on the basis of net theory and genetic algorithms 資源割当型問題に対するネット理論と遺伝的アルゴリズムに基づくプロトコル設計と組合せ最適化に関する研究
Access this Article
Search this Article
Author
Bibliographic Information
- Title
-
A study on protocol design and combinatorial optimization in resource assignment type problems on the basis of net theory and genetic algorithms
- Other Title
-
資源割当型問題に対するネット理論と遺伝的アルゴリズムに基づくプロトコル設計と組合せ最適化に関する研究
- Author
-
名嘉村, 盛和
- Author(Another name)
-
ナカムラ, モリカズ
- University
-
大阪大学
- Types of degree
-
博士 (工学)
- Grant ID
-
乙第6827号
- Degree year
-
1996-01-31
Note and Description
博士論文
Table of Contents
- TABLE OF CONTENTS / p4 (0005.jp2)
- ABSTRACT / p1 (0002.jp2)
- TABLE OF CONTENTS / p4 (0005.jp2)
- 1. Introduction / p1 (0007.jp2)
- 1.1 Mutual Exclusion Problem / p1 (0007.jp2)
- 1.2 Gender-fair Stable Marriage Problem / p4 (0010.jp2)
- 1.3 Multiprocessor Scheduling Problem / p6 (0012.jp2)
- 1.4 Organization / p7 (0013.jp2)
- 2. Fundamental Concepts and Notations / p8 (0014.jp2)
- 2.1 Net theory:Graphs and Petri nets / p8 (0014.jp2)
- 2.2 Genetic Algorithms / p10 (0016.jp2)
- 2.3 Miscellaneous / p11 (0017.jp2)
- 3. A Topological Design of Mutual Exclusion Protocol for Single Shared Resource in Distributed Environments of Autonomous Nodes / p13 (0019.jp2)
- 3.1 Introduction / p13 (0019.jp2)
- 3.2 Distributed Environments of Autonomous Nodes / p15 (0021.jp2)
- 3.3 Mutual Exclusion Protocol:Distributed MUTEX / p17 (0023.jp2)
- 3.4 Initial Acyclic Set-Up / p20 (0026.jp2)
- 3.5 Entry and Exit Protocols / p25 (0031.jp2)
- 3.6 Dynamic MUTEX Algorithm / p32 (0038.jp2)
- 3.7 Verification of Dynamic MUTEX Algorithm / p37 (0043.jp2)
- 3.8 Concluding Remarks / p40 (0046.jp2)
- 4. Concurrency Analysis of Acyclic Graph Evolution and Extension to Multiple Shared Resource Cases / p41 (0047.jp2)
- 4.1 Introduction / p41 (0047.jp2)
- 4.2 Basic Concepts and Notions of Acyclic Graph Evolution / p45 (0051.jp2)
- 4.3 Concurrency Analysis of Acyclic Graph Evolution / p48 (0054.jp2)
- 4.4 Method to Design Initial Acyclic Graph / p60 (0066.jp2)
- 4.5 Mutual Exclusion for Multiple Shared Resource Cases / p65 (0071.jp2)
- 4.6 Concluding Remarks / p66 (0072.jp2)
- 5. Adaptation of a Genetic Algorithm to Gender-fair Stable Marriage Problem / p67 (0073.jp2)
- 5.1 Introduction / p67 (0073.jp2)
- 5.2 Preliminaries / p71 (0077.jp2)
- 5.3 Adaptation of a Genetic Algorithm / p76 (0082.jp2)
- 5.4 Experimental Evaluation / p79 (0085.jp2)
- 5.5 Concluding Remarks / p81 (0087.jp2)
- APPENDIX / p81 (0087.jp2)
- 6. Genetization of Heuristic-Knowledge in Genetic Algorithm and Its Application to Multiprocessor Scheduling Problems / p83 (0089.jp2)
- 6.1 Introduction / p83 (0089.jp2)
- 6.2 Preliminaries / p85 (0091.jp2)
- 6.3 Four Reinforced Genetic Algorithms / p88 (0094.jp2)
- 6.4 Genetized-Knowledge GA:gkGA / p96 (0102.jp2)
- 6.6 Concluding Remarks / p99 (0105.jp2)
- 7. Concluding Remarks / p101 (0107.jp2)
- Acknowledgments / p105 (0111.jp2)
- References / p106 (0112.jp2)
- List of Publications by the Author / p110 (0116.jp2)