1 / 11

Parallelization of the Telemedicine Benchmark for the Xbox 360 Architecture

Howard Wong, SURF-IT Fellow Professor Jean-Luc Gaudiot, EECS August 29, 2008. Parallelization of the Telemedicine Benchmark for the Xbox 360 Architecture. PASCAL : PA rallel S ystems and C omputer A rchitecture L ab. University of California, Irvine. Outline.

ematt
Download Presentation

Parallelization of the Telemedicine Benchmark for the Xbox 360 Architecture

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. Howard Wong, SURF-IT Fellow Professor Jean-Luc Gaudiot, EECS August 29, 2008 Parallelization of the Telemedicine Benchmark for the Xbox 360 Architecture PASCAL: PArallel Systems and Computer Architecture Lab. University of California, Irvine

  2. PASCAL: PArallel Systems & Computer Architecture Lab. Outline Background (Benchmark, Platform) Current Work Methodology (Compiler, Data Set) Results Conclusions Future Work

  3. PASCAL: PArallel Systems & Computer Architecture Lab. Background Why Parallel Programming? Advent of everyday multicomputers Ultimate goal: Auto-parallelization Basic concepts Problems Programming primitives Telemedicine Benchmark Platform – Xbox 360 3 Cores Graphics Engine Vector Processing Work ? Core 1 Core 2 Core n

  4. PASCAL: PArallel Systems & Computer Architecture Lab. Current Work Goal: Identify the parallelization process Efficiency measured in performance Performance in relation to load POSIX threads (pthreads) and OpenMP Sorting Routines 'fallbackSort' Making search 'brackets' 'mainSort' Dependencies between loop iterations

  5. PASCAL: PArallel Systems & Computer Architecture Lab. Methodology Compilation gcc or g++ version 4.2 Data Sets Monkey brain image in PPM format Derived data via netpbm Test Platform Xbox 360 with Ubuntu Linux Images courtesy of Neuroscience Center, UC Davis, and Joerg Meyer, Center of GRAVITY, Calit2, UC Irvine.

  6. PASCAL: PArallel Systems & Computer Architecture Lab. Initial Results

  7. PASCAL: PArallel Systems & Computer Architecture Lab. Analysis Possible thread contention 'bitmap' of data as former optimization Optimized for long runs of 0's or 1's Extra mutex locks required Thread Creation Sorting algorithm called at least 300 times for the large image Thread creation efficiency Thread management structures

  8. PASCAL: PArallel Systems & Computer Architecture Lab. Results (Cont’d)‏

  9. PASCAL: PArallel Systems & Computer Architecture Lab. Conclusions & Discussion Speedup dependent on the load size Possible improvements Use a 'threadpool' Create other important compression functions Examine alternative algorithms with a parallel mindset End result Thread creation Thread management overhead Heavy contention

  10. PASCAL: PArallel Systems & Computer Architecture Lab. Questions for Future Work What is the impact of thread creation? Do the other TMB programs have the same features? Can vector instructions improve program performance? Are new, more efficient parallel programming primitives needed for our application?

  11. PASCAL: PArallel Systems & Computer Architecture Lab. Acknowledgments Professor Jean-Luc Gaudiot and the PASCAL group UC Davis Neuroscience Center Professor Joerg Meyer, Center of GRAVITY, Calit2 Calit2 UROP

More Related