Parallel Minimum Spanning Tree Algorithm

In the graduate course Concurrent Object Oriented Languages, taught at York University, Toronto, students do three assignment and write a paper based on these assignments.

The objective of the first assignment is to find a nontrivial concurrent algorithm in the literature. In the second assignment, the aim is the implementation of the concurrent algorithm presented in the first assignment in Java. The focus of the third assignment is to apply tools to verify the concurrent Java program of the second assignment.

Assignment on the European Football Elimination Problem (University of Osnabrueck)

The paper summarizes an assignment on the European Football Elimination Problem which was given to my students in this year\'s lecture on parallel and distributed algorithms. The students were asked to use Intel\'s TBB 3.0 to solve the assignment. The material also contains an application named Team Planer which can be used to generate input files for testing purposes.

Introduction to Parallel Programming video lecture series – Part 01 “Why Parallel? Why Now?”

The lecture given here is the first part in the “Introduction to Parallel Programming” video series. This part endeavors to define parallel computing, explain why parallel computing is becoming mainstream, and explain why explicit parallel programming is necessary. This part sets the tone for the other 11 parts in the series.

Running time: 9:51

Scalable parallel genetic algorithm for identifying sequences construction

The task of constructing of identifying sequences for synchronous sequential circuits is one of the central problems in the design process. Genetic algorithm (GA) is one of the possible solutions of this task. It uses simulation of digital circuits to value the quality of potential solutions. Due this fact GA of input sequences generation are very slowly. In this paper we propose parallel versions of GA of this type that adapted for multi-core workstations. In our approach we organize several parallel threads.

Parallel fault simulation algorithm for multi-core systems with common memory

Fault simulation for sequential circuits numbers among the highly compute-intensive tasks in the integrated circuit design process. In this paper we propose a new parallel fault simulation algorithm for multi-core workstations with common memory. We use dynamic fault grouping for each input test vector. Also each formed group is simulated in separate thread. Also we study the scalability of proposed algorithm. We report results for the ISCAS-89 benchmark circuits obtained on Intel’s MTL with 12 computational cores.

Subscribe to parallel