parallel program for an algorithem

  • Status: Closed
  • Prize: $30
  • Entries Received: 3

Contest Brief

Choose a problem from the topics below or other topics and design two different algorithms for this problem. For each algorithm, write a parallel program. Students will be asked to present their problem description, algorithm(s) employed, program description, and performance plots to the class using 5-10 minutes.


Submit the following: A 3-5 page single-spaced project report (hard copy) containing the following sections:
1. your problem,
2. chosen algorithms,
3. associated data structures,
4. underlying communication pattern,
5. parallel time complexity for each implementation
6. performance of each program with reference to the plots for (a) execution time and for (b) speedup as number of processes varies, and
9. your conclusions containing your interpretation of the performance of these programs, their limitations, and possible future improvements.


Suggested problems
1. Sorting: Bitonic sort, hyperquick sort, sorting by regular sampling, bucket and sample sort
2. Fast Fourier Transform: hypercube topology
3. Solving Linear Systems: Row oriented Gaussian elimination on hypercube topology, Jacobi algorithm, Gauss Seidel algorithm, Conjugate gradient.
4. Shortest Paths in a Graph
5. Traveling Sales Person
6. Minimum spanning tree
7. Graph Coloring

Recommended Skills

Top entries from this contest

View More Entries

Public Clarification Board

  • IMRADIANTSUPREME
    IMRADIANTSUPREME
    • 2 years ago

    I can give you a fast parallel graph coloring heuristic that is well suited for shared memory programming and yields an almost linear speedup on the PRAM model,but you have to be reasonable.

    • 2 years ago
    1. ysrikanth3000
      Contest Holder
      • 2 years ago

      the above link states that we hired to do this project

      • 2 years ago
    2. IMRADIANTSUPREME
      IMRADIANTSUPREME
      • 2 years ago

      do you have already hired me ?
      i don't see and accept project link,plz award the project to me your solutions are ready

      • 2 years ago
  • freelancerStefan
    freelancerStefan
    • 2 years ago

    I have make new algorithm for "4. Shortest Paths in a Graph". Can give you feedback for that just text me on email. My algorithm will make the shortest path from a single node to all nodes in the graph (" 6. Minimum spanning tree"). Looking forward hearing from you.

    • 2 years ago
    1. ysrikanth3000
      Contest Holder
      • 2 years ago

      It's really glad to be hear. Any of the option is works fine for me. And I want to know how much time you take for that to submit me. Can I get it by tonight?

      • 2 years ago
  • keithasr
    keithasr
    • 2 years ago

    I can provide you with various algorithms for TSP, including a report. But, price needs to be reasonable.

    • 2 years ago
    1. ysrikanth3000
      Contest Holder
      • 2 years ago

      Okay, well I agree with you to get the algorithms on TSP. And what's the reasonable price?

      • 2 years ago
    2. ysrikanth3000
      Contest Holder
      • 2 years ago

      And when can I expect the whole project if you start it now because i need it ASAP. It would be really appreciated if you can submit by tonight!

      • 2 years ago
  • IMRADIANTSUPREME
    IMRADIANTSUPREME
    • 2 years ago

    WOW great !! this is not a parallel bubble sort algorithm.(ABOVE)
    HEAR IT IS
    A way to implement the Bubble Sort in parallel is to divide the list of data (more or less) equally between the N-1 nodes 1 to (N-1) of an N nodes parallel machine, keeping node 0 to administer the calculation. Each node 1 to (N-1) can then sort its partial list and send it back to node 0 for a final global merge.

    • 2 years ago

Show more comments

How to get started with contests

  • Post your contest

    Post Your Contest Quick and easy

  • Get tons of entries

    Get Tons of Entries From around the world

  • Award the best entry

    Award the best entry Download the files - Easy!

Post a Contest Now or Join us Today!