<--- Back to Details
First PageDocument Content
Software engineering / Computing / Computer programming / Concurrency control / Transaction processing / Complexity classes / Java / Functional languages / Deterministic Parallel Java / Determinism / Deterministic algorithm / Linearizability
Date: 2011-01-04 17:23:47
Software engineering
Computing
Computer programming
Concurrency control
Transaction processing
Complexity classes
Java
Functional languages
Deterministic Parallel Java
Determinism
Deterministic algorithm
Linearizability

Safe Nondeterminism in a Deterministic-by-Default Parallel Language Robert L. Bocchino Jr.1 Stephen Heumann2 Nima Honarmand2 Sarita V. Adve2

Add to Reading List

Source URL: www.adamwelc.org

Download Document from Source Website

File Size: 763,39 KB

Share Document on Facebook

Similar Documents

A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents Nathan Linial ∗

A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents Nathan Linial ∗

DocID: 1tcbx - View Document

Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes E. Busra Celikkaya University of California, Riverside  CELIKKAE @ CS . UCR . EDU

Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes E. Busra Celikkaya University of California, Riverside CELIKKAE @ CS . UCR . EDU

DocID: 1r3Cm - View Document

Non-Deterministic Planning With Conditional Effects Christian Muise and Sheila A. McIlraith and Vaishak Belle Department of Computer Science University of Toronto, Toronto, Canada. {cjmuise,sheila,vaishak}@cs.toronto.edu

Non-Deterministic Planning With Conditional Effects Christian Muise and Sheila A. McIlraith and Vaishak Belle Department of Computer Science University of Toronto, Toronto, Canada. {cjmuise,sheila,vaishak}@cs.toronto.edu

DocID: 1qkW7 - View Document

J. EDUCATIONAL COMPUTING RESEARCH, Vol, 2005  SOLVING PROBLEMS REDUCTIVELY MICHAL ARMONI The Open University of Israel and School of Education, Tel-Aviv University

J. EDUCATIONAL COMPUTING RESEARCH, Vol, 2005 SOLVING PROBLEMS REDUCTIVELY MICHAL ARMONI The Open University of Israel and School of Education, Tel-Aviv University

DocID: 1q9lF - View Document

Improved Non-Deterministic Planning by Exploiting State Relevance

Improved Non-Deterministic Planning by Exploiting State Relevance

DocID: 1piQg - View Document