Storage Informer
Storage Informer

Parallel Programming Talk #39 – What’s new in TBB 2.2?

by on Jul.17, 2009, under Storage

Parallel Programming Talk #39 – What’s new in TBB 2.2?

Aaron was out of the office for the show, so Clay Breshears and Michael Wrinn hosted the show.

Download an MP3 of the show.

Download link to a high quality MP4 video file of the show (about 290MB)

News:
Threading Challenge Update We have a winner for Challenge Prolem #5 (Knapsack Problem): "matteocilk.com" . Problem #6 winner should be announced by the end of the week and the overall winner of the Phase 1 set of problems will be revealed early in the week of 20 JUL.

Upcoming Events:

Show Notes:

Our Guest today was Michael Voss, Ph.D. Mike is an engineer in the Performance, Analysis and Threading Lab at Intel. He is one of the senior developers on the IntelĀ® Threading Building Blocks team. We asked Mike what was going to be new in the upcoming Intel Threading Building Blocks version 2.2. Mike talked about the new parallel_foreach algorithm and added support for lambda functions within TBB. For more information, participate in forum discussions on the latest features in Threading Building Blocks, or to download the current version of TBB (2.1) go to www.threadingbuildingblocks.org.

Next Show:

Live Tuesday 21 JUL at 8am (PT). Guest: Prof. Guy Blelloch, Carnegie-Mellon University.

Aaron and Michael will be talking with Dr. Blelloch about his recient essay "Is Parallel Programming Hard?". Dr. Blelloch proposes that with the right level of abstraction, Parallel Programming is not and in fact can be as easy as sequential programming. He does note that, however, that "at the right level of abstraction" should be considered with care.

URL: http://feedproxy.google.com/~r/IntelBlogs/~3/fMnq92CnfUM/

:, , , , , , , , , , ,

Leave a Reply

Powered by WP Hashcash

Looking for something?

Use the form below to search the site:

Still not finding what you're looking for? Drop a comment on a post or contact us so we can take care of it!

Visit our friends!

A few highly recommended friends...