870 search results - page 4 / 174 » Graph Comparison Using Fine Structure Analysis |
PPOPP
1997
ACM
13 years 10 months ago
1997
ACM
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
IWOMP
2007
Springer
13 years 12 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
SODA
2004
ACM
13 years 7 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
ICCS
2007
Springer
13 years 9 months ago
2007
Springer
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
IEEEPACT
2005
IEEE
13 years 11 months ago
2005
IEEE
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...