Optimized dynamic matrixing of software environments for application test and analysis
A method for matrixing of software environments is provided. The method includes receiving a selection of a plurality of aspects of a task environment for an application and executing the application in a task environment selected from a set of all possible combinations. The method includes selectin...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| 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 | Molner, Matthew John Kerbawy, Matthew Kevin Cheng, Jeffery C Dolinsky, Todd Jason |
| description | A method for matrixing of software environments is provided. The method includes receiving a selection of a plurality of aspects of a task environment for an application and executing the application in a task environment selected from a set of all possible combinations. The method includes selecting a next task environment from the set of all possible combinations, based on a result of executing the application in the task environment and reducing a matrix search scope, responsive to a failure in the executing the application in the task environment. The method includes repeating the executing, the selecting and the reducing until one of the matrix search scope as reduced, is less than or equal to a completed search scope, or the set of all possible combinations of the plurality of aspects of the task environment is in the completed search scope. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9983979B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9983979B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9983979B13</originalsourceid><addsrcrecordid>eNqNyj0KAjEQQOFtLES9w1zAQrbQtIpiZ-FPuwzJRAaSScgM6np6LTyAxeNr3rS7napx5jcFCKNgZg8ZrfGL5Q4lgpZoT2wEJA9uRTKJKcTSAGtN7NG4CBipAUr4hmlU1nk3iZiUFj9nHRz2l91xSbUMpBU9CdlwPTu36d3abVf9H8sHOM06gA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Optimized dynamic matrixing of software environments for application test and analysis</title><source>esp@cenet</source><creator>Molner, Matthew John ; Kerbawy, Matthew Kevin ; Cheng, Jeffery C ; Dolinsky, Todd Jason</creator><creatorcontrib>Molner, Matthew John ; Kerbawy, Matthew Kevin ; Cheng, Jeffery C ; Dolinsky, Todd Jason</creatorcontrib><description>A method for matrixing of software environments is provided. The method includes receiving a selection of a plurality of aspects of a task environment for an application and executing the application in a task environment selected from a set of all possible combinations. The method includes selecting a next task environment from the set of all possible combinations, based on a result of executing the application in the task environment and reducing a matrix search scope, responsive to a failure in the executing the application in the task environment. The method includes repeating the executing, the selecting and the reducing until one of the matrix search scope as reduced, is less than or equal to a completed search scope, or the set of all possible combinations of the plurality of aspects of the task environment is in the completed search scope.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2018</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&date=20180529&DB=EPODOC&CC=US&NR=9983979B1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20180529&DB=EPODOC&CC=US&NR=9983979B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Molner, Matthew John</creatorcontrib><creatorcontrib>Kerbawy, Matthew Kevin</creatorcontrib><creatorcontrib>Cheng, Jeffery C</creatorcontrib><creatorcontrib>Dolinsky, Todd Jason</creatorcontrib><title>Optimized dynamic matrixing of software environments for application test and analysis</title><description>A method for matrixing of software environments is provided. The method includes receiving a selection of a plurality of aspects of a task environment for an application and executing the application in a task environment selected from a set of all possible combinations. The method includes selecting a next task environment from the set of all possible combinations, based on a result of executing the application in the task environment and reducing a matrix search scope, responsive to a failure in the executing the application in the task environment. The method includes repeating the executing, the selecting and the reducing until one of the matrix search scope as reduced, is less than or equal to a completed search scope, or the set of all possible combinations of the plurality of aspects of the task environment is in the completed search scope.</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>2018</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyj0KAjEQQOFtLES9w1zAQrbQtIpiZ-FPuwzJRAaSScgM6np6LTyAxeNr3rS7napx5jcFCKNgZg8ZrfGL5Q4lgpZoT2wEJA9uRTKJKcTSAGtN7NG4CBipAUr4hmlU1nk3iZiUFj9nHRz2l91xSbUMpBU9CdlwPTu36d3abVf9H8sHOM06gA</recordid><startdate>20180529</startdate><enddate>20180529</enddate><creator>Molner, Matthew John</creator><creator>Kerbawy, Matthew Kevin</creator><creator>Cheng, Jeffery C</creator><creator>Dolinsky, Todd Jason</creator><scope>EVB</scope></search><sort><creationdate>20180529</creationdate><title>Optimized dynamic matrixing of software environments for application test and analysis</title><author>Molner, Matthew John ; Kerbawy, Matthew Kevin ; Cheng, Jeffery C ; Dolinsky, Todd Jason</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9983979B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2018</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Molner, Matthew John</creatorcontrib><creatorcontrib>Kerbawy, Matthew Kevin</creatorcontrib><creatorcontrib>Cheng, Jeffery C</creatorcontrib><creatorcontrib>Dolinsky, Todd Jason</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Molner, Matthew John</au><au>Kerbawy, Matthew Kevin</au><au>Cheng, Jeffery C</au><au>Dolinsky, Todd Jason</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Optimized dynamic matrixing of software environments for application test and analysis</title><date>2018-05-29</date><risdate>2018</risdate><abstract>A method for matrixing of software environments is provided. The method includes receiving a selection of a plurality of aspects of a task environment for an application and executing the application in a task environment selected from a set of all possible combinations. The method includes selecting a next task environment from the set of all possible combinations, based on a result of executing the application in the task environment and reducing a matrix search scope, responsive to a failure in the executing the application in the task environment. The method includes repeating the executing, the selecting and the reducing until one of the matrix search scope as reduced, is less than or equal to a completed search scope, or the set of all possible combinations of the plurality of aspects of the task environment is in the completed search scope.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US9983979B1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Optimized dynamic matrixing of software environments for application test and analysis |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T01%3A53%3A23IST&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=Molner,%20Matthew%20John&rft.date=2018-05-29&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9983979B1%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 |