Paralel bilgisayarlarda task allocation ve scheduling problemlerinin genetik algoritmalar kullanılarak çözümü


Tezin Türü: Yüksek Lisans

Tezin Yürütüldüğü Kurum: Eskişehir Osmangazi Üniversitesi, FEN BİLİMLERİ ENSTİTÜSÜ, ELEKTRİK-ELEKTRONİK MÜHENDİSLİĞİ, Türkiye

Tezin Onay Tarihi: 1999

Tezin Dili: Türkçe

Öğrenci: HÜSEYİN GÜRAY GÜRLEK

Danışman: Nihat Adar

Özet:

Genetic Algorithms are adaptive search algorithms based on principles from population genetics. Various transformations are performed on succesive populations through genetic operators and functions which generate new solutions by combining the characteristic of the previous solutions. These algoritihms can be used to find the optimum solutions for the task allocation and task scheduling problems on multicomputers. In this study, a computer program in Delphi is written to solve these problems.