The paper "Parallel Genetic Algorithms" discusses the theoretical basics of Evolutionary Algorithms concentrating on Genetic Algorithms. Possibilities for a parallelization of these algorithms are examined and explained on the basis of concepts of parallel programming. A concrete suggestion for a practical realization of a parallel Genetic Algorithm at different levels of complexity is presented. / Die Studienarbeit zum Thema "Parallele Genetische Algorithmen" befasst sich mit den theoretischen Grundlagen Evolutionärer Algorithmen, wobei die Konzentration bei Genetischen Algorithmen liegt, und untersucht die Möglichkeiten einer parallelen Realisierung dieser Algorithmen. Des weiteren werden Konzepte der Parallelen Programmierung diskutiert sowie ein konkreter Vorschlag zur praktischen Realisierung eines parallelen Genetischen Algorithmus' auf verschiedenen Komplexitätsebenen vorgestellt.

The diploma thesis with the subject ¨Parallel Genetic Algorithms with Applications¨ deals with the parallelization of Genetic Algorithms for the creation of efficient optimization methods especially for simulation based application problems. First, an introduction to Genetic Algorithms and an overview of possible parallelization approaches as well as already published results of research are given. This is followed by a detailed explanation of the conception and realization of own Parallel Genetic Algorithms. The paper is rounded off by an particularized description of the results of extensive test runs on the Chemnitzer Linux-Cluster (CLiC). / Die Diplomarbeit zum Thema ¨Parallele Genetische Algorithmen mit Anwendungen¨ befasst sich mit der Parallelisierung Genetischer Algorithmen zur Erzeugung effizienter Optimierungsverfahren für insbesondere simulationsbasierte Anwendungsprobleme. Zunächst werden eine Einführung in Genetische Algorithmen sowie ein Überblick über mögliche Parallelisierungsansätze und bereits veröffentlichte Forschungsergebnisse gegeben. Dem schließt sich eine detaillierte Erläuterung der Konzeption und Umsetzung eigener Paralleler Genetischer Algorithmen an. Abgerundet wird die Arbeit durch eine ausführliche Darstellung der Ergebnisse umfangreicher Testläufe auf dem Chemnitzer Linux-Cluster (CLiC).

Barrier Synchronization is crucial for many parallel systems. This talk introduces different synchronization mechanisms and demonstrates new approaches to leverage special hardware properties of InfiniBand to lower the Barrier latency.

This talk discusses optimized collective algorithms and the benefits of leveraging independent hardware entities in a pipelined manner. The resulting approach uses overlap of computation and communication to reach this task. Different examples are given.

We compared well known measurement methods for LogGP parameters and discuss their accuracy and network contention. Based on this, a new theoretically exact measurement method that does not saturate the network is derived and explained in detail. The applicability of our method is shown for the low level communication API of Open MPI across several interconnection networks. Based on the LogGP model, we developed a low overhead packet scheduling algorithm. It can handle different types of interconnects with different characteristics. It is able to produce schedules which are very close to the optimum for both small and large messages. The efficiency of the algorithm for small messages is show for a Open MPI implementation. The implementation uses the LogGP benchmark to obtain the LogGP parameters of the available interconnects and can so adapt to any given system.

This thesis analysed the QLogic InfiniPath QLE7140 HCA and its onload architecture and compared the results to the Mellanox InfiniHost III Lx HCA which uses an offload architecture. As expected, the QLogic InfiniPath QLE7140 HCA can outperform the Mellanox InfiniHost III Lx HCA in latency and bandwidth terms on our test system in various test scenarios. The benchmarks showed, that sending messages with multiple threads in parallel can increase the bandwidth greatly while bi-directional sends cut the effective bandwidth for one HCA by up to 30%. Different all-reduce algorithms where evaluated and compared with the help of the LogGP model. The comparison showed that new all-reduce algorithms can outperform the ones already implemented in Open MPI for different scenarios. The thesis also demonstrated, that one can implement multicast algorithms for InfiniBand easily by using the RDMA-CM API.

Zugl.: Bayreuth, Univ., Diss., 2006 u.d.T.: Korch. Matthias: Effiziente Implementierung eingebetteter Runge-Kutta-Verfahren durch Ausnutzung der Speicherzugriffslokalität / Hergestellt on demand

Chemnitz, Techn. Univ., Diplomarb., 2002.

WWW-Konferenz Videokonferenz aus dem TU-Hoersaal Zur Umstellung der Unix-HOME-Verzeichnisse im URZ GCPP/128 -- aktueller Stand AFS im URZ Neuer Dienst: CD-Service Software-News

/uni/global im AFS Superskalares Rechencluster Neuer Dienst: Archivieren von Publikationen Das Batch-System DQS Neues vom Parallelrechner Softwareverteilung per WWW Software-News