929 search results - page 23 / 186 » On Computation and Communication with Small Bias |
IPPS
1997
IEEE
1997
IEEE
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
14 years 6 days ago
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— By posing the problem of bandwidth allocation as a constrained maximization problem, it is possible to study various features of optimal bandwidth allocation, and hence the cap...
JPDC
2006
13 years 8 months ago
2006
We introduce Virtual Leashing,1 a new technique for software protection and control. The leashing process removes small fragments of code, pervasive throughout the application, an...
CONCURRENCY
1998
13 years 8 months ago
1998
We present a new fast and scalable matrix multiplication algorithm, called DIMMA Distribution-Independent Matrix Multiplication Algorithm , for block cyclic data distribution on ...
ACIVS
2008
Springer
14 years 3 months ago
2008
Springer
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...