1 / 23

Parallel Programming with Java

Parallel Programming with Java. YILDIRAY YILMAZ Maltepe Üniversitesi. Message Passing Interface (MPI). MPI is a standard (interface or API) It defines a set of methods that are used by developers to write their application MPI library implement this method

doyle
Download Presentation

Parallel Programming with Java

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Parallel Programming with Java YILDIRAY YILMAZ Maltepe Üniversitesi

  2. Message Passing Interface (MPI) • MPI is a standard (interface or API) • It defines a set of methods that are used by developers to write their application • MPI library implement this method • MPI itself is not a library. It is a specification document that is followed.

  3. Message Passing Interface (MPI) • Reasons for popularity • Software and hardware vendors were involved • Significant contribution from academia • MPI compilers are widely used • It is the mostly adopted programming paradigm of IBM Blue Gene Systems

  4. Message Passing Interface (MPI) • There is an open source Java message passing library • http://mpj-express.org

  5. MPJ Express • What is MPJ Express? • MPJ Express is an open source Java message passing library that allows application developers to write and execute parallel applications for multicore processors and compute clusters/clouds. It is distributed under the MIT (a variant of the LGPL) licence.

  6. MPJ Express The MPJ Express can be configured in two ways. The first configuration is Multicore Configuration. It is used to execute programs on laptops and desktops. The second configuration is Cluster configuration. It is used to execute programs on clusters or network of computers.

  7. Multicore Configuration

  8. Cluster Configuration

  9. Steps involved in executing the ‘Hello World’ Java program for multicore configurations in Windows with Eclipse IDE Download one of the Eclipse IDE version. Download MPJ library Create a new project on Eclipse IDE and configure the build path Adjust run configurations Write the Hello World program Execute the parallel program

  10. Step 1: Download the Eclipse IDE Enter the http://www.eclipse.org/downloads/ and download latest Eclipse version.

  11. Step 2: Download MPJ library You can download from http://mpj-express.org/

  12. Step 3: Create a new project on Eclipse IDE and configure the buildpath

  13. Step 3: Create a new project on Eclipse IDE and configure the buildpath

  14. Step 4: Write the Hello World Program

  15. Step 5: Adjust Run Configurations • Click the «Run>Run Configuration» on Eclipse • Switch to Environment Tab • Click New • Set the MPJ_HOME to Name Input • Set the MPJ_HOME to Value Input (which is the path of MPJ home directory) • Switch to Argument Tab • Set the below line to VM Arguments’ text area • -jar ${MPJ_HOME}/lib/starter.jar -np 4 (this line gives the process count to jvm)

  16. Step 6: Run the Parallel Program Just right click your MPJ project and select the Run as Java Applicaton

  17. Your console output will be like this:

  18. Fibonacci 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... F(n) = F(n-1) + F(n – 2) with seed values F(0) = 0, F(1) = 1

  19. Recursive Fibonacci Pseudo Code function Fib(n) if n <= 1 then return n; else return Fib(n – 1) + Fib(n – 2) end if end function

  20. Time Complexity of Recursive Fibonacci Sequence T(n <= 1) = O(1)T(n) = T(n – 1) + T(n – 2) + O(1) Time Complexity is O(2n)

  21. Parallelized Fibonacci Pseudo Code function Fib(n) if n <= 1 then return n; else x = spawn Fib(n – 1) y = Fib(n – 2) sync return x + y end if end function

  22. Time Complexity of Parallelized Fibonacci T(n) = max(T(n – 1), T(n – 2)) + O(1)T(n) = T(n – 1) + O(1) Time Complexity of parallel fibonacci is O(Ø^n/n)

  23. Q & A Thanks... Yıldıray YILMAZ

More Related