IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
This paper describes the design and implementation on MIMD parallel machines of P-AutoClass, a parallel version of the AutoClass system based upon the Bayesian method for determini...
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
For bulk synchronous computations that have nondeterministic behaviors, dynamic remapping is an effective approach to ensure parallel efficiency. There are two basic issues in re...
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
The development of communications services for distributed applications that are both well-structured (layered) and efficient can be difficult. This paper presents a C++ framework...
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
