Sciweavers

3660 search results - page 275 / 732
» Parallel Program Archetypes
Sort
View
ISCOPE
1999
Springer
15 years 11 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
SIGSOFT
2009
ACM
16 years 7 months ago
Refactoring for reentrancy
A program is reentrant if distinct executions of that program on distinct inputs cannot affect each other. Reentrant programs have the desirable property that they can be deployed...
Jan Wloka, Manu Sridharan, Frank Tip
HPCN
1998
Springer
15 years 11 months ago
Evaluation of Two Compiler-Based Approaches for the Parallelisation of an MPEG-2 Decoder
In this paper, we evaluate two different approaches for the compiler-based parallelisation of a C program for MPEG-2 decoding. The first approach experiments with a commercial auto...
Arnaud Laffitte, Rizos Sakellariou, John R. Gurd
CLUSTER
2001
IEEE
15 years 10 months ago
A Class of Loop Self-Scheduling for Heterogeneous Clusters
Distributed Computing Systems are a viable and less expensive alternative to parallel computers. However, a serious difficulty in concurrent programming of a distributed system is...
Anthony T. Chronopoulos, Manuel Benche, Daniel Gro...
ICPP
1994
IEEE
15 years 10 months ago
Cachier: A Tool for Automatically Inserting CICO Annotations
Shared memory in a parallel computer provides prowith the valuable abstraction of a shared address space--through which any part of a computation can access any datum. Although un...
Trishul M. Chilimbi, James R. Larus