Presentation is loading. Please wait.

Presentation is loading. Please wait.

Group 4 : Christopher Thorpe Jonghyun Kim ELEG-652 Principles of Parallel Computer Architectures Instructor : Dr. Gao Mentor : Joseph Data : 12/9/05.

Similar presentations


Presentation on theme: "Group 4 : Christopher Thorpe Jonghyun Kim ELEG-652 Principles of Parallel Computer Architectures Instructor : Dr. Gao Mentor : Joseph Data : 12/9/05."— Presentation transcript:

1 Group 4 : Christopher Thorpe Jonghyun Kim ELEG-652 Principles of Parallel Computer Architectures Instructor : Dr. Gao Mentor : Joseph Data : 12/9/05

2 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Divide the map by four areas - Only consider one area - Recursive algorithm

3 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Divide the map by four areas - Only consider one area - Recursive algorithm

4 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

5 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

6 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

7 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

8 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

9 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

10 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

11 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

12 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

13 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

14 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

15 Algorithm for a basic ray-tracing T7 T1T2 T3T4 T5 T6 Border Building Src Three types of tiles 1. Border 2. Building 3. Open space Three channel models 1. Open space 2. Absorption 3. Reflection - Devide the map by four areas - Only consider one area - Recursive algorithm

16 Distribution algorithm for the ray-tracing 120 0 Node 0 takes care of this ray range Node 1 takes care of this ray range Node 2 takes care of this ray range Without balanced tasks Assume we use three nodes

17 Distribution algorithm for the ray-tracing With balanced tasks R1 R2 R3 R4 R5 R6 R7 R8 (R1+R2+R3+R4)/3 Assume we use three nodes Equal ray range for buildings is (R5+R6+R7+R8)/3 Equal ray range for borders is Each node takes care of both ray ranges

18 Ray direction graph When the number of rays is 200

19 Ray direction graph When the number of rays is 10,000

20 Intensity graph of the received power When the number of rays is 200

21 Intensity graph of the received power When the number of rays is 10,000

22 Test bed

23 Varying the size of tiles - Map area : 100 100 m 2 - Number of rays : 3000 - Number of nodes : 6

24 Varying the number of rays - Map area : 100 100 m 2 - Tile size : 0.5 m - Number of nodes : 6

25 Varying the number of rays - Map area : 100 100 m 2 - Tile size : 0.5 m - Number of nodes : 6

26 Varying the number of nodes - Map area : 100 100 m 2 - Runtime of serial version : 231 s - Tile size : 0.2 m - Number of rays : 3000 SRC Another map

27 Varying the number of nodes - Map area : 100 100 m 2 - Tile size : 0.2 m - Number of rays : 3000 SRC Another map

28 Varying the number of nodes - Map area : 100 100 m 2 - Number of rays : 3000

29 Conclusion Performace depends on tile size, number of rays, and distribution of builings With balanced tasks, performance shows better than without balanced tasks Implementation overhead is mitigated for any practical map size.

30 Ray tracing - V. Sridhara, Models and Methodologies for Simulating Urban Mesh Networks - S. Bohacek, The Graph Properties of MANETs in Urban Environments - J. Hansen, Efficient Indoor Radio Channel Modeling Based on Integral Geometry - http://www.eecis.udel.edu/~bohacek/UDelModels/index.htmlhttp://www.eecis.udel.edu/~bohacek/UDelModels/index.html - http://en.wikipedia.org/wiki/Ray_tracerhttp://en.wikipedia.org/wiki/Ray_tracer - http://www.cc.gatech.edu/grads/h/helcyon1/http://www.cc.gatech.edu/grads/h/helcyon1/ raytracing/raytracing.html MPI - http://www-unix.mcs.anl.gov/mpi/tutorial/mpibasics/index.htmhttp://www-unix.mcs.anl.gov/mpi/tutorial/mpibasics/index.htm - http://www.mpi-forum.org/docs/mpi-20-html/mpi2-report.htmlhttp://www.mpi-forum.org/docs/mpi-20-html/mpi2-report.html - http://www.lam-mpi.org/tutorials/http://www.lam-mpi.org/tutorials/ - http://www-unix.mcs.anl.gov/mpi/mpichhttp://www-unix.mcs.anl.gov/mpi/mpich List of references and tools


Download ppt "Group 4 : Christopher Thorpe Jonghyun Kim ELEG-652 Principles of Parallel Computer Architectures Instructor : Dr. Gao Mentor : Joseph Data : 12/9/05."

Similar presentations


Ads by Google