Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Safe Nondeterminism in a Deterministic-by-Default Parallel Language
 

Summary: Safe Nondeterminism in a
Deterministic-by-Default Parallel Language
Robert L. Bocchino Jr.1
Stephen Heumann2
Nima Honarmand2
Sarita V. Adve2
Vikram S. Adve2
Adam Welc3
Tatiana Shpeisman4
1
Carnegie Mellon University 2
University of Illinois at Urbana-Champaign 3
Adobe Systems 4
Intel Labs
rbocchin@cs.cmu.edu dpj@cs.uiuc.edu awelc@adobe.com tatiana.shpeisman@intel.com
Abstract
A number of deterministic parallel programming models with
strong safety guarantees are emerging, but similar support for non-
deterministic algorithms, such as branch and bound search, remains
an open question. We present a language together with a type and

  

Source: Adve, Sarita - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collections: Computer Technologies and Information Sciences