Removal of asynchronous events in complex application performance analysis

Removal of asynchronous events in complex application performance analysis

A method and apparatus for identifying a minimum call tree data structure from a plurality of call tree data structures are provided. With the apparatus and method, call tree data structures are generated for two or more executions of a build of a computer program. The apparatus and method perform a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: ALEXANDER, III WILLIAM P, URQUHART ROBERT J, LEVINE FRANK E, DIMPSEY ROBERT T
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator ALEXANDER, III WILLIAM P
URQUHART ROBERT J
LEVINE FRANK E
DIMPSEY ROBERT T
description A method and apparatus for identifying a minimum call tree data structure from a plurality of call tree data structures are provided. With the apparatus and method, call tree data structures are generated for two or more executions of a build of a computer program. The apparatus and method perform a "tree-minimization" operation in which the two or more call trees generated during runs of the computer program are walked and only those nodes that are present in each of the tree data structures are maintained in a minimized tree data structure. In addition, the minimum values for these common nodes are maintained in the minimized tree data structure. In this way, asynchronous events are removed from the minimum tree data structure and analysis may focus on those areas of the computer program that are consistent between runs of the computer program.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US8843898B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US8843898B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US8843898B23</originalsourceid><addsrcrecordid>eNqNyjsOwjAMANAsDKhwB1-ApWUIK6gIMfKZKytyRKTEtuJQ0duzcACmt7y1u96oyIwZJALawuFVheVtQDNxM0gMQYpm-gCq5hSwJWFQqlFqQQ4EyJgXS7Zxq4jZaPuzc3AeH6fLjlQmMsVATG163r3fD_7gj_3wR_kCKvM16A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Removal of asynchronous events in complex application performance analysis</title><source>esp@cenet</source><creator>ALEXANDER, III WILLIAM P ; URQUHART ROBERT J ; LEVINE FRANK E ; DIMPSEY ROBERT T</creator><creatorcontrib>ALEXANDER, III WILLIAM P ; URQUHART ROBERT J ; LEVINE FRANK E ; DIMPSEY ROBERT T</creatorcontrib><description>A method and apparatus for identifying a minimum call tree data structure from a plurality of call tree data structures are provided. With the apparatus and method, call tree data structures are generated for two or more executions of a build of a computer program. The apparatus and method perform a "tree-minimization" operation in which the two or more call trees generated during runs of the computer program are walked and only those nodes that are present in each of the tree data structures are maintained in a minimized tree data structure. In addition, the minimum values for these common nodes are maintained in the minimized tree data structure. In this way, asynchronous events are removed from the minimum tree data structure and analysis may focus on those areas of the computer program that are consistent between runs of the computer program.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2014</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20140923&amp;DB=EPODOC&amp;CC=US&amp;NR=8843898B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76293</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20140923&amp;DB=EPODOC&amp;CC=US&amp;NR=8843898B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ALEXANDER, III WILLIAM P</creatorcontrib><creatorcontrib>URQUHART ROBERT J</creatorcontrib><creatorcontrib>LEVINE FRANK E</creatorcontrib><creatorcontrib>DIMPSEY ROBERT T</creatorcontrib><title>Removal of asynchronous events in complex application performance analysis</title><description>A method and apparatus for identifying a minimum call tree data structure from a plurality of call tree data structures are provided. With the apparatus and method, call tree data structures are generated for two or more executions of a build of a computer program. The apparatus and method perform a "tree-minimization" operation in which the two or more call trees generated during runs of the computer program are walked and only those nodes that are present in each of the tree data structures are maintained in a minimized tree data structure. In addition, the minimum values for these common nodes are maintained in the minimized tree data structure. In this way, asynchronous events are removed from the minimum tree data structure and analysis may focus on those areas of the computer program that are consistent between runs of the computer program.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2014</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyjsOwjAMANAsDKhwB1-ApWUIK6gIMfKZKytyRKTEtuJQ0duzcACmt7y1u96oyIwZJALawuFVheVtQDNxM0gMQYpm-gCq5hSwJWFQqlFqQQ4EyJgXS7Zxq4jZaPuzc3AeH6fLjlQmMsVATG163r3fD_7gj_3wR_kCKvM16A</recordid><startdate>20140923</startdate><enddate>20140923</enddate><creator>ALEXANDER, III WILLIAM P</creator><creator>URQUHART ROBERT J</creator><creator>LEVINE FRANK E</creator><creator>DIMPSEY ROBERT T</creator><scope>EVB</scope></search><sort><creationdate>20140923</creationdate><title>Removal of asynchronous events in complex application performance analysis</title><author>ALEXANDER, III WILLIAM P ; URQUHART ROBERT J ; LEVINE FRANK E ; DIMPSEY ROBERT T</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US8843898B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2014</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>ALEXANDER, III WILLIAM P</creatorcontrib><creatorcontrib>URQUHART ROBERT J</creatorcontrib><creatorcontrib>LEVINE FRANK E</creatorcontrib><creatorcontrib>DIMPSEY ROBERT T</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ALEXANDER, III WILLIAM P</au><au>URQUHART ROBERT J</au><au>LEVINE FRANK E</au><au>DIMPSEY ROBERT T</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Removal of asynchronous events in complex application performance analysis</title><date>2014-09-23</date><risdate>2014</risdate><abstract>A method and apparatus for identifying a minimum call tree data structure from a plurality of call tree data structures are provided. With the apparatus and method, call tree data structures are generated for two or more executions of a build of a computer program. The apparatus and method perform a "tree-minimization" operation in which the two or more call trees generated during runs of the computer program are walked and only those nodes that are present in each of the tree data structures are maintained in a minimized tree data structure. In addition, the minimum values for these common nodes are maintained in the minimized tree data structure. In this way, asynchronous events are removed from the minimum tree data structure and analysis may focus on those areas of the computer program that are consistent between runs of the computer program.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US8843898B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Removal of asynchronous events in complex application performance analysis
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T16%3A17%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=ALEXANDER,%20III%20WILLIAM%20P&rft.date=2014-09-23&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS8843898B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true