Modeling Streams-based Variants of Ant Colony Optimisation for Parallel Systems

Wei Cheng, Frank Penczek, Clemens Grelck, Raimund Kirner, Bernd Scheuermann, Alex Shafarenko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Downloads (Pure)


In this paper we present the implementation of a concurrent ant colony optimisation based solver for the combinatorial Single Machine Total Weighted Tardiness Problem (ACO- SMTWTP). We introduce S-Net, a coordination language based on dataflow principles, report on the performance of the implementation and compare it against a sequential and a parallel implementation of the same algorithm in C. As the workload of the optimisation algorithm is highly irregu- lar we consider this application to be an important use-case for runtime measurement directed optimisations of the co- ordination rogram as much as for guiding optimisations of numerical code.
Original languageEnglish
Title of host publicationProceedings: 2nd HiPEAC Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures
EditorsC. Grelck, K. Hammond, S. B. Scholz
Number of pages8
Publication statusPublished - Jan 2012
Event2nd FD-COMA Workshop at HiPEAC Conference 2013 - Berlin, Germany
Duration: 22 Jan 201322 Jan 2013


Conference2nd FD-COMA Workshop at HiPEAC Conference 2013
Internet address


Dive into the research topics of 'Modeling Streams-based Variants of Ant Colony Optimisation for Parallel Systems'. Together they form a unique fingerprint.

Cite this