Distributed scheduling using simple learning machines
A new approach to develop parallel and distributed algorithms of scheduling tasks in parallel computers is proposed. A game theoretical model with the use of genetic-algorithms based learning machines called classifier systems as players in a game, serves as a theoretical framework of the approach....
Gespeichert in:
Veröffentlicht in: | European journal of operational research 1998-06, Vol.107 (2), p.401-413 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A new approach to develop parallel and distributed algorithms of scheduling tasks in parallel computers is proposed. A game theoretical model with the use of genetic-algorithms based learning machines called classifier systems as players in a game, serves as a theoretical framework of the approach. Experimental study of such a system shows its self-organizing features and the ability of collective behaviour. Following this approach a parallel and distributed scheduler is described. A simple version of the proposed scheduler has been implemented. Results of the experimental study of the scheduler demonstrate its high performance. |
---|---|
ISSN: | 0377-2217 1872-6860 |
DOI: | 10.1016/S0377-2217(97)00342-1 |