AZ (algorytmika i złożoność obliczeniowa)PD (przetwarzanie danych)
Opis przedmiotu:
The lecture describes methods of programming of the new artificial intelligence (AI) methods (mainly metaheuristics) in parallel and distributed systems, especially in clusters of workstations, mainframe computers and grids.
Algorithms and data structures
'''Program of lectures and laboratories'''
# Ada95 parallel programming language.
# Review of languages and environments of parallel programming, especially MPI (Message Passing Interface ) and CUDA (language of programming nVidia GPUs).
# Parallel programming on GPUs (especially on nVidia GeForce and Tesla series)
# Review of techniques of sequentional algporithms parallelization. Speedup, efficiency, cost optimality.
# Construction of parallel algorithms for artificial intelligence methods, i.e.:
## tabu search, TS,
## simulated annealing, SA,
## evolutionary algorithms EA, population-training PT,
## scatter search, SS,
## dynasearch, DS,
## neural networks, NN,
## path relinking,
## simulated jumping, SJ,
## ant colony optimization, ACO.
# Distributed programming in large networks.
'''Program of laboratory:'''
Implementation of algorithms described on lectures.
Bożejko W., Wodecki M., Evolutionary Heuristics for Hard Permutational Optimization Problems, Internationam Journal of Computational Intelligence Research, Volume 2, Issue 2, Research India Publications, 2006, 151-158.
J.A. Chandy, S. Kim, B. Ramkumar, S. Parkes, P. Banerjee, An evaluation of parallel simulated annealing strategies with applications to standard cell placement, IEEE Transactions on Computer Aided Design 16,1997
Z. Czech (red.) Programowanie wspołbieżne. Wybrane zagadnienia. Skrypt Politechniki Śląskiej nr 1931, 1995
Z. Czech, Three parallel algorithms for simulated annealing, Lecture Notes in Computer Science 2328, Springer Verlag 2002.
V. Kumar, A. Grama, A. Gupta, G. Karypis, Introduction to parallel computing, The Benjamin/Cummings Publishing Company, Inc, 1994.
C.R. Reeves (red.), Modern heuristic techniques for combinatorial problems, McGraw-Hill, 1995.
