Execution flow shape compression for aggregate data reporting in an application manager

Data relating to execution flows at a computer system is compressed and aggregated across multiple execution flows by categorizing each execution flow into an execution flow shape. The execution flows may represent sequences of software components that are invoked. The execution flow shapes are deve...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: PURYEAR DARYL L, COBB JEFFREY R, VANRENEN GABRIEL J
Format: Patent
Sprache:eng
Schlagworte:
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 PURYEAR DARYL L
COBB JEFFREY R
VANRENEN GABRIEL J
description Data relating to execution flows at a computer system is compressed and aggregated across multiple execution flows by categorizing each execution flow into an execution flow shape. The execution flows may represent sequences of software components that are invoked. The execution flow shapes are developed by observing the execution flows at the computer system and applying lossy compression rules, such as representing multiple iterations of a loop as a single iteration, skipping certain types of software components, such as those having a specified call stack depth, treating some of the software components as being optional, and ignoring recursive calls by the software components. The aggregation and compression allow the information from all execution flows to be combined into a small enough data set that can be reported without consuming unduly large processing overhead while still preserving as many of the interesting aspects of the execution flows as possible.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2007169052A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2007169052A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2007169052A13</originalsourceid><addsrcrecordid>eNqNjMEKwjAQRHPxIOo_LHgW0oqKR5GKdxWPZYnbGEiTZTein28pfoAwMPCYN1Nzbz7kXiXkBF3Mb9AnMoHLPQupjjgLoPdCHgvBAwuCEGcpIXkICXAIcwwOx5ceE3qSuZl0GJUWv56Z5am5Hs-rQW1JGR0lKu3tUlu7q7Z7u6kP1fq_1Rd8bzs4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Execution flow shape compression for aggregate data reporting in an application manager</title><source>esp@cenet</source><creator>PURYEAR DARYL L ; COBB JEFFREY R ; VANRENEN GABRIEL J</creator><creatorcontrib>PURYEAR DARYL L ; COBB JEFFREY R ; VANRENEN GABRIEL J</creatorcontrib><description>Data relating to execution flows at a computer system is compressed and aggregated across multiple execution flows by categorizing each execution flow into an execution flow shape. The execution flows may represent sequences of software components that are invoked. The execution flow shapes are developed by observing the execution flows at the computer system and applying lossy compression rules, such as representing multiple iterations of a loop as a single iteration, skipping certain types of software components, such as those having a specified call stack depth, treating some of the software components as being optional, and ignoring recursive calls by the software components. The aggregation and compression allow the information from all execution flows to be combined into a small enough data set that can be reported without consuming unduly large processing overhead while still preserving as many of the interesting aspects of the execution flows as possible.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2007</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=20070719&amp;DB=EPODOC&amp;CC=US&amp;NR=2007169052A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20070719&amp;DB=EPODOC&amp;CC=US&amp;NR=2007169052A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>PURYEAR DARYL L</creatorcontrib><creatorcontrib>COBB JEFFREY R</creatorcontrib><creatorcontrib>VANRENEN GABRIEL J</creatorcontrib><title>Execution flow shape compression for aggregate data reporting in an application manager</title><description>Data relating to execution flows at a computer system is compressed and aggregated across multiple execution flows by categorizing each execution flow into an execution flow shape. The execution flows may represent sequences of software components that are invoked. The execution flow shapes are developed by observing the execution flows at the computer system and applying lossy compression rules, such as representing multiple iterations of a loop as a single iteration, skipping certain types of software components, such as those having a specified call stack depth, treating some of the software components as being optional, and ignoring recursive calls by the software components. The aggregation and compression allow the information from all execution flows to be combined into a small enough data set that can be reported without consuming unduly large processing overhead while still preserving as many of the interesting aspects of the execution flows as possible.</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>2007</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjMEKwjAQRHPxIOo_LHgW0oqKR5GKdxWPZYnbGEiTZTein28pfoAwMPCYN1Nzbz7kXiXkBF3Mb9AnMoHLPQupjjgLoPdCHgvBAwuCEGcpIXkICXAIcwwOx5ceE3qSuZl0GJUWv56Z5am5Hs-rQW1JGR0lKu3tUlu7q7Z7u6kP1fq_1Rd8bzs4</recordid><startdate>20070719</startdate><enddate>20070719</enddate><creator>PURYEAR DARYL L</creator><creator>COBB JEFFREY R</creator><creator>VANRENEN GABRIEL J</creator><scope>EVB</scope></search><sort><creationdate>20070719</creationdate><title>Execution flow shape compression for aggregate data reporting in an application manager</title><author>PURYEAR DARYL L ; COBB JEFFREY R ; VANRENEN GABRIEL J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2007169052A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2007</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>PURYEAR DARYL L</creatorcontrib><creatorcontrib>COBB JEFFREY R</creatorcontrib><creatorcontrib>VANRENEN GABRIEL J</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>PURYEAR DARYL L</au><au>COBB JEFFREY R</au><au>VANRENEN GABRIEL J</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Execution flow shape compression for aggregate data reporting in an application manager</title><date>2007-07-19</date><risdate>2007</risdate><abstract>Data relating to execution flows at a computer system is compressed and aggregated across multiple execution flows by categorizing each execution flow into an execution flow shape. The execution flows may represent sequences of software components that are invoked. The execution flow shapes are developed by observing the execution flows at the computer system and applying lossy compression rules, such as representing multiple iterations of a loop as a single iteration, skipping certain types of software components, such as those having a specified call stack depth, treating some of the software components as being optional, and ignoring recursive calls by the software components. The aggregation and compression allow the information from all execution flows to be combined into a small enough data set that can be reported without consuming unduly large processing overhead while still preserving as many of the interesting aspects of the execution flows as possible.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2007169052A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Execution flow shape compression for aggregate data reporting in an application manager
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T10%3A39%3A35IST&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=PURYEAR%20DARYL%20L&rft.date=2007-07-19&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2007169052A1%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