Compile Time Execution

When compiling high level, graphical code (e.g. LabVIEW(TM) code) representative of a design, parts of the code that do not depend on external input data may be executed during the compilation process. Specific variables and/or value traces of specific variables in the program, e.g. constant values...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: KEE HOJIN, LY TAI A, PETERSEN NEWTON G, WASHINGTON JEFFREY D, YI HAORAN, BLASIG DUSTYN K
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 KEE HOJIN
LY TAI A
PETERSEN NEWTON G
WASHINGTON JEFFREY D
YI HAORAN
BLASIG DUSTYN K
description When compiling high level, graphical code (e.g. LabVIEW(TM) code) representative of a design, parts of the code that do not depend on external input data may be executed during the compilation process. Specific variables and/or value traces of specific variables in the program, e.g. constant values and/or repeating patterns may be recorded then analyzed, and certain transformations may be applied in the compilation process according to the results of the analysis, thereby optimizing the design. In one approach, the graph may be dynamically stepped through one node at a time, and it may be determined whether all inputs to the stepped-through node are known. If those inputs are known, type conversion and the operation corresponding to the stepped-through node may be dynamically performed. In another approach, a subset of the graphical code not depending on external data may be compiled and executed, thereby obtaining the same results as described above.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2014059524A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2014059524A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2014059524A13</originalsourceid><addsrcrecordid>eNrjZBBzzs8tyMxJVQjJzE1VcK1ITS4tyczP42FgTUvMKU7lhdLcDMpuriHOHrqpBfnxqcUFicmpeakl8aHBRgaGJgamlqZGJo6GxsSpAgAO1SI9</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Compile Time Execution</title><source>esp@cenet</source><creator>KEE HOJIN ; LY TAI A ; PETERSEN NEWTON G ; WASHINGTON JEFFREY D ; YI HAORAN ; BLASIG DUSTYN K</creator><creatorcontrib>KEE HOJIN ; LY TAI A ; PETERSEN NEWTON G ; WASHINGTON JEFFREY D ; YI HAORAN ; BLASIG DUSTYN K</creatorcontrib><description>When compiling high level, graphical code (e.g. LabVIEW(TM) code) representative of a design, parts of the code that do not depend on external input data may be executed during the compilation process. Specific variables and/or value traces of specific variables in the program, e.g. constant values and/or repeating patterns may be recorded then analyzed, and certain transformations may be applied in the compilation process according to the results of the analysis, thereby optimizing the design. In one approach, the graph may be dynamically stepped through one node at a time, and it may be determined whether all inputs to the stepped-through node are known. If those inputs are known, type conversion and the operation corresponding to the stepped-through node may be dynamically performed. In another approach, a subset of the graphical code not depending on external data may be compiled and executed, thereby obtaining the same results as described above.</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=20140227&amp;DB=EPODOC&amp;CC=US&amp;NR=2014059524A1$$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=20140227&amp;DB=EPODOC&amp;CC=US&amp;NR=2014059524A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>KEE HOJIN</creatorcontrib><creatorcontrib>LY TAI A</creatorcontrib><creatorcontrib>PETERSEN NEWTON G</creatorcontrib><creatorcontrib>WASHINGTON JEFFREY D</creatorcontrib><creatorcontrib>YI HAORAN</creatorcontrib><creatorcontrib>BLASIG DUSTYN K</creatorcontrib><title>Compile Time Execution</title><description>When compiling high level, graphical code (e.g. LabVIEW(TM) code) representative of a design, parts of the code that do not depend on external input data may be executed during the compilation process. Specific variables and/or value traces of specific variables in the program, e.g. constant values and/or repeating patterns may be recorded then analyzed, and certain transformations may be applied in the compilation process according to the results of the analysis, thereby optimizing the design. In one approach, the graph may be dynamically stepped through one node at a time, and it may be determined whether all inputs to the stepped-through node are known. If those inputs are known, type conversion and the operation corresponding to the stepped-through node may be dynamically performed. In another approach, a subset of the graphical code not depending on external data may be compiled and executed, thereby obtaining the same results as described above.</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>eNrjZBBzzs8tyMxJVQjJzE1VcK1ITS4tyczP42FgTUvMKU7lhdLcDMpuriHOHrqpBfnxqcUFicmpeakl8aHBRgaGJgamlqZGJo6GxsSpAgAO1SI9</recordid><startdate>20140227</startdate><enddate>20140227</enddate><creator>KEE HOJIN</creator><creator>LY TAI A</creator><creator>PETERSEN NEWTON G</creator><creator>WASHINGTON JEFFREY D</creator><creator>YI HAORAN</creator><creator>BLASIG DUSTYN K</creator><scope>EVB</scope></search><sort><creationdate>20140227</creationdate><title>Compile Time Execution</title><author>KEE HOJIN ; LY TAI A ; PETERSEN NEWTON G ; WASHINGTON JEFFREY D ; YI HAORAN ; BLASIG DUSTYN K</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2014059524A13</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>KEE HOJIN</creatorcontrib><creatorcontrib>LY TAI A</creatorcontrib><creatorcontrib>PETERSEN NEWTON G</creatorcontrib><creatorcontrib>WASHINGTON JEFFREY D</creatorcontrib><creatorcontrib>YI HAORAN</creatorcontrib><creatorcontrib>BLASIG DUSTYN K</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>KEE HOJIN</au><au>LY TAI A</au><au>PETERSEN NEWTON G</au><au>WASHINGTON JEFFREY D</au><au>YI HAORAN</au><au>BLASIG DUSTYN K</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Compile Time Execution</title><date>2014-02-27</date><risdate>2014</risdate><abstract>When compiling high level, graphical code (e.g. LabVIEW(TM) code) representative of a design, parts of the code that do not depend on external input data may be executed during the compilation process. Specific variables and/or value traces of specific variables in the program, e.g. constant values and/or repeating patterns may be recorded then analyzed, and certain transformations may be applied in the compilation process according to the results of the analysis, thereby optimizing the design. In one approach, the graph may be dynamically stepped through one node at a time, and it may be determined whether all inputs to the stepped-through node are known. If those inputs are known, type conversion and the operation corresponding to the stepped-through node may be dynamically performed. In another approach, a subset of the graphical code not depending on external data may be compiled and executed, thereby obtaining the same results as described above.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2014059524A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Compile Time Execution
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T12%3A58%3A43IST&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=KEE%20HOJIN&rft.date=2014-02-27&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2014059524A1%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