Archives

Please note that this newsitem has been archived, and may contain outdated information or links.

19 May 2016, Theoretical Computer Science Seminar, Steve Homer

Speaker: Steve Homer (Boston U)
Title: Automatically Scalable Computation
Date: Thursday 19 May 2016
Time: 16:00-17:00
Location: CWI room L017, Science Park 123, Amsterdam

Abstract

A system is proposed which speeds up some computations by taking advantage of current large, fast memory in order to efficiently store and recall relevant computational histories. The system automatically exploits predicted patterns in a computation in order to accelerate computation when it can.

Specifically our project is developing a system which,
- uses information compression methods to efficiently store full computation states in a large, fast cache,
- leverages and develops machine learning techniques to learn and analyze patterns in these computations, and finally
- speculatively collects and organizes resultant states and uses them to accelerate the original computation in many instances.

The theoretical side of this project considers models of computation to describe these physical systems and to better understand their capabilities. Our goal is to quantify the specific speed-ups that can be achieved and to provide lower bounds indicating the limits of our approach.

For more information, contact Ronald de Wolf ().

Please note that this newsitem has been archived, and may contain outdated information or links.