메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 165-172

Construction and compression of complete call graphs for post-mortem program trace analysis

Author keywords

Data Compression; Data Structures; Performance Analysis; Tracing

Indexed keywords

DATA COMPRESSION; DATA REDUCTION; FIELD PROGRAMMABLE GATE ARRAYS; PARALLEL PROCESSING SYSTEMS;

EID: 33745136466     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2005.28     Document Type: Conference Paper
Times cited : (33)

References (17)
  • 1
    • 33745123189 scopus 로고    scopus 로고
    • IRS Benchmark Code, http://www.llnl.gov/asci/platforms/purple/rfp/benchmarks/limited/irs/.
  • 2
    • 0024983174 scopus 로고
    • Blocking: Exploiting spatial locality for trace compaction
    • A. Agarwal and M. Huffman. Blocking: Exploiting spatial locality for trace compaction. In Proc. ACM SIGMETRICS 1990, pages 48-57, 1990.
    • (1990) Proc. ACM SIGMETRICS 1990 , pp. 48-57
    • Agarwal, A.1    Huffman, M.2
  • 4
    • 33745117489 scopus 로고    scopus 로고
    • New algorithms for performance trace analysis based on compressed complete call graphs
    • Atlanta/Georgia/USA, May
    • A.Knüpfer and W.E.Nagel. New Algorithms for Performance Trace Analysis based on Compressed Complete Call Graphs. In Proceedings of ICCS 2005, Atlanta/Georgia/USA, May 2005.
    • (2005) Proceedings of ICCS 2005
    • Knüpfer, A.1    Nagel, W.E.2
  • 5
    • 84957869022 scopus 로고    scopus 로고
    • Performance otimization for large scale computing: The scalable VAMPIR approach
    • LNCS 2074, Springer, May
    • H. Brunst, H.-Ch. Hoppe, W.E. Nagel, and M. Winkler. Performance Otimization for Large Scale Computing: The Scalable VAMPIR Approach. In Proceedings of ICCS2001, San Francisco, USA, LNCS 2074, page 751. Springer, May 2001.
    • (2001) Proceedings of ICCS2001, San Francisco, USA , pp. 751
    • Brunst, H.1    Hoppe, H.-Ch.2    Nagel, W.E.3    Winkler, M.4
  • 10
    • 35248887492 scopus 로고    scopus 로고
    • A new data compression technique for event based program traces
    • Springer, Heidelberg, June
    • Andreas Knüpfer. A New Data Compression Technique for Event Based Program Traces. In Proceedings of ICCS 2003 in Melbourne/Australia, Springer LNCS 2659, pages 956-965. Springer, Heidelberg, June 2003.
    • (2003) Proceedings of ICCS 2003 in Melbourne/Australia, Springer LNCS , vol.2659 , pp. 956-965
    • Knüpfer, A.1
  • 11
    • 25144516956 scopus 로고    scopus 로고
    • Compressible memory data structures for event based trace analysis
    • [accepted for publication]
    • Andreas Knüpfer and Wolfgang E. Nagel. Compressible Memory Data Structures for Event Based Trace Analysis. Future Generation Computer Systems by Elsevier, 2005. [accepted for publication].
    • (2005) Future Generation Computer Systems by Elsevier
    • Knüpfer, A.1    Nagel, W.E.2
  • 17
    • 12244287332 scopus 로고    scopus 로고
    • EARL - A programmable and extensible toolkit for analyzing event traces of message passing programs
    • Forschungszentrum Jülich GmbH, April. FZJ-ZAM-IB-9803
    • F. Wolf and B. Mohr. EARL - A Programmable and Extensible Toolkit for Analyzing Event Traces of Message Passing Programs. Technical report, Forschungszentrum Jülich GmbH, April 1998. FZJ-ZAM-IB-9803.
    • (1998) Technical Report
    • Wolf, F.1    Mohr, B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.