575 search results - page 27 / 115 » Computing Maximum Subsequence in Parallel |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Parallel processing using multiple processors is a well-established technique to accelerate many different classes of applications. However, as the density of chips increases, ano...
LCPC
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. The technique of flattening nested data parallelism combines all the independent operations in nested apply-to-all constructs and generates large amounts of potential pa...
ICPP
1997
IEEE
13 years 11 months ago
1997
IEEE
Communication characterization of parallel applications is essential to understand the interplay between architectures and applications in determining the maximum achievable perfo...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...