The ant colony in par-synthesis of computer system

Authors:
Mieczysław Drabowski
Affiliations:
Cracow University of Technology, Kraków, Poland
Venue:
ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing
Year:
2007

Citing 4
Cited 0

Scheduling Multiprocessor Tasks to Minimize Schedule Length

IEEE Transactions on Computers
Ant algorithms for discrete optimization

Artificial Life
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing cost and minimizing schedule length in synthesis of fault tolerant multiprocessors systems

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a coherent approach to solving the problems of computer system synthesis based on Ant Colony Optimization methods. We describe algorithm realizations aimed to optimize resource selection and task scheduling, as well as the adaptation of this algorithm for coherent co-synthesis realization. This is approach, which we called a par-synthesis [1]. We then present selected analytical experiments proving the correctness of the par-synthesis concept and indicate its practical motivations.