A Fast on-Chip Profiler Memory Using a Pipelined Binary Tree

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 12, Issue 1, 2004, Pages 120-122

  Lysecky, Roman ^a   Cotterell, Susan ^a   Vahid, Frank ^a,b  

^a University of California Riverside   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Binary search tree; Design; High performance; Memory; On chip profiler; Pipelined binary search tree; Profiling

Indexed keywords

COMPUTER SOFTWARE; EMBEDDED SYSTEMS; FORMAL LOGIC; PROGRAM COMPILERS; TREES (MATHEMATICS); VIRTUAL REALITY;

BINARY SEARCH TREES; HIGH PERFORMANCE; MEMORY; ON-CHIP PROFILER; PIPELINED BINARY SEARCH TREE; PROFILING;

MICROPROCESSOR CHIPS;

EID: 1342286835     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2003.820522     Document Type: Article

References (5)

1. J. Anderson et al., "Continuous profiling: where have all the cycles gone?," in Proc. 16th ACM Symp. Operating Systems Design, 1997, pp. 1-14.
2. Artisan Components, Inc. (2002) UMC. 18 Technology Library. [Online] . Available: http://www.artisan.com
3. J. Dean et al., ProfileMe: Hardware support for instruction-level profiling on out-of-order processors, MICRO, 1997.
4. S. L. Graham, P. B. Kessler, and M. K. MCKusick, "Gprof: a call graph execution profiler," in Proc. Symp. Compiler Construction, SIGPLAN, 1982, pp. 120-126.
5. R. S. Lysecky, S. Cotterell, and F. Vahid, "A fast on-chip profiler memory," in Proc. Design Automation Conf. (DAC), June 2002, pp. 28-33.