From:                     Kendra Smith

Sent:                      Monday, January 03, 2000 11:37 PM

To:                         M?crosöft Research Tech Talk, Sem. Notice

Cc:                         Kendra Smith

Subject:                 UW-CSE Colloq / 2-6-2000 / Baer / UW-CSE / 2K papers on caches by Y2K: Do we need more?

UW-CSE Colloq / 2-6-2000 / Baer / UW-CSE / 2K papers on caches by Y2K: Do we need more?

 

*NOTE* This lecture will be broadcast live via the Internet. See

http://www.cs.washington.edu/news/colloq.info.html for more information.

 

UNIVERSITY OF WASHINGTON

Seattle, Washington 98195

 

Department of Computer Science and Engineering

Box 352350

(206) 543-1695

 

COLLOQUIUM

 

SPEAKER:      Jean-Loup Baer

 

TITLE:          2K papers on caches by Y2K: Do we need more?

 

DATE:           Thursday, January 6, 2000

 

TIME:           3:30 pm

 

PLACE:                   134 Sieg Hall

 

HOST:           Alan Borning

 

ABSTRACT:

 

Caches were introduced  over 30 years ago. They have evolved from a single

level sectored cache, whose presence was oblivious to the Instruction Set

Architecture (ISA), to a multi-level hierarchy of caches, of various sizes

and associativities, that are exposed to the ISA, and that are accompanied

by a variety of hardware and software assists.

 

Caches have been a great success for enhancing the performance of computer

systems. We will briefly review some of the progress on cache design and

performance and give a personal anthology of key papers in the

area. However, in spite of the abundance of literature on the subject,

caches will remain an active area of research as long as the challenge of

the "memory wall" is still present. We will briefly describe our current

methodology for the design of cache assists, a methodology that borrows

from paradigms used in branch and value prediction.

 

Refreshments to follow.

 

Email: talk-info@cs.washington.edu

Info: http://www.cs.washington.edu