93 search results - page 4 / 19 » Compiler analysis of irregular memory accesses |
ICPP
1999
IEEE
15 years 2 months ago
1999
IEEE
Most of today's multiprocessors have a DistributedShared Memory (DSM) organization, which enables scalability while retaining the convenience of the shared-memory programming...
PPOPP
1999
ACM
15 years 2 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
ASPLOS
1996
ACM
15 years 2 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
TOPLAS
2002
14 years 9 months ago
2002
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...