268 search results - page 18 / 54 » Analyzing Parallel Programs with Pin |
CLUSTER
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Large-scale parallel applications often produce immense quantities of data that need to be analyzed. To avoid performing repeated, costly disk accesses, analysis of larg...
STACS
1999
Springer
15 years 1 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
CLUSTER
2007
IEEE
15 years 1 months ago
2007
IEEE
Bulk memory copies incur large overheads such as CPU stalling (i.e., no overlap of computation with memory copy operation), small register-size data movement, cache pollution, etc...
ISCOPE
1999
Springer
15 years 1 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
LCPC
2000
Springer
15 years 1 months ago
2000
Springer
This paper proposes a simple and efficient implementation method for a hierarchical coarse grain task parallel processing scheme on a SMP machine. OSCAR multigrain parallelizing c...