Received: from ATHENA.MIT.EDU by po7.MIT.EDU (5.61/4.7) id AA19887; Sun, 20 Jun 93 10:06:31 EDT Received: from Sunset.AI.SRI.COM by Athena.MIT.EDU with SMTP id AA26965; Sun, 20 Jun 93 10:06:28 EDT Received: by Sunset.AI.SRI.COM (4.1/SMI-4.1) id AA17722 for kkkken@athena.mit.edu; Sun, 20 Jun 93 07:05:20 PDT Date: Sun 20 Jun 93 07:05:19-PDT From: Dick Duda Subject: [murer@ICSI.Berkeley.EDU (Stephan Murer): Next video Lunch] To: kkkken@Athena.MIT.EDU Message-Id: <740585119.0.DUDA@SUNSET.ARPA> In-Reply-To: <9306181513.AA14810@vlsi.bu.edu> Mail-System-Version: Hi Ken, Greetings from Boston. (I'm sending this through Telnet, using the Athena Cluster in Bldg. 1). Thought you might want to know about the video series on operating systems at Berkeley. Hope you had a great time at the Sea Ranch. Love, Dad --------------- Return-Path: Received: from icsia.ICSI.Berkeley.EDU by Sunset.AI.SRI.COM (4.1/SMI-4.1) id AA20438 for duda; Wed, 16 Jun 93 18:23:32 PDT Received: from icsib55.ICSI.Berkeley.EDU by icsia.ICSI.Berkeley.EDU (4.1/HUB$Revision: 1.17 $) id AA02532; Wed, 16 Jun 93 18:10:00 PDT From: murer@ICSI.Berkeley.EDU (Stephan Murer) Received: by icsib55.ICSI.Berkeley.EDU (4.1/1.7) id AA26896; Wed, 16 Jun 93 18:09:59 PDT Date: Wed, 16 Jun 93 18:09:59 PDT Message-Id: <9306170109.AA26896@icsib55.ICSI.Berkeley.EDU> To: vlunch@ICSI.Berkeley.EDU, talk@ICSI.Berkeley.EDU Subject: Next video Lunch The following video will be shown on Thursday, June 17, at noon: "Data-Parallel Algorithms" Guy L. Steele Jr. Thinking Machines Recorded 7/18/90 RT: 44:18 minutes The data parallel programming style emphasizes exploiting parallelism in the data: opportunities to perform similar processing on many data elements at once. The metaphor is to assume that there are enough processors to provide one for each data item. This is like array processing, but data structures more general than arrays of floating point numbers are considered. Many interesting algorithms use pointers. Recurring themes in parallel programming include elementwise operations, conditionals, replication (broadcasting, spreading, and fetching), reduction (full reduction, row/column reduction, and combining store), permutation and scanning (parallel prefix). Parallel algorithms for matrix multiplication and region labeling in an image illustrate the use of these building blocks in real applications. ---------------------------------------------------------------- We will take a summer break with the video lunches. As soon as I have new interesting videos I will come up with a new program. I am happy to take any proposals for new videos. ---------------------------------------------------------------- The lunch meetings are held at the International Computer Science Institute, 1947 Center St, Berkeley, 6th floor in the main lecture hall. The idea of the these meetings is that one may eat a lunch and at the same time watch a video. If the auditorium feels like it there is some discussion afterwards. We think it is a convenient way to update our knowledge in fields where such videos exist. I am maintaining a mail list of the people interested into the video lunches. Please notify me if you want to be added to the mail list. The vlunch@icsi mail list doesn't only serve as a medium to announce videos. Comments and discussions on past tapes are most welcome on vlunch@icsi. -- Stephan ------- -------