118 search results - page 11 / 24 » Communication and Memory Optimal Parallel Data Cube Construc... |
ICPP
1993
IEEE
13 years 10 months ago
1993
IEEE
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
INFOCOM
1995
IEEE
13 years 10 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
IPPS
1997
IEEE
13 years 10 months ago
1997
IEEE
Software distributed shared memory (DSM) techniques, while effective on applications with coarse-grained sharing, yield poor performance for the fine-grained sharing encountered i...
IPPS
2005
IEEE
14 years 9 days ago
2005
IEEE
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
CCGRID
2008
IEEE
14 years 1 months ago
2008
IEEE
Distributed applications tend to have a complex design due to issues such as concurrency, synchronization and communication. Researchers in the past have proposed abstractions to ...