1 / 12

by : Justin C. Miller

Strategies for Developing Visualizations of Parallel Algorithms for Dense Matrix Operations on Interconnected SIMD Computers. by : Justin C. Miller. 1/12. Who am I ?. Justin Miller Computer Science Major Mathematics Minor Goals: Receive PhD Become College Professor. 2/12.

nola
Download Presentation

by : Justin C. Miller

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. Strategies for Developing Visualizations of Parallel Algorithms for Dense Matrix Operations on Interconnected SIMD Computers by : Justin C. Miller 1/12

  2. Who am I ? Justin Miller Computer Science Major Mathematics Minor Goals: Receive PhD Become College Professor 2/12

  3. Why’d I choose this topic? Strategies for Developing Visualizations of Parallel Algorithms for Dense Matrix Operations on Interconnected SIMD Computers • Wanted to combine topics… • Computer Science • Mathematics • Education/Teaching 3/12

  4. Outline of Talk • Teach you the General Concepts needed to understand what I’ve done. 2. Quick overlook of what I’ve done. 4/12

  5. Matrices and Matrix Operations What is a matrix? What is a dense matrix? (as opposed to sparse) What are matrix operations? eg. (multiplication, transposition) 5/12

  6. Performing matrix operations on Parallel Computers The concept of parallel computing. What does it mean to be SIMD? Subclasses of SIMD computers. eg. (shared memory, interconnected) Types of Interconnected Networks. 6/12

  7. How did I make the visualizations? 2 Step Process to animate the algorithms… 1. Understand it using JCSP library public void run(){ int data = getStartingData() ; while(counter < 10){ ToLeft.pass(data) ; data = FromRight.get(); calculate(data) ; }//while writeFinalAnswer(data) ; }//run 2. Animate it using Animal square “square1” (10, 10) 40 color blue text “title” “Justin’s Demo” (40,40) centered color black font Serif size 14 bold 7/12

  8. Why design visualizations for these algorithms? Lots of motion & passing of data Difficult to draw, lots of mistakes Quicker preparation time for lectures Attracts student attention 8/12

  9. Actually in my Thesis paper. Strategies for developing animations for these algorithms. Some general techniques mentioned in other papers. eg. Quiz Questions, Descriptive Text, High Contrast, Step-Thru & Play Several specific techniques for parallel matrix algorithms on Interconnected SIMD computers. eg. show channels, pass data along channels, show register contents Example: abstract delays by making certain events appear exactly in parallel. 9/12

  10. Case Study General results of prior research. Had to see it to believe it. Mostly for feedback. 10/12

  11. Summation Like to idea of visualizations in the classroom. Future possibility of conducting a more controlled scientific study Most importantly, preparation for graduate research Thank you, Questions? 11/12

  12. Further interest? Here’s some free downloads. Download Java http://java.sun.com/j2se/1.4/download.html Download JCSP library http://www.cs.ukc.ac.uk/projects/ofa/jcsp/ Download Animal http://www.animal.ahrgr.de/ 12/12

More Related