ACM Home Page
Please provide us with feedback. Feedback
Visualizing potential parallelism in sequential programs
Full text PdfPdf (601 KB)
Source
PACT archive
Proceedings of the 17th international conference on Parallel architectures and compilation techniques table of contents
Toronto, Ontario, Canada
SESSION: Analyzing applications table of contents
Pages 82-90  
Year of Publication: 2008
ISBN:978-1-60558-282-5
Authors
Graham D. Price  University of Colorado, Boulder, CO, USA
John Giacomoni  University of Colorado, Boulder, CO, USA
Manish Vachharajani  University of Colorado, Boulder, CO, USA
Sponsors
ACM: Association for Computing Machinery
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 169,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1454115.1454129
What is a DOI?

ABSTRACT

This paper presents ParaMeter, an interactive program analysis and visualization system for large traces. Using ParaMeter, a software developer can locate and analyze regions of code that may yield to parallelization efforts and to possibly extract performance from multicore hardware. The key contributions in the paper are (1) a method to use interactive visualization of traces to find and exploit parallelism, (2) interactive-speed visualization of large-scale trace dependencies, (3) interactive-speed visualization of code interactions, and (4) a BDD variable ordering for DD-compressed traces that results in fast visualization, fast analysis, and good compression. ParaMeter's effectiveness is demonstrated by finding and exploiting parallelism in 175.vpr. Measurements of ParaMeter's visualization algorithms show that they are up to seventy-five thousand times faster than prior approaches.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
 
5
6
7
 
8
IYER, M., ASHOK, C., STONE, J., VACHHARAJANI, N., CONNORS, D. A., AND VACHHARAJANI, M. Finding parallelism for future EPIC machines. In Proceedings of the 4th Workshop on Explicitly Parallel Instruction Computing Techniques (EPIC) (March 2005).
 
9
JEONG, S.-W., PLESSIER, B., HACHTEL, G., AND SOMENZI, F. Variable ordering for binary decision diagrams. In Proceedings of the 3rd European Design Automation Conference (1992), pp. 447--451.
10
11
 
12
 
13
POSTIFF, M., TYSON, G., AND MUDGE, T. Performance limits of trace caches. Tech. Rep. CSE-TR-373-98, University of Maryland, Department of Electrical Engineering and Computer Science, CSE, September 1998.
 
14
 
15
 
16
 
17
SOMENZI, F. CUDD: Colorado University Decision Diagram package, release 2.30. Tech. rep., University of Colorado at Boulder, http://vlsi.colorado.edu/~fabio/CUDD/, 1998.
 
18
VACHHARAJANI, N., IYER, M., ASHOK, C., VACHHARAJANI, M., AUGUST, D. I., AND CONNORS, D. A. Chip multi-processor scalability for single-threaded applications. In Proceedings of the 2005 Workshop on Design, Architecture and Simulation of Chip Multi-Processors (dasCMP) (November 2005).
 
19
WALL, D. W. Limits of instruction-level parallelism. Tech. Rep. 93/6, DEC WRL, November 1993.
20
 
21
 
22
 
23


Collaborative Colleagues:
Graham D. Price: colleagues
John Giacomoni: colleagues
Manish Vachharajani: colleagues