Yapısal ve merkezi olmayan sayısal ortamların süreç eşleme performansları hakkında bir inceleme
Loading...
Date
2007
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Verimli es¸leme, yapısal ve merkezi olmayan sayısal ortamlarda problem tes¸kil etmektedir. Bu tezde s¨ozkonusu ortamlara odaklanılarak, ortamlarn es¸leme performanslarını ¨olc¸me amac¸lı benzetimler gerc¸ekles¸tirilmis¸tir. Calısmada, P2P(HyperGrid, basuclu (ultrapeer) ve bas¸uc¸'suz Gnutella), Kucuk-dunya (Small-World, Watts-Strogatz), ve us kanunu (power-law) da˘gılımını g¨osteren Ozerk Waxman sisteminin a˘gır-kuyruklu (heavy-tailed) ¨ uygulaması, rasgele (random), iki boyutlu-ızgara (2D-Grid) gibi farklı ortam modelleri dikkate alınmıs¸tır. Es¸leme amacıyla, s¨urec¸ kars¸ılas¸malarına olanak tanıyan akıs¸ mekanizmasının Bilgilendirilmemis¸ Once-Enlemesine-Arama oldugu kabullenilmis¸tir. Benzetimlerde, rasgele ortamın es¸leme performansının neredeyse di˘ger t¨um problemlere ve eszamanlı yapılandırmaya oranla performans ustunlugu gozlenmektedir. Ancak, kucuk-dunya ortamı modelinin toplam maliyeti neredeyse t¨um kurulumlar ic¸inde en yuksek olanıdır. Sozluk Terimler: Yapısal ve merkezi olmayan ortamlar, Surec¸ esleme, Performans, Benzetim
Efficient matchmaking is an important problem in unstructured and decentralized digital environments. We want to investigate the performances of those environments which will good fitting the nature of matchmaking problem. For this purpose in this thesis, different environment models including P2P (Hypergrid, Gnutella with/without ultrapeer); smallworld (Watts-Strogatz); heavy-tailed and random versions of Autonomous System Waxman model showing power-law distribution property; random and 2D-Grid are considered. The flooding mechanism enabling process encounters for match purpose is uninformed Breadth-First-Search. In order to test the environments we made performance simulations with the matchmaking problem. Simulations show that the matchmaking performance of random environment outperforms the others for almost all different problems and time-tolive settings. On the other hand, the total cost of small world environment model is the highest for allmost all setups. Keywords: Unstructured and Decentralized Environments, Process Matchmaking, Performance, Simulation.
Efficient matchmaking is an important problem in unstructured and decentralized digital environments. We want to investigate the performances of those environments which will good fitting the nature of matchmaking problem. For this purpose in this thesis, different environment models including P2P (Hypergrid, Gnutella with/without ultrapeer); smallworld (Watts-Strogatz); heavy-tailed and random versions of Autonomous System Waxman model showing power-law distribution property; random and 2D-Grid are considered. The flooding mechanism enabling process encounters for match purpose is uninformed Breadth-First-Search. In order to test the environments we made performance simulations with the matchmaking problem. Simulations show that the matchmaking performance of random environment outperforms the others for almost all different problems and time-tolive settings. On the other hand, the total cost of small world environment model is the highest for allmost all setups. Keywords: Unstructured and Decentralized Environments, Process Matchmaking, Performance, Simulation.
Description
Keywords
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrol, Benzetim, Computer Engineering and Computer Science and Control, Simulation, Ekosistem, Ecosystem
Turkish CoHE Thesis Center URL
Fields of Science
Citation
WoS Q
Scopus Q
Source
Volume
Issue
Start Page
0
End Page
87
Collections
