Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7755
Browse
2 results
Search Results
Conference Object Citation - Scopus: 2Resource Allocation Algorithm for a Relational Join Operator in Grid Systems(Association for Computing Machinery (ACM), 2012) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan; Morvan, FranckGrid systems become very popular during the last decade because of their rapidly increasing computational capabilities. On the other hand, the advances on different domains cause enormous increase in the scale of the manipulated data. This issue augments the importance of distributed query processing and causes researchers to port their underlying environment onto the grid systems. However the dynamicity, heterogeneity and large scale characteristics of grid systems pose new problems for the distributed query processing domain. Resource allocation for query processing in grid systems is one of these problems, which attracts many researchers' attention. In this paper, we propose a new resource allocation algorithm for one relational join operator in a query considering characteristics of the grid systems. We provide theoretical analyses of the proposed algorithm and we consolidate analyses with the simulations. Copyright © 2012 ACM.Master Thesis A Dominating Set Based Communication Architecture for Distributed Applications in Mobile Ad Hoc Networks(Izmir Institute of Technology, 2007) Çokuslu, Deniz; Aytaç, İsmail SıtkıIn this thesis, we aim to design and implement algorithms in a distributed environment in order to solve clustering, backbone formation and efficient routing problems for mobile ad hoc networks(MANET)s. Our first goal is to find a connected dominating set (CDS), then construct clusters using the clusterhead information and extend this approach to multi-level clusters. We propose a new Connected Dominating Set based clustering algorithm for clustering in MANETs. Our algorithm is based on Wu and Li's algorithm, however we provide significant modifications and heuristics such as considering the degrees of the nodes during marking process. We also extend our algorithm in order to generate a hierarchy of clusters. Our second goal is to implement a flooding based routing mechanism on top of CDS based clusters. We propose a two level flooding mechanism by using the CDS members as the gateways of the clusters. We describe the algorithms, analyze their time and message complexities and measure their performance in the simulation environments.