CRITICAL RENDERING PATH OPTIMIZATION

The present disclosure involves systems, software, and computer implemented methods for optimizing a critical resource path for a web application. One example process includes operations for identifying a visual completeness criteria for the web application. The web application includes a plurality...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Himmelreich Evgeny, Kravchik Alex
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 Himmelreich Evgeny
Kravchik Alex
description The present disclosure involves systems, software, and computer implemented methods for optimizing a critical resource path for a web application. One example process includes operations for identifying a visual completeness criteria for the web application. The web application includes a plurality of N resources. The web application is initialized for execution and the network roundtrips of each resource are monitored until the visual completeness criteria is satisfied and a first total elapsed time is determined. A total of N further initializations of the web application are performed, wherein each further initialization is performed while delaying loading of a different one of the N resources during a particular iteration. A particular resource is determined as not relevant to the CRP when the total time elapsed to the visual completeness criteria in the further initialization where the particular resource is delayed is below a threshold amount above the first total elapsed time.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2016344649A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2016344649A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2016344649A13</originalsourceid><addsrcrecordid>eNrjZFBxDvIM8XR29FEIcvVzcQ3y9HNXCHAM8VDwDwjx9PWMcgzx9PfjYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBoZmxiYmZiaWjobGxKkCABuNJCo</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>CRITICAL RENDERING PATH OPTIMIZATION</title><source>esp@cenet</source><creator>Himmelreich Evgeny ; Kravchik Alex</creator><creatorcontrib>Himmelreich Evgeny ; Kravchik Alex</creatorcontrib><description>The present disclosure involves systems, software, and computer implemented methods for optimizing a critical resource path for a web application. One example process includes operations for identifying a visual completeness criteria for the web application. The web application includes a plurality of N resources. The web application is initialized for execution and the network roundtrips of each resource are monitored until the visual completeness criteria is satisfied and a first total elapsed time is determined. A total of N further initializations of the web application are performed, wherein each further initialization is performed while delaying loading of a different one of the N resources during a particular iteration. A particular resource is determined as not relevant to the CRP when the total time elapsed to the visual completeness criteria in the further initialization where the particular resource is delayed is below a threshold amount above the first total elapsed time.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2016</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=20161124&amp;DB=EPODOC&amp;CC=US&amp;NR=2016344649A1$$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=20161124&amp;DB=EPODOC&amp;CC=US&amp;NR=2016344649A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Himmelreich Evgeny</creatorcontrib><creatorcontrib>Kravchik Alex</creatorcontrib><title>CRITICAL RENDERING PATH OPTIMIZATION</title><description>The present disclosure involves systems, software, and computer implemented methods for optimizing a critical resource path for a web application. One example process includes operations for identifying a visual completeness criteria for the web application. The web application includes a plurality of N resources. The web application is initialized for execution and the network roundtrips of each resource are monitored until the visual completeness criteria is satisfied and a first total elapsed time is determined. A total of N further initializations of the web application are performed, wherein each further initialization is performed while delaying loading of a different one of the N resources during a particular iteration. A particular resource is determined as not relevant to the CRP when the total time elapsed to the visual completeness criteria in the further initialization where the particular resource is delayed is below a threshold amount above the first total elapsed time.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZFBxDvIM8XR29FEIcvVzcQ3y9HNXCHAM8VDwDwjx9PWMcgzx9PfjYWBNS8wpTuWF0twMym6uIc4euqkF-fGpxQWJyal5qSXxocFGBoZmxiYmZiaWjobGxKkCABuNJCo</recordid><startdate>20161124</startdate><enddate>20161124</enddate><creator>Himmelreich Evgeny</creator><creator>Kravchik Alex</creator><scope>EVB</scope></search><sort><creationdate>20161124</creationdate><title>CRITICAL RENDERING PATH OPTIMIZATION</title><author>Himmelreich Evgeny ; Kravchik Alex</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2016344649A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2016</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>Himmelreich Evgeny</creatorcontrib><creatorcontrib>Kravchik Alex</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Himmelreich Evgeny</au><au>Kravchik Alex</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>CRITICAL RENDERING PATH OPTIMIZATION</title><date>2016-11-24</date><risdate>2016</risdate><abstract>The present disclosure involves systems, software, and computer implemented methods for optimizing a critical resource path for a web application. One example process includes operations for identifying a visual completeness criteria for the web application. The web application includes a plurality of N resources. The web application is initialized for execution and the network roundtrips of each resource are monitored until the visual completeness criteria is satisfied and a first total elapsed time is determined. A total of N further initializations of the web application are performed, wherein each further initialization is performed while delaying loading of a different one of the N resources during a particular iteration. A particular resource is determined as not relevant to the CRP when the total time elapsed to the visual completeness criteria in the further initialization where the particular resource is delayed is below a threshold amount above the first total elapsed time.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2016344649A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title CRITICAL RENDERING PATH OPTIMIZATION
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T15%3A54%3A29IST&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=Himmelreich%20Evgeny&rft.date=2016-11-24&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2016344649A1%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