SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR IMPROVING PLACEMENT PERFORMANCE OF MESSAGE TRANSFORMS BY EXPLOITING GUIDED REPLICATION

Systems, methods and computer program products for optimizing an objective function (e.g. the overall end-to-end runtime latency) of a flow graph of message transformations which are placed onto an overlay network of broker machines by replicating stateless transformations in a guided manner. Exempl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: STROM ROBERT EVAN, LI YING
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 STROM ROBERT EVAN
LI YING
description Systems, methods and computer program products for optimizing an objective function (e.g. the overall end-to-end runtime latency) of a flow graph of message transformations which are placed onto an overlay network of broker machines by replicating stateless transformations in a guided manner. Exemplary embodiments include a guided replication method, including given an initial transformation graph and a network topology, running a placement algorithm to obtain top N best task-to-broker assignments, identifying the R-task which forms the performance bottleneck, checking if the objective function improvement drops below a designated threshold, if yes, then selecting the optimal task-to-broker assignment and the program terminates; otherwise, replicating the R-task, optimally distributing the data load among R-task's replicas, deriving a set of starting points from the above obtained top N task-to-broker assignments, and re-executing the placement algorithm with these starting points in an iterative fashion.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2009235251A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2009235251A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2009235251A13</originalsourceid><addsrcrecordid>eNqNjEsKwkAQRLNxIeodGtwq5EMWLseZTjKQ-TDdEV1JkHElGoiX8NYm4AFcPYpXVcvkQxdiNLQDg9w4RSCsAumM7xgD-ODqIMxM1UkmqFwAbaZ40rYG3wqJBi2DxzApI6xEcNV0RiRqBA7C0iwIjhfAs2-d5nlZd1qhgoC-1VKwdnadLO79Y4ybH1fJtkKWzT4Or2sch_4Wn_F97ShP00NelHmZiaz4r_UFBM1ARA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR IMPROVING PLACEMENT PERFORMANCE OF MESSAGE TRANSFORMS BY EXPLOITING GUIDED REPLICATION</title><source>esp@cenet</source><creator>STROM ROBERT EVAN ; LI YING</creator><creatorcontrib>STROM ROBERT EVAN ; LI YING</creatorcontrib><description>Systems, methods and computer program products for optimizing an objective function (e.g. the overall end-to-end runtime latency) of a flow graph of message transformations which are placed onto an overlay network of broker machines by replicating stateless transformations in a guided manner. Exemplary embodiments include a guided replication method, including given an initial transformation graph and a network topology, running a placement algorithm to obtain top N best task-to-broker assignments, identifying the R-task which forms the performance bottleneck, checking if the objective function improvement drops below a designated threshold, if yes, then selecting the optimal task-to-broker assignment and the program terminates; otherwise, replicating the R-task, optimally distributing the data load among R-task's replicas, deriving a set of starting points from the above obtained top N task-to-broker assignments, and re-executing the placement algorithm with these starting points in an iterative fashion.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2009</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=20090917&amp;DB=EPODOC&amp;CC=US&amp;NR=2009235251A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,777,882,25545,76296</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20090917&amp;DB=EPODOC&amp;CC=US&amp;NR=2009235251A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>STROM ROBERT EVAN</creatorcontrib><creatorcontrib>LI YING</creatorcontrib><title>SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR IMPROVING PLACEMENT PERFORMANCE OF MESSAGE TRANSFORMS BY EXPLOITING GUIDED REPLICATION</title><description>Systems, methods and computer program products for optimizing an objective function (e.g. the overall end-to-end runtime latency) of a flow graph of message transformations which are placed onto an overlay network of broker machines by replicating stateless transformations in a guided manner. Exemplary embodiments include a guided replication method, including given an initial transformation graph and a network topology, running a placement algorithm to obtain top N best task-to-broker assignments, identifying the R-task which forms the performance bottleneck, checking if the objective function improvement drops below a designated threshold, if yes, then selecting the optimal task-to-broker assignment and the program terminates; otherwise, replicating the R-task, optimally distributing the data load among R-task's replicas, deriving a set of starting points from the above obtained top N task-to-broker assignments, and re-executing the placement algorithm with these starting points in an iterative fashion.</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>2009</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjEsKwkAQRLNxIeodGtwq5EMWLseZTjKQ-TDdEV1JkHElGoiX8NYm4AFcPYpXVcvkQxdiNLQDg9w4RSCsAumM7xgD-ODqIMxM1UkmqFwAbaZ40rYG3wqJBi2DxzApI6xEcNV0RiRqBA7C0iwIjhfAs2-d5nlZd1qhgoC-1VKwdnadLO79Y4ybH1fJtkKWzT4Or2sch_4Wn_F97ShP00NelHmZiaz4r_UFBM1ARA</recordid><startdate>20090917</startdate><enddate>20090917</enddate><creator>STROM ROBERT EVAN</creator><creator>LI YING</creator><scope>EVB</scope></search><sort><creationdate>20090917</creationdate><title>SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR IMPROVING PLACEMENT PERFORMANCE OF MESSAGE TRANSFORMS BY EXPLOITING GUIDED REPLICATION</title><author>STROM ROBERT EVAN ; LI YING</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2009235251A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2009</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>STROM ROBERT EVAN</creatorcontrib><creatorcontrib>LI YING</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>STROM ROBERT EVAN</au><au>LI YING</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR IMPROVING PLACEMENT PERFORMANCE OF MESSAGE TRANSFORMS BY EXPLOITING GUIDED REPLICATION</title><date>2009-09-17</date><risdate>2009</risdate><abstract>Systems, methods and computer program products for optimizing an objective function (e.g. the overall end-to-end runtime latency) of a flow graph of message transformations which are placed onto an overlay network of broker machines by replicating stateless transformations in a guided manner. Exemplary embodiments include a guided replication method, including given an initial transformation graph and a network topology, running a placement algorithm to obtain top N best task-to-broker assignments, identifying the R-task which forms the performance bottleneck, checking if the objective function improvement drops below a designated threshold, if yes, then selecting the optimal task-to-broker assignment and the program terminates; otherwise, replicating the R-task, optimally distributing the data load among R-task's replicas, deriving a set of starting points from the above obtained top N task-to-broker assignments, and re-executing the placement algorithm with these starting points in an iterative fashion.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2009235251A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR IMPROVING PLACEMENT PERFORMANCE OF MESSAGE TRANSFORMS BY EXPLOITING GUIDED REPLICATION
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T17%3A54%3A16IST&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=STROM%20ROBERT%20EVAN&rft.date=2009-09-17&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2009235251A1%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