Sciweavers

7716 search results - page 30 / 1544
» Can I pass
Sort
View
PPOPP
1993
ACM
13 years 11 months ago
Integrating Message-Passing and Shared-Memory: Early Experience
This paper discusses some of the issues involved in implementing a shared-address space programming model on large-scale, distributed-memory multiprocessors. While such a programm...
David A. Kranz, Kirk L. Johnson, Anant Agarwal, Jo...
PODC
1990
ACM
13 years 11 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
ENTCS
2006
111views more  ENTCS 2006»
13 years 7 months ago
Token-Passing Nets: Call-by-Need for Free
Recently, encodings in interaction nets of the call-by-name and call-by-value strategies of the -calculus have been proposed. The purpose of these encodings was to he gap between ...
François-Régis Sinot
JAVA
2000
Springer
13 years 11 months ago
Development routes for message passing parallelism in Java
Java is an attractive environment for writing portable message passing parallel programs. Considerable work in message passing interface bindings for the C and Fortran languages h...
J. A. Mathew, Heath A. James, Kenneth A. Hawick
PICS
2003
13 years 8 months ago
Error-Diffusion Robust to Mis-Registration in Multi-Pass Printing
Error-diffusion and its variants are commonly used halftoning techniques that produce dispersed dot (FM) halftones, which are often preferred because they are free from low-freque...
Zhigang Fan, Gaurav Sharma, Shen-ge Wang