Semantically-based cost-models and provably efficient implementations

Guy Blelloch
Carnegie Mellon University

I will discus cost-models for the lambda-calculus that model parallel time and space. I will then discuss how with such models we can prove relationships to time and space on more concrete machine models, such a network of processors, or a Parallel Random Access Machine (PRAM). This allows the programmer to thing about costs at a high-level but still have guarantees about performance.

Guy Blelloch

School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
USA
Email: guyb@xgate.scandal.cs.cmu.edu
Home page: http://www.cs.cmu.edu/~blelloch

Back to the list of talks