Parallel Programming Talk #88- Listener Question Show

Today is August 3th and on show 88 Clay and I will be Answering Listener Questions with 1.21 Gigawatts of power running through our flux capacitor!

Download Link - MP3 Audio File (Small):



Download Link - High Quality MP4 Video File (Large):



First the News:


Congratulations to Our Threading Challenge Phase 1 Problem 2 winners!
Master Level: 2 - Skip List - 1st Place: Dmitriy Vyukov
Apprentice Level: 2 - Prime Array - 1st Place: doraemonok
Phase 2 Problem 1 began on Monday, August 9, and is due 2010 August 30, 2010 at 12:00 PM (Pacific Daylight Time)


Get ready to attend the CT Tutorial to be given by Intel’s Dr. Michael Klemm, at the Nineteenth International Conference on Parallel Architectures and Compilation Techniques (PACT) September 11-15, 2010 in Vienna Austria. Registration for the conference is well underway and you can even register the week of the conference.


Superscalar Programming 101 (Matrix)
For this 5-part article, ISN Black Belt Jim Dempsey takes a small, well-known algorithm, shows a common approach to parallelizing that algorithm, follows with a better one and lastly, produces a fully cache-sensitized approach. Readers of this article will learn a methodology for interpreting test run statistics and to improve their code using those interpretations.


The Intel Math Kernel Library 10.3 Beta has been Released
Intel® Advanced Vector Extensions (Intel AVX) optimization
Summary Statistics library - modern algorithms that enhance accuracy and performance of statistical computations.


Intel Developer Forum Returns to San Francisco, Sept. 13-15


If you have questions you'd like to see up discuss, ideas for show topics or just want to send fan mail....
Send Email to parallelprogrammingtalk@intel.com


On Today's Show:


Clay will be discussing the recently completed Thread Challenge problem.


Connected Components in a Graph


Write a threaded program to compute the number of connected components and the maximum and minimum number of nodes from among the connected subgraphs within an input graph.


Prime Array Search


Write a threaded program that finds an example of a prime array that has the maximum number of primes hidden within it for a given array size.


Coming up next on Parallel Programming Talk...
Prof. Alexandra Fedorova - Managing Contention for the Shared Resources on Multicore Processors
Date/Time: 8/10/2010 at 8:00 AM Pacific - Watch Live on ISN TV


Set your alarm to watch Parallel Programming Talk Tuesday at 8:00AM PT on Intel Software Network TV.

Per informazioni complete sulle ottimizzazioni del compilatore, consultare l'Avviso sull'ottimizzazione