10805 search results - page 198 / 2161 » Mapping Computation with No Memory |
161
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
153
click to vote
PVM
1998
Springer
15 years 10 months ago
1998
Springer
This paper describes an e cient implementation of MPI on the Memory-Based Communication Facilities; Memory-Based FIFO is used for bu ering by the library, and Remote Write for comm...
184
click to vote
HPCN
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We describe a programming interface for parallel computing on NUMA (NonUniform Memory Access) shared memory machines. Although the interest in this architecture is rapidl...
174
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
138
click to vote
HPCC
2007
Springer
16 years 21 days ago
2007
Springer
This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iter...