Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, October 26, 2006, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Lars Engebretsen (Google Switzerland, Zurich)

Computing in Unstable Environments

A typical Google computing cluster is made up of thousands of commodity PCs that execute massively parallel computations. This leads to an inherently unstable computing environment. Every computation must be designed in such a way that hardware failures do not compromise the correctness of the computation, but the computation must still complete quickly and not use too much resources. In this talk, we describe and discuss some of the abstractions used by Google engineers to achieve these goals.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login