1. SOLAR THERMAL PLANT DESIGN AND OPERATION SUITE OF TOOLS COMPUTATION USING OPENCL Instructor: Dr.Perez Davila 1

2. TEAM INFORMATION 1.Ramesh Pathuri - pathurir8276@uhcl.edu 2.Manasa Ravi - ravim7968@uhcl.edu 3.Ravinder Rao Chikkaraju -chikkarajur0446@uhcl.edu 4.Sunil Alasyam - alasyams8391@uhcl.edu MENTOR INFORMATION Mr.Peter Armstrong - peter.armstrong-1@tietronix.com Tietronix Software Inc. 2

3. AGENDA Introduction Project Objective Requirements Problem Specifications Use case Diagram Sequence Diagram Workflow Diagram System Architecture Implementation Algorithm Applied Technologies Project Timeline Website Demo Progress References 3

4. INTRODUCTION Solar thermal power plants are used to generate electricity from the energy of the sun. Heliostat-Movable mirrors that are used in the solar energy power plants. 4

5. INTRODUCTION Shading occurs when a heliostat casts its shadow on another heliostat located behind it. Blocking occurs when a heliostat in front of another heliostat, blocks the reflected suns energy on its way to the receiver. 5

6. PROJECT OBJECTIVE To develop a suite of software that can support the solar plant designers in computing the shading and blocking of a field of heliostats in real time. To produce a continuously updated 2D color contour map that represents the overall efficiency of the heliostat field. To calculate the position of the sun. To allow users to control the simulation date and time, the rate of change of time, the camera position. 6

7. REQUIREMENTS To read a text file in the format of ID,S,E,Z,R. To set the heliostat width and height, the pedestal height, receiver radius, and tower focal height entered by user. To find out the sun position at the date and time entered in by the user. To display the azimuth and elevation of the sun. To compute the shading and blocking of each heliostats. To render a 2D contour map of heliostat field. 7

8. PROBLEM SPECIFICATIONS Find the equation of the plane of target mirror. Find the co-ordinates of the target mirror on the absolute coordinate system. Find the co-ordinates of the source mirror on the absolute coordinate system. Compute the sun vector(X,Y,Z) in the absolute coordinate system. Compute the projections of the source mirror corners with respect to sun vector on to the target mirror plane. Compute the intersection area of the target mirror and the projected plane. 8

9. USE CASE DIAGRAM 9

10. 10

11. 11

12. WORK FLOW DIAGRAM 12

13. 13

14.  Once the shading and blocking between two mirrors is achieved it can be implemented on to eight mirrors.  The distance between the mirrors can be varied.  The Shading and Blocking for different values of ∆R and ∆Az are to be noted and stored. 14

15. Psuedo Code List outputList = subjectPolygon; for (Edge clipEdge in clipPolygon) do List inputList = outputList; outputList.clear(); Point S = inputList.last; for (Point E in inputList) do if (E inside clipEdge) then if (S not inside clipEdge) then outputList.add(ComputeIntersection(S,E,clipEdge)); end if outputList.add(E); else if (S inside clipEdge) then outputList.add(ComputeIntersection(S,E,clipEdge)); end if S = E; done Sutherland-Hodgeman polygon clipping algorithm: 15

16. APPLIED TECHNOLOGIES CUDA is NVIDIA’s parallel computing architecture that enables dramatic increases in computing performance by harnessing the power of the GPU. A CUDA device is built around a scalable array of multithreaded Streaming Multiprocessors(SMs). 16

17.  CUDA Features: CUDA driver is used for computing with fast data transfer path between GPU and CPU. CUDA driver interoperates with OpenCL and DirectX graphics drivers. It supports for Linux and Windows XP. GPUs have a parallel "many-core" architecture, and each core can run thousands of threads simultaneously. CUDA 17

18. OPENCL OpenCL (Open Computing Language) is a new heterogeneous computing environment, that runs on the CUDA architecture. It will allow developers to harness the massive parallel computing power of NVIDIA GPU’s to create compelling computing applications. 18

19. PROJECT TIMELINE 19

20. http://dcm.uhcl.edu/caps10g5/index.html 20

21.  Work Done: Worked on the SRS and Design of the project. Research on shading and blocking. Research on polygon clipping algorithm.  Future Work: Computing the shading and blocking formulas. Research on OpenCL. Implementing the sun position vector. 21

22. 1. Ramesh Pathuri Team Leader, Research, Programmer and Documentation. 2. Manasa Ravi Algorithm, programmer and Documentation. 3. Sunil Alasyam Research, Testing and Programmer. 4. Ravinder Rao Chikkaraju Designer, programmer and Webmaster. 22

23.  Peter Armstrong. An Annotated Algorithm for Shading and Blocking Computations of a Field of Heliostats Arranged in a Grid Layout. Available from Tietronix Software, Inc.; received February 4 2010.  http://www.khronos.org/opencl/ http://www.khronos.org/opencl/  http://www.khronos.org/developers/library/overview/opencl_overvie w.pdf http://www.khronos.org/developers/library/overview/opencl_overvie w.pdf  http://www.nvidia.com/object/cuda_opencl_new.html http://www.nvidia.com/object/cuda_opencl_new.html  http://2.bp.blogspot.com/_0A8DCf9FR68/Sk4bWJI54hI/AAAAAAA AAL4/zY57UgUhoA0/s400/solar-1.jpg http://2.bp.blogspot.com/_0A8DCf9FR68/Sk4bWJI54hI/AAAAAAA AAL4/zY57UgUhoA0/s400/solar-1.jpg 23

24. Thank you 24