home · mobile · calendar · colloquia · 2005-2006 · 

Colloquium - Jessup

A Research Doubleheader
Department of Computer Science
12/1/2005
3:30pm-4:30pm
Part 1: Memory efficient sparse linear solvers

While competing linear algebra algorithms have traditionally been compared in terms of floating-point operation costs, it has long been known that the reduction of memory access costs is essential to attaining good performance. How to achieve such a reduction is becoming increasingly difficult. Improvements in microprocessors and in the numerical algorithms themselves mean that the arithmetic costs are decreasing and that memory costs can predominate. We will give an overview of our work on algorithm and tool development for reducing memory costs in sparse linear solvers.

Part 2: Bringing more women to the study of computer science

Many social scientists conduct research on increasing the participation of women in computing. In the academic world, however, it is the computer science faculty who must find ways of implementing their findings. Within this department, an important step is to offer courses that attract women. We have carried out a study of our course offerings, identifying courses that consistently have higher than average female enrollment. We will describe the features of those courses that contribute to their success in bringing women into the department.

Jessup is being considered for promotion to the rank of Professor.

Department of Computer Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
webmaster@cs.colorado.edu
www.cs.colorado.edu
May 5, 2012 (14:13)
XHTML 1.0/CSS2
©2012