Home

From Sampa

Sampa is a collection of research projects aimed at developing SAfe MultiProcessing Architectures to address the concurrency challenge. We are part of the Computer Science and Engineering Department at the University of Washington.

Our goal is to improve the programmability and reliability of multiprocessor and multicore systems. The nature of the concurrency challenge is inter-disciplinary and so are we. Our projects include innovation in architecture, operating systems, compilers and programming languages.

We have strong ties with the WASP group at UW-CSE.


News

  • Our paper on sounds and precise race detection in HW/SW was accepted to ISCA!
  • Adrian Sampson wins a Facebook PhD Fellowship!!
  • Melody Kadenko is now Program Director!
  • We will present two papers at WoDet-ASPLOS, one on automatic fault avoidance, and one on merging execution and language level deterministic guarantee.
  • Our paper "Architectural Support for Disciplined Approximate Programming" was accepted to ASPLOS'12.
  • Tom Bergan wins a Google PhD Fellowship!!
  • Our paper "Data-Race Exceptions Have Benefits Beyond the Memory Model" was accepted to MSPC'11.
  • Joe Devietti wins an Intel Fellowship! And Katelin Bailey wins an NSF fellowship!
  • Our paper on large graph processing with commodity processors was accepted to HotPar'11.
  • Our paper on minimal HW support for race detection will appear in EuroPar'11.
  • Our paper on OS Implications of Non-volatile Memory was accepted to HotOS'11!
  • We will present three papers during ASPLOS next week: one on relaxed consistency determinism (main conference), Dense Approximate Storage (WACI session), and a critical look at determinism (WoDet).
  • Our paper on energy-aware programming was accepted to PLDI'11,
  • Our paper on reconstructing executions for debugging was accepted to PLDI'11.
  • Our paper on analyzing the power efficiency of lock-free data-structures was accepted to INTERACT'11.
  • Our paper on "Checked Load: Architectural Support for JavaScript Type-Checking on Mobile Processors Authors" has been accepted to HPCA'11.
  • Our paper on "RCDC: Relaxed Consistency Deterministic Computer" has been accepted to ASPLOS'11.
  • Our paper on "A Limit Study of JavaScript Parallelism" has been accepted to IISWC'10.
  • Our paper on "Deterministic Process Groups in dOS" has been accepted to OSDI'10.
  • Rodolfo Azevedo, from UNICAMP, Brazil, has just arrived and will be spending the year with us.
  • Our paper on "Composable Specifications for Structured Shared-Memory Communication" has been accepted to OOPSLA'10.
  • The CoreDet source code has been released.
  • Our paper "Lock Prediction" was accepted to HotPar 2010.
  • Brandon wins an IBM Fellowship!
  • Our paper "CoreDet: A Compiler and Runtime System for Deterministic Multithreaded Execution" was accepted to ASPLOS'10.
  • The ASPLOS'09 DMP paper was selected for IEEE Micro Top Picks 2010.
  • Our paper "Finding Concurrency Bugs with Context-Aware Communication Graphs" was accepted to MICRO'09.
  • Luis was named a 2009 Microsoft New Faculty Fellow. More information, and a brand-new 'glamour shot' photo, at Microsoft's NFF page!
  • Our paper on Concurrency Discovery for Very Large Windows of Execution was accepted to the PESPMA Workshop, held with ISCA'09.
  • Our Case for Concurrency Exceptions paper was accepted to USENIX Hot Topics in Parallelism 2009.
  • Luis' was awarded an NSF CAREER award for a proposal entitled "Deterministic Shared Memory Multiprocessing: Vision, Architecture and Impact on Programmability"!
  • Atom-Aid and DMP were licensed by UW's TechTransfer.