148 search results - page 6 / 30 » On data structures and asymmetric communication complexity |
PPOPP
1997
ACM
13 years 11 months ago
1997
ACM
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
CF
2004
ACM
14 years 27 days ago
2004
ACM
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
JAVA
2001
Springer
13 years 12 months ago
2001
Springer
CCJ is a communication library that adds MPI-like collective operations to Java. Rather than trying to adhere to the precise MPI syntax, CCJ aims at a clean integration of collect...
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...