6 search results - page 1 / 2 » Optimal Tree Access by Elementary and Composite Templates in... |
TPDS
2002
13 years 4 months ago
2002
IPPS
1998
IEEE
13 years 8 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...
PC
2002
13 years 4 months ago
2002
The I/O access patterns of many parallel applications consist of accesses to a large number of small, noncontiguous pieces of data. If an application's I/O needs are met by m...
IPPS
1995
IEEE
13 years 7 months ago
1995
IEEE
This paper describes improvements to the Mach microkernel’s support for efficient application startup across multiple nodes in a cluster or massively parallel processor. Signifi...
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...