1794 search results - page 302 / 359 » Visualizing Memory Graphs |
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
The advent of new parallel architectures has increased the need for parallel optimizing compilers to assist developers in creating efficient code. OpenUH is a state-of-the-art opt...
OSDI
2004
ACM
15 years 10 months ago
2004
ACM
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
167
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
ICSE
2004
IEEE-ACM
15 years 9 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...