Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach

Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of parallel, emergent and distributed systems Jg. 21; H. 5; S. 303 - 321
Hauptverfasser:	Suresh, S., Mani, V., Omkar, S. N., Kim, H. J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Taylor & Francis Group 01.10.2006
Schlagworte:	Divisible loads Genetic algorithms Processing time Scheduling problems Sequencing
ISSN:	1744-5760, 1744-5779
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!