BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:System Seminars - Title : Scalable Memory Hierarchies with QoS Gua
 rantees
DTSTART:20120417T133000
DTEND:20120417T143000
DTSTAMP:20260508T194254Z
UID:17a08a796832c31bd49a10f0f62af5c1be215f33f25b97b70645e3e3
CATEGORIES:Conferences - Seminars
DESCRIPTION:Christos Kozyrakis\, Stanford University\nAbstract :\nAs indus
 try is heading towards chips with hundreds of cores\, we need memory hiera
 rchies that can support efficiently large processor counts. In fact\, memo
 ry hierarchy is the most critical aspect of future multi-core architecture
 s because the latency and energy overheads of remote memory accesses (on-c
 hip or off-chip) dwarf the overheads of computational operations.\nThis ta
 lk will summarize three recent results towards scalable memory hierarchies
 . First\, we will introduce Zcache\, a technique that increases the number
  of replacement candidates in order to turn a low associativity cache into
  a high associativity cache without additional area or energy costs. Secon
 d\, we will discuss Vantage\, a scheme that allows us to divide a shared c
 ache into hundreds of fine-grain partitions\, while maintaining high assoc
 iativity within each partition and providing strict size guarantees. Final
 ly\, we will present the SCD organization for coherence directories that s
 cales to thousands of cores with constant latency and area/energy overhead
 s that grow logarithmically to the number of cores.\nMore importantly\, we
  can prove analytically and verify experimentally that the behavior of the
 se techniques is independent of workload patterns. Hence\, we can go beyon
 d the conventional design approach of "make the common case fast" and buil
 d memory hierarchies\nwith strong quality of service guarantees across all
  usage (scalable) without significant over-provisioning of resources (ener
 gy efficient).\n\nBio :\nChristos Kozyrakis is an Associate Professor of E
 lectrical Engineering & Computer Science at Stanford University. He works 
 on architectures\, runtime environments\, and programming models for paral
 lel computing systems. At Berkeley\, he developed the IRAM architecture\, 
 a novel media-processor system that combined vector processing with embedd
 ed DRAM technology. At Stanford\, he led the Transactional Coherence and C
 onsistency (TCC) project at Stanford that developed hardware and software 
 mechanisms for programming with transactional memory. He also led the Raks
 ha project\, that developed practical hardware support and security polici
 es to deter high-level and low-level security attacks against deployed sof
 tware. Dr. Kozyrakis is currently working on hardware and software techniq
 ues for next-generation data centers. He is also a member of the Pervasive
  Parallelism Lab at Stanford\, a multi-faculty effort to make parallel com
 puting practical for the masses.\nChristos received a BS degree from the U
 niversity of Crete (Greece) and a PhD degree from the University of Califo
 rnia at Berkeley (USA)\, both in Computer Science. He is the Willard R. an
 d Inez Kerr Bell faculty scholar at Stanford and a senior member of the AC
 M and the IEEE. Christos has received the NSF Career Award\, an IBM Facult
 y Award\, the Okawa Fundantion Research Grant\, and a Noyce Family Faculty
  Scholarship.
LOCATION:BC 410 https://plan.epfl.ch/?room==BC%20410
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR
