Sciweavers

1099 search results - page 179 / 220
» A Parallel Programming Style and Its Algebra of Programs
Sort
View
125
Voted
IFIP
2004
Springer
15 years 8 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
122
Voted
SAC
1998
ACM
15 years 6 months ago
Open, distributed coordination with finesse
Coordination languages have recently been attracting signi cant attention as a means of programming parallel and distributed systems. The approach of separating coordination from ...
Andrew Berry, Simon M. Kaplan
133
Voted
VLDB
1998
ACM
95views Database» more  VLDB 1998»
15 years 6 months ago
The National Medical Knowledge Bank
This paper describes a massively parallel object relational (O/R) database used in an advanced development program to create a comprehensive medical information system called the ...
Warren Sterling
81
Voted
FOCS
1990
IEEE
15 years 6 months ago
Uniform Memory Hierarchies
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...
Bowen Alpern, Larry Carter, Ephraim Feig
86
Voted
CIE
2008
Springer
15 years 4 months ago
A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC
The first extensive number-theoretical computation run on the world's first U.S. digital general-purpose electronic computer, the ENIAC, is reconstructed. The problem, computi...
Liesbeth De Mol, Maarten Bullynck