From 892ec95e9cbc70b5efd260dbe95f0abc0c3632c1 Mon Sep 17 00:00:00 2001 From: Simon Law Date: Tue, 25 Mar 2003 19:05:35 +0000 Subject: [PATCH] - Reverted jlavoie's duplicates. --- events.xml | 45 --------------------------------------------- 1 file changed, 45 deletions(-) diff --git a/events.xml b/events.xml index 24c27bd..5f9bd71 100755 --- a/events.xml +++ b/events.xml @@ -2,51 +2,6 @@ - -Stream Processing - - -

Speaker: Michael McCool

- -

Stream processing is an enhanced version of SIMD processing that permits -efficient execution of conditionals and iteration. Stream processors have -many similarities to GPUs, and a hardware prototype, the Imagine processor, -has been used to implement both OpenGL and Renderman. It is possible that -GPUs will acquire certain properties of stream processors in the future, -which should make them much easier to use and more efficient for -general-purpose computation that includes data-dependent iteration and -conditionals.

- - - - - - -Abusing template metaprogramming in C++; aka. writing a -Mandelbrot generator that runs at compile time - - -

Templates are a useful feature in C++ when it comes to writing -type-independent data structures and algorithms. But that's not all -they can be used for. Essentially it is possible to write certain -programs in C++ that execute completely at compile-time rather than -run-time. Combined with some optimisations this is an interesting -twist on regular C++ programming.

- -

This talk will give a short overview of the features of templates and -then go on to describe how to "abuse" templates to perform complex -computations at compile time. The speaker will present three programs -that execute at compile time. First a factorial listing program, then -a prime listing program will be presented. Finally the talk will -conclude with the presentation of a Mandelbrot generator running at -compile-time.

- -

Some basic knowledge of C++ will be assumed.

- - - Learn Unix and be the envy of your friends!