Software Partitioning for Distributed, Sequential, Pipelined Applications
An examination of real-time performance analysis and allocation of system resources to meet throughput and response time requirements has aided in the development of a methodology for structuring software for real-time distributed systems. A queuing network model is used to estimate real-time perfor...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on software engineering 1989-10, Vol.15 (10), p.1270-1279 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1279 |
|---|---|
| container_issue | 10 |
| container_start_page | 1270 |
| container_title | IEEE transactions on software engineering |
| container_volume | 15 |
| creator | Iyer, V R Sholl, H A |
| description | An examination of real-time performance analysis and allocation of system resources to meet throughput and response time requirements has aided in the development of a methodology for structuring software for real-time distributed systems. A queuing network model is used to estimate real-time performance for alternative software partitions. Those partitions that can satisfy user performance requirements while requiring minimal resources are identified. A 2-queue model, representing module service and communications, is evaluated using queuing network approximation. The results demonstrate that an optimal solution set can be determined with a branch and bound approach. The initial version is being improved to permit an expansion of its capability to allow a user to interactively explore performance variations for a selected structure as parameter values vary. |
| doi_str_mv | 10.1109/TSE.1989.559779 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_osti_</sourceid><recordid>TN_cdi_osti_scitechconnect_5238730</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>25432916</sourcerecordid><originalsourceid>FETCH-LOGICAL-o238t-856485eb157245f9967b3191374152d183c11ea448b1638ae7085e96f08792c93</originalsourceid><addsrcrecordid>eNo9kL1PwzAUxC0EEuVjZo0YmJpix3HsN1alQKVKVGqZI8d9AVfBDrEj_n2Mijrd8ru7946QO0ZnjFF43G2XMwYKZkKAlHBGJgw45FwU9JxMKAWVC6HgklyFcKCUCinFhKy2vo0_esBso4doo_XOuo-s9UP2ZEMcbDNG3E-zLX6P6KLV3TTb2B4763Cfzfu-s0b_ucINuWh1F_D2X6_J-_Nyt3jN128vq8V8nfuCq5grUZVKYMOELErRAlSy4QwYlyUTxZ4pbhhDXZaqYRVXGiVNOFQtVRIKA_ya3B9zfYi2DsZGNJ_GO4cm1iJ1SE4T9HCE-sGnw0Osv2ww2HXaoR9DXYiSF5AKTmkn8ODHwaUHagZpryptyX8BKDtmNA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195586977</pqid></control><display><type>article</type><title>Software Partitioning for Distributed, Sequential, Pipelined Applications</title><source>IEEE Electronic Library (IEL)</source><creator>Iyer, V R ; Sholl, H A</creator><creatorcontrib>Iyer, V R ; Sholl, H A</creatorcontrib><description>An examination of real-time performance analysis and allocation of system resources to meet throughput and response time requirements has aided in the development of a methodology for structuring software for real-time distributed systems. A queuing network model is used to estimate real-time performance for alternative software partitions. Those partitions that can satisfy user performance requirements while requiring minimal resources are identified. A 2-queue model, representing module service and communications, is evaluated using queuing network approximation. The results demonstrate that an optimal solution set can be determined with a branch and bound approach. The initial version is being improved to permit an expansion of its capability to allow a user to interactively explore performance variations for a selected structure as parameter values vary.</description><identifier>ISSN: 0098-5589</identifier><identifier>EISSN: 1939-3520</identifier><identifier>DOI: 10.1109/TSE.1989.559779</identifier><identifier>CODEN: IESEDJ</identifier><language>eng</language><publisher>New York: IEEE Computer Society</publisher><subject>990200 - Mathematics & Computers ; Approximation ; Communication ; COMPUTER CODES ; COMPUTER NETWORKS ; Computer programming ; DATA PROCESSING ; Design ; Distributed ; DISTRIBUTED DATA PROCESSING ; GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE ; Load ; Mathematical programming ; OPTIMIZATION ; PARALLEL PROCESSING ; Performance evaluation ; PERFORMANCE TESTING ; PROCESSING ; PROGRAMMING ; QUEUES ; Queuing ; Real time ; REAL TIME SYSTEMS ; Response time ; Software ; Systems ; Systems design ; TESTING</subject><ispartof>IEEE transactions on software engineering, 1989-10, Vol.15 (10), p.1270-1279</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 1989</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,27924,27925</link.rule.ids><backlink>$$Uhttps://www.osti.gov/biblio/5238730$$D View this record in Osti.gov$$Hfree_for_read</backlink></links><search><creatorcontrib>Iyer, V R</creatorcontrib><creatorcontrib>Sholl, H A</creatorcontrib><title>Software Partitioning for Distributed, Sequential, Pipelined Applications</title><title>IEEE transactions on software engineering</title><description>An examination of real-time performance analysis and allocation of system resources to meet throughput and response time requirements has aided in the development of a methodology for structuring software for real-time distributed systems. A queuing network model is used to estimate real-time performance for alternative software partitions. Those partitions that can satisfy user performance requirements while requiring minimal resources are identified. A 2-queue model, representing module service and communications, is evaluated using queuing network approximation. The results demonstrate that an optimal solution set can be determined with a branch and bound approach. The initial version is being improved to permit an expansion of its capability to allow a user to interactively explore performance variations for a selected structure as parameter values vary.</description><subject>990200 - Mathematics & Computers</subject><subject>Approximation</subject><subject>Communication</subject><subject>COMPUTER CODES</subject><subject>COMPUTER NETWORKS</subject><subject>Computer programming</subject><subject>DATA PROCESSING</subject><subject>Design</subject><subject>Distributed</subject><subject>DISTRIBUTED DATA PROCESSING</subject><subject>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</subject><subject>Load</subject><subject>Mathematical programming</subject><subject>OPTIMIZATION</subject><subject>PARALLEL PROCESSING</subject><subject>Performance evaluation</subject><subject>PERFORMANCE TESTING</subject><subject>PROCESSING</subject><subject>PROGRAMMING</subject><subject>QUEUES</subject><subject>Queuing</subject><subject>Real time</subject><subject>REAL TIME SYSTEMS</subject><subject>Response time</subject><subject>Software</subject><subject>Systems</subject><subject>Systems design</subject><subject>TESTING</subject><issn>0098-5589</issn><issn>1939-3520</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNo9kL1PwzAUxC0EEuVjZo0YmJpix3HsN1alQKVKVGqZI8d9AVfBDrEj_n2Mijrd8ru7946QO0ZnjFF43G2XMwYKZkKAlHBGJgw45FwU9JxMKAWVC6HgklyFcKCUCinFhKy2vo0_esBso4doo_XOuo-s9UP2ZEMcbDNG3E-zLX6P6KLV3TTb2B4763Cfzfu-s0b_ucINuWh1F_D2X6_J-_Nyt3jN128vq8V8nfuCq5grUZVKYMOELErRAlSy4QwYlyUTxZ4pbhhDXZaqYRVXGiVNOFQtVRIKA_ya3B9zfYi2DsZGNJ_GO4cm1iJ1SE4T9HCE-sGnw0Osv2ww2HXaoR9DXYiSF5AKTmkn8ODHwaUHagZpryptyX8BKDtmNA</recordid><startdate>19891001</startdate><enddate>19891001</enddate><creator>Iyer, V R</creator><creator>Sholl, H A</creator><general>IEEE Computer Society</general><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>OTOTI</scope></search><sort><creationdate>19891001</creationdate><title>Software Partitioning for Distributed, Sequential, Pipelined Applications</title><author>Iyer, V R ; Sholl, H A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-o238t-856485eb157245f9967b3191374152d183c11ea448b1638ae7085e96f08792c93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>990200 - Mathematics & Computers</topic><topic>Approximation</topic><topic>Communication</topic><topic>COMPUTER CODES</topic><topic>COMPUTER NETWORKS</topic><topic>Computer programming</topic><topic>DATA PROCESSING</topic><topic>Design</topic><topic>Distributed</topic><topic>DISTRIBUTED DATA PROCESSING</topic><topic>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</topic><topic>Load</topic><topic>Mathematical programming</topic><topic>OPTIMIZATION</topic><topic>PARALLEL PROCESSING</topic><topic>Performance evaluation</topic><topic>PERFORMANCE TESTING</topic><topic>PROCESSING</topic><topic>PROGRAMMING</topic><topic>QUEUES</topic><topic>Queuing</topic><topic>Real time</topic><topic>REAL TIME SYSTEMS</topic><topic>Response time</topic><topic>Software</topic><topic>Systems</topic><topic>Systems design</topic><topic>TESTING</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Iyer, V R</creatorcontrib><creatorcontrib>Sholl, H A</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>OSTI.GOV</collection><jtitle>IEEE transactions on software engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Iyer, V R</au><au>Sholl, H A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Software Partitioning for Distributed, Sequential, Pipelined Applications</atitle><jtitle>IEEE transactions on software engineering</jtitle><date>1989-10-01</date><risdate>1989</risdate><volume>15</volume><issue>10</issue><spage>1270</spage><epage>1279</epage><pages>1270-1279</pages><issn>0098-5589</issn><eissn>1939-3520</eissn><coden>IESEDJ</coden><abstract>An examination of real-time performance analysis and allocation of system resources to meet throughput and response time requirements has aided in the development of a methodology for structuring software for real-time distributed systems. A queuing network model is used to estimate real-time performance for alternative software partitions. Those partitions that can satisfy user performance requirements while requiring minimal resources are identified. A 2-queue model, representing module service and communications, is evaluated using queuing network approximation. The results demonstrate that an optimal solution set can be determined with a branch and bound approach. The initial version is being improved to permit an expansion of its capability to allow a user to interactively explore performance variations for a selected structure as parameter values vary.</abstract><cop>New York</cop><pub>IEEE Computer Society</pub><doi>10.1109/TSE.1989.559779</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0098-5589 |
| ispartof | IEEE transactions on software engineering, 1989-10, Vol.15 (10), p.1270-1279 |
| issn | 0098-5589 1939-3520 |
| language | eng |
| recordid | cdi_osti_scitechconnect_5238730 |
| source | IEEE Electronic Library (IEL) |
| subjects | 990200 - Mathematics & Computers Approximation Communication COMPUTER CODES COMPUTER NETWORKS Computer programming DATA PROCESSING Design Distributed DISTRIBUTED DATA PROCESSING GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE Load Mathematical programming OPTIMIZATION PARALLEL PROCESSING Performance evaluation PERFORMANCE TESTING PROCESSING PROGRAMMING QUEUES Queuing Real time REAL TIME SYSTEMS Response time Software Systems Systems design TESTING |
| title | Software Partitioning for Distributed, Sequential, Pipelined Applications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T13%3A54%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_osti_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Software%20Partitioning%20for%20Distributed,%20Sequential,%20Pipelined%20Applications&rft.jtitle=IEEE%20transactions%20on%20software%20engineering&rft.au=Iyer,%20V%20R&rft.date=1989-10-01&rft.volume=15&rft.issue=10&rft.spage=1270&rft.epage=1279&rft.pages=1270-1279&rft.issn=0098-5589&rft.eissn=1939-3520&rft.coden=IESEDJ&rft_id=info:doi/10.1109/TSE.1989.559779&rft_dat=%3Cproquest_osti_%3E25432916%3C/proquest_osti_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195586977&rft_id=info:pmid/&rfr_iscdi=true |