Sciweavers

488 search results - page 78 / 98
» Using shared arrays in message-driven parallel programs
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
ESCIENCE
2006
IEEE
14 years 2 months ago
Building Simple, Easy-to-Use Grids with Styx Grid Services and SSH
Grid systems have a reputation for being difficult to build and use. We describe how the ease of use of the Styx Grid Services (SGS) software can be combined with the security and...
J. D. Blower, K. Haines
ICPP
2005
IEEE
14 years 2 months ago
Optimizing Collective Communications on SMP Clusters
We describe a generic programming model to design collective communications on SMP clusters. The programming model utilizes shared memory for collective communications and overlap...
Meng-Shiou Wu, Ricky A. Kendall, Kyle Wright
OOPSLA
2005
Springer
14 years 2 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
ECOOP
2003
Springer
14 years 1 months ago
A Nominal Theory of Objects with Dependent Types
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
Martin Odersky, Vincent Cremet, Christine Röc...