Computer Engineering / Bilgisayar Mühendisliği

Permanent URI for this collectionhttps://hdl.handle.net/11147/10

Browse

Search Results

Now showing 1 - 3 of 3
  • Conference Object
    Computational Sciences Learning Project for Pre-University Students
    (Springer Verlag, 2007) İnceoğlu, Mustafa Murat; Aslan, Burak Galip
    It is quite useful for high school students to study on computational sciences, especially for those who are planning to have a higher education in engineering. This paper proposes a pilot study on 9th and 10 th grade students for teaching them the basic aspects of computer sciences. This study focuses on a schedule consisting two consecutive courses - first one theoric and the second one is applied - for student volunteers from science high schools.
  • Conference Object
    Citation - WoS: 6
    Citation - Scopus: 8
    A Cluster-Based Dynamic Load Balancing Middleware Protocol for Grids
    (Springer Verlag, 2005) Erciyeş, Kayhan; Payli, Reşat Ümit
    We describe a hierarchical dynamic load balancing protocol for Grids. The Grid consists of clusters and each cluster is represented by a coordinator. Each coordinator first attempts to balance the load in its cluster and if this fails, communicates with the other coordinators to perform transfer or reception of load. This process is repetaed periodically. We show the implementation and analyze the performance and scalability of the proposed protocol.
  • Conference Object
    Citation - WoS: 4
    Citation - Scopus: 4
    Merging Clustering Algorithms in Mobile Ad Hoc Networks
    (Springer Verlag, 2005) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, Deniz
    Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We first look at minimum spanning tree(MST) based algorithms and then propose a new algorithm for clustering in MANETs. The algorithm we propose merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities.