Parallelism on multicore processors using Parallel.FX

The Parallel.FX Task Parallel Library is the latest tool developed for multicore parallelism optimization using the .NET technology. It is a managed concurrency library that provides optimized managed code for multicore processors using a new thread pool that withstands cancellation, waiting and pool isolation, among many other features. The Task Parallel Library also uses dynamic work stealing techniques for superior scalability. This paper analyzes the performance improvement of using the Task Parallel Library of Parallel.FX when applying a Multi-Objective Evolutionary Algorithm to solve a timetabling problem. For comparative purposes, this algorithm has also been parallelized using threads. The results obtained show that both alternatives allow a reduction in the runtime necessary to solve this problem. However, parallelizing the code using the Task Parallel Library of Parallel.FX has the advantage of being easier and the code size is much smaller than directly programming threads.

[1]  Consolación Gil,et al.  Improving the Performance of Multi-Objective Evolutionary Algorithms Using the Island Parallel Model , 2007, Parallel Process. Lett..

[2]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[3]  Jeffrey H. Kingston,et al.  The Complexity of Timetable Construction Problems , 1995, PATAT.

[4]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

[5]  Gary B. Lamont,et al.  Considerations in engineering parallel multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[6]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[7]  Maria Dolores Gil Montoya,et al.  A hybrid method for solving multi-objective global optimization problems , 2007, J. Glob. Optim..

[8]  David E. Goldberg,et al.  Efficient Parallel Genetic Algorithms: Theory and Practice , 2000 .

[9]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[10]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[11]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[12]  Julio Ortega,et al.  Performance Analysis of Parallel Strategies for Bi-objective Network Partitioning , 2006 .

[13]  Luca Di Gaspero,et al.  Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems , 2006, J. Math. Model. Algorithms.

[14]  Ben Paechter,et al.  Two solutions to the general timetable problem using evolutionary methods , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[15]  Julio Ortega Lopera,et al.  A Parallel Multilevel Metaheuristic for Graph Partitioning , 2004, J. Heuristics.