Sciweavers

1263 search results - page 147 / 253
» An Object-Passing Model for Parallel Programming
Sort
View
148
Voted
IPPS
2005
IEEE
15 years 9 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
131
Voted
ISNN
2005
Springer
15 years 9 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
IPPS
1999
IEEE
15 years 8 months ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
144
Voted
TOMS
1998
148views more  TOMS 1998»
15 years 3 months ago
PELLPACK: A Problem-Solving Environment for PDE-Based Applications on Multicomputer Platforms
This paper presents the software architecture and implementation of the problem solving environment (PSE) PELLPACK for modeling physical objects described by partial differential ...
Elias N. Houstis, John R. Rice, Sanjiva Weerawaran...
109
Voted
CONCUR
1993
Springer
15 years 7 months ago
Modular Completeness for Communication Closed Layers
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
Maarten M. Fokkinga, Mannes Poel, Job Zwiers