Sign in
Microsoft.com
 
Microsoft
 
 
 
Microsoft >
> 
> 
> 
Parallelization of a traffic circle algorithm

السؤال Parallelization of a traffic circle algorithm

  • Friday, May 04, 2012 10:10 PM
     
     
    Sign In to Vote
    0

    Hello,

    I am very new to both parallel programming and MPI. I've studied the basic MPI functions, but I don't have yet the mindset for solving problems in a parallel fashion. I'm kindly asking you guys to help me out with turning a sequential algorithm into a parallel one, using MPI. I'm talking about a traffic circle problem, presented in Michael J. Quinn's book, "Parallel Programming in C with MPI and OpenMP", under the chapter "Monte Carlo Methods", Case Studies, Traffic Circle (section 10.5.6). I had no trouble understanding the problem and the sequential algorithm, however I have no idea how I could extract parallelism from it. I know there are many parallel versions for this, anything would do. I really don't know where to start from. I mean, I can fantasise about parallel solutions, but i lack the skills to turn them into MPI code.

    I don't know the availability of that book, I could post the problem here, if that helps.

    Many thanks!