Abstract
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 language | English |
---|---|
Title of host publication | Proceedings: 2nd HiPEAC Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures |
Editors | C. Grelck, K. Hammond, S. B. Scholz |
Publisher | HiPEAC |
Number of pages | 8 |
Publication status | Published - Jan 2012 |
Event | 2nd FD-COMA Workshop at HiPEAC Conference 2013 - Berlin, Germany Duration: 22 Jan 2013 → 22 Jan 2013 http://www.project-advance.eu/2012/07/fd-coma-workshop-2013/ |
Conference
Conference | 2nd FD-COMA Workshop at HiPEAC Conference 2013 |
---|---|
Country/Territory | Germany |
City | Berlin |
Period | 22/01/13 → 22/01/13 |
Internet address |