On mapping processes to processors in distributed systems
The implementation of parallel programs on networks of processors is considered. Specifically, the use of the network augmenting approach as an implementation tool is examined. According to this approach, the capabilities of a given network of processors can be increased by adding some auxiliary con...
Gespeichert in:
| Veröffentlicht in: | Int. J. Parallel Program.; (United States) 1987-02, Vol.16 (1), p.1-15 |
|---|---|
| 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 | 15 |
|---|---|
| container_issue | 1 |
| container_start_page | 1 |
| container_title | Int. J. Parallel Program.; (United States) |
| container_volume | 16 |
| creator | PINTER, S. S WOLFSTAHL, Y |
| description | The implementation of parallel programs on networks of processors is considered. Specifically, the use of the network augmenting approach as an implementation tool is examined. According to this approach, the capabilities of a given network of processors can be increased by adding some auxiliary connections among the processors. It is proved that the minimum set of edges needed to augment a line-like network so that it can accommodate a parallel program is determined by an optimal path cover of the graph representation of the program. An optimal path cover of a simple graph is a set of vertex-disjoint paths that cover all the vertices of that graph and has the maximum possible number of edges. A linear time optimal path covering algorithm for a class of sparse graphs is offered. This algorithm is of special interest because the optimal path covering problem is NP-complete for general graphs. The results indicate that a "cover and augment" scheme can be used for optimal implementation of parallel programs in line-like networks. |
| doi_str_mv | 10.1007/BF01408172 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_osti_</sourceid><recordid>TN_cdi_proquest_miscellaneous_36504565</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1121140</sourcerecordid><originalsourceid>FETCH-LOGICAL-c343t-d181117a2a2003515f9368407ec7d065f16bd40de4842b1de301bde73f837f913</originalsourceid><addsrcrecordid>eNpFkE1LAzEQhoMoWKsXf8Ei4kFYnWySTfaoxapQ6EXPIZvNasp-mcke-u9daW1Pw8DzPsy8hFxTeKAA8vF5CZSDojI7ITMqJEtlzuGUzEApkUou1Dm5QNwAQCGVmpFi3SWtGQbffSVD6K1DdJjE_n_pAya-SyqPMfhyjK5KcIvRtXhJzmrToLvazzn5XL58LN7S1fr1ffG0Si3jLKYVVZRSaTKTATBBRV2wXHGQzsoKclHTvKw4VI4rnpW0cgxoWTnJasVkXVA2Jzc7b4_Ra7Q-Ovtt-65zNupcZooyNkF3O2g6-2d0GHXr0bqmMZ3rR9QsF8BFLo62A7jpx9BND-gMeFaAKrIJut9BNvSIwdV6CL41Yasp6L-e9bHnCb7dGw1a09TBdNbjIZEXSjAm2S98XnnH</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204290892</pqid></control><display><type>article</type><title>On mapping processes to processors in distributed systems</title><source>SpringerLink</source><creator>PINTER, S. S ; WOLFSTAHL, Y</creator><creatorcontrib>PINTER, S. S ; WOLFSTAHL, Y ; Israel Institute of Technology, Haifa</creatorcontrib><description>The implementation of parallel programs on networks of processors is considered. Specifically, the use of the network augmenting approach as an implementation tool is examined. According to this approach, the capabilities of a given network of processors can be increased by adding some auxiliary connections among the processors. It is proved that the minimum set of edges needed to augment a line-like network so that it can accommodate a parallel program is determined by an optimal path cover of the graph representation of the program. An optimal path cover of a simple graph is a set of vertex-disjoint paths that cover all the vertices of that graph and has the maximum possible number of edges. A linear time optimal path covering algorithm for a class of sparse graphs is offered. This algorithm is of special interest because the optimal path covering problem is NP-complete for general graphs. The results indicate that a "cover and augment" scheme can be used for optimal implementation of parallel programs in line-like networks.</description><identifier>ISSN: 0885-7458</identifier><identifier>EISSN: 1573-7640</identifier><identifier>DOI: 10.1007/BF01408172</identifier><identifier>CODEN: IJPPE5</identifier><language>eng</language><publisher>New York, NY: Plenum Press</publisher><subject>ALGORITHMS ; Applied sciences ; ARRAY PROCESSORS ; COMPUTER CODES ; COMPUTER NETWORKS ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; DATA PROCESSING ; DISTRIBUTED DATA PROCESSING ; Distributed processing ; Exact sciences and technology ; GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE ; Graph representations ; GRAPHS ; IMPLEMENTATION ; Mathematical analysis ; MATHEMATICAL LOGIC ; OPTIMIZATION ; PARALLEL PROCESSING ; PROCESSING ; PROGRAMMING 990210 -- Supercomputers-- (1987-1989) ; Software ; TASK SCHEDULING ; VLSI</subject><ispartof>Int. J. Parallel Program.; (United States), 1987-02, Vol.16 (1), p.1-15</ispartof><rights>1989 INIST-CNRS</rights><rights>Copyright Plenum Publishing Corporation Feb 1987</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c343t-d181117a2a2003515f9368407ec7d065f16bd40de4842b1de301bde73f837f913</citedby><cites>FETCH-LOGICAL-c343t-d181117a2a2003515f9368407ec7d065f16bd40de4842b1de301bde73f837f913</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785,886,27926,27927</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=6985337$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://www.osti.gov/biblio/6728133$$D View this record in Osti.gov$$Hfree_for_read</backlink></links><search><creatorcontrib>PINTER, S. S</creatorcontrib><creatorcontrib>WOLFSTAHL, Y</creatorcontrib><creatorcontrib>Israel Institute of Technology, Haifa</creatorcontrib><title>On mapping processes to processors in distributed systems</title><title>Int. J. Parallel Program.; (United States)</title><description>The implementation of parallel programs on networks of processors is considered. Specifically, the use of the network augmenting approach as an implementation tool is examined. According to this approach, the capabilities of a given network of processors can be increased by adding some auxiliary connections among the processors. It is proved that the minimum set of edges needed to augment a line-like network so that it can accommodate a parallel program is determined by an optimal path cover of the graph representation of the program. An optimal path cover of a simple graph is a set of vertex-disjoint paths that cover all the vertices of that graph and has the maximum possible number of edges. A linear time optimal path covering algorithm for a class of sparse graphs is offered. This algorithm is of special interest because the optimal path covering problem is NP-complete for general graphs. The results indicate that a "cover and augment" scheme can be used for optimal implementation of parallel programs in line-like networks.</description><subject>ALGORITHMS</subject><subject>Applied sciences</subject><subject>ARRAY PROCESSORS</subject><subject>COMPUTER CODES</subject><subject>COMPUTER NETWORKS</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>DATA PROCESSING</subject><subject>DISTRIBUTED DATA PROCESSING</subject><subject>Distributed processing</subject><subject>Exact sciences and technology</subject><subject>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</subject><subject>Graph representations</subject><subject>GRAPHS</subject><subject>IMPLEMENTATION</subject><subject>Mathematical analysis</subject><subject>MATHEMATICAL LOGIC</subject><subject>OPTIMIZATION</subject><subject>PARALLEL PROCESSING</subject><subject>PROCESSING</subject><subject>PROGRAMMING 990210 -- Supercomputers-- (1987-1989)</subject><subject>Software</subject><subject>TASK SCHEDULING</subject><subject>VLSI</subject><issn>0885-7458</issn><issn>1573-7640</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1987</creationdate><recordtype>article</recordtype><recordid>eNpFkE1LAzEQhoMoWKsXf8Ei4kFYnWySTfaoxapQ6EXPIZvNasp-mcke-u9daW1Pw8DzPsy8hFxTeKAA8vF5CZSDojI7ITMqJEtlzuGUzEApkUou1Dm5QNwAQCGVmpFi3SWtGQbffSVD6K1DdJjE_n_pAya-SyqPMfhyjK5KcIvRtXhJzmrToLvazzn5XL58LN7S1fr1ffG0Si3jLKYVVZRSaTKTATBBRV2wXHGQzsoKclHTvKw4VI4rnpW0cgxoWTnJasVkXVA2Jzc7b4_Ra7Q-Ovtt-65zNupcZooyNkF3O2g6-2d0GHXr0bqmMZ3rR9QsF8BFLo62A7jpx9BND-gMeFaAKrIJut9BNvSIwdV6CL41Yasp6L-e9bHnCb7dGw1a09TBdNbjIZEXSjAm2S98XnnH</recordid><startdate>19870201</startdate><enddate>19870201</enddate><creator>PINTER, S. S</creator><creator>WOLFSTAHL, Y</creator><general>Plenum Press</general><general>Springer Nature B.V</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>OTOTI</scope></search><sort><creationdate>19870201</creationdate><title>On mapping processes to processors in distributed systems</title><author>PINTER, S. S ; WOLFSTAHL, Y</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c343t-d181117a2a2003515f9368407ec7d065f16bd40de4842b1de301bde73f837f913</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1987</creationdate><topic>ALGORITHMS</topic><topic>Applied sciences</topic><topic>ARRAY PROCESSORS</topic><topic>COMPUTER CODES</topic><topic>COMPUTER NETWORKS</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>DATA PROCESSING</topic><topic>DISTRIBUTED DATA PROCESSING</topic><topic>Distributed processing</topic><topic>Exact sciences and technology</topic><topic>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</topic><topic>Graph representations</topic><topic>GRAPHS</topic><topic>IMPLEMENTATION</topic><topic>Mathematical analysis</topic><topic>MATHEMATICAL LOGIC</topic><topic>OPTIMIZATION</topic><topic>PARALLEL PROCESSING</topic><topic>PROCESSING</topic><topic>PROGRAMMING 990210 -- Supercomputers-- (1987-1989)</topic><topic>Software</topic><topic>TASK SCHEDULING</topic><topic>VLSI</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>PINTER, S. S</creatorcontrib><creatorcontrib>WOLFSTAHL, Y</creatorcontrib><creatorcontrib>Israel Institute of Technology, Haifa</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</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>Int. J. Parallel Program.; (United States)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>PINTER, S. S</au><au>WOLFSTAHL, Y</au><aucorp>Israel Institute of Technology, Haifa</aucorp><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On mapping processes to processors in distributed systems</atitle><jtitle>Int. J. Parallel Program.; (United States)</jtitle><date>1987-02-01</date><risdate>1987</risdate><volume>16</volume><issue>1</issue><spage>1</spage><epage>15</epage><pages>1-15</pages><issn>0885-7458</issn><eissn>1573-7640</eissn><coden>IJPPE5</coden><abstract>The implementation of parallel programs on networks of processors is considered. Specifically, the use of the network augmenting approach as an implementation tool is examined. According to this approach, the capabilities of a given network of processors can be increased by adding some auxiliary connections among the processors. It is proved that the minimum set of edges needed to augment a line-like network so that it can accommodate a parallel program is determined by an optimal path cover of the graph representation of the program. An optimal path cover of a simple graph is a set of vertex-disjoint paths that cover all the vertices of that graph and has the maximum possible number of edges. A linear time optimal path covering algorithm for a class of sparse graphs is offered. This algorithm is of special interest because the optimal path covering problem is NP-complete for general graphs. The results indicate that a "cover and augment" scheme can be used for optimal implementation of parallel programs in line-like networks.</abstract><cop>New York, NY</cop><pub>Plenum Press</pub><doi>10.1007/BF01408172</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0885-7458 |
| ispartof | Int. J. Parallel Program.; (United States), 1987-02, Vol.16 (1), p.1-15 |
| issn | 0885-7458 1573-7640 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_36504565 |
| source | SpringerLink |
| subjects | ALGORITHMS Applied sciences ARRAY PROCESSORS COMPUTER CODES COMPUTER NETWORKS Computer science control theory systems Computer systems and distributed systems. User interface DATA PROCESSING DISTRIBUTED DATA PROCESSING Distributed processing Exact sciences and technology GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE Graph representations GRAPHS IMPLEMENTATION Mathematical analysis MATHEMATICAL LOGIC OPTIMIZATION PARALLEL PROCESSING PROCESSING PROGRAMMING 990210 -- Supercomputers-- (1987-1989) Software TASK SCHEDULING VLSI |
| title | On mapping processes to processors in distributed systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T19%3A17%3A58IST&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=On%20mapping%20processes%20to%20processors%20in%20distributed%20systems&rft.jtitle=Int.%20J.%20Parallel%20Program.;%20(United%20States)&rft.au=PINTER,%20S.%20S&rft.aucorp=Israel%20Institute%20of%20Technology,%20Haifa&rft.date=1987-02-01&rft.volume=16&rft.issue=1&rft.spage=1&rft.epage=15&rft.pages=1-15&rft.issn=0885-7458&rft.eissn=1573-7640&rft.coden=IJPPE5&rft_id=info:doi/10.1007/BF01408172&rft_dat=%3Cproquest_osti_%3E1121140%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=204290892&rft_id=info:pmid/&rfr_iscdi=true |