On linear schedules of task graphs for generalized logp-machines
We discuss linear schedules of task-graphs under the communication cost model of the LogP-machine. In addition to our previous work, we consider also non-constant parameters L, o and g, i.e. we introduce messages of different sizes into the LogP-model. The main results of this work are the following...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 904 |
|---|---|
| container_issue | |
| container_start_page | 895 |
| container_title | |
| container_volume | |
| creator | Löwe, Welf Zimmermann, Wolf Eisenbiegler, Jörn |
| description | We discuss linear schedules of task-graphs under the communication cost model of the LogP-machine. In addition to our previous work, we consider also non-constant parameters L, o and g, i.e. we introduce messages of different sizes into the LogP-model. The main results of this work are the following: (i) in the LogP-model, less communication in linear schedules does not necessarily imply a better performance. (ii) We give an upper time bound on the execution time of linear clusterings. (iii) We give an efficient algorithm which computes linear clusterings with a minimum number of clusters. |
| doi_str_mv | 10.1007/BFb0002832 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_2735501</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2735501</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1322-e7f7a969a284e000905943f0d4ab5f78c1e41f209fa3e4ee78e24e0fb32ff7b43</originalsourceid><addsrcrecordid>eNpFkD9PwzAUxM0_iap04RN4YGAJPPs5dbwBFQWkSl1gjl7S5zQ0TSIbBvj0GIHU6Yb73Z10QlwquFEA9vZhWQGALlAfiZmzBeYG5i43Do_FRM2VyhCNOzl4aAy4UzEBBJ05a_BczGJ8TyWAWjvnJuJu3cuu7ZmCjPWWN58dRzl4-UFxJ5tA4zZKPwTZcM-BuvabN7IbmjHbU71NuXghzjx1kWf_OhVvy8fXxXO2Wj-9LO5X2ajSVsbWW3JzR7ownPYd5M6gh42hKve2qBUb5TU4T8iG2RasE-gr1N7byuBUXP31jhRr6nygvm5jOYZ2T-Gr1BbzHFTCrv-wmJy-4VBWw7CLpYLy98Py8CH-AGqgXVw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On linear schedules of task graphs for generalized logp-machines</title><source>Springer Books</source><creator>Löwe, Welf ; Zimmermann, Wolf ; Eisenbiegler, Jörn</creator><contributor>Gorlatch, Sergei ; Lengauer, Christian ; Griebl, Martin</contributor><creatorcontrib>Löwe, Welf ; Zimmermann, Wolf ; Eisenbiegler, Jörn ; Gorlatch, Sergei ; Lengauer, Christian ; Griebl, Martin</creatorcontrib><description>We discuss linear schedules of task-graphs under the communication cost model of the LogP-machine. In addition to our previous work, we consider also non-constant parameters L, o and g, i.e. we introduce messages of different sizes into the LogP-model. The main results of this work are the following: (i) in the LogP-model, less communication in linear schedules does not necessarily imply a better performance. (ii) We give an upper time bound on the execution time of linear clusterings. (iii) We give an efficient algorithm which computes linear clusterings with a minimum number of clusters.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540634409</identifier><identifier>ISBN: 3540634401</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540695493</identifier><identifier>EISBN: 3540695494</identifier><identifier>DOI: 10.1007/BFb0002832</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems performance. Reliability ; Exact sciences and technology ; Execution Time ; Linear Cluster ; Linear Schedule ; Software ; Task Graph ; Topological Sorting</subject><ispartof>Euro-Par'97 Parallel Processing, 2005, p.895-904</ispartof><rights>Springer-Verlag Berlin Heidelberg 1997</rights><rights>1997 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0002832$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0002832$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,776,777,781,786,787,790,4036,4037,27906,38236,41423,42492</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2735501$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Gorlatch, Sergei</contributor><contributor>Lengauer, Christian</contributor><contributor>Griebl, Martin</contributor><creatorcontrib>Löwe, Welf</creatorcontrib><creatorcontrib>Zimmermann, Wolf</creatorcontrib><creatorcontrib>Eisenbiegler, Jörn</creatorcontrib><title>On linear schedules of task graphs for generalized logp-machines</title><title>Euro-Par'97 Parallel Processing</title><description>We discuss linear schedules of task-graphs under the communication cost model of the LogP-machine. In addition to our previous work, we consider also non-constant parameters L, o and g, i.e. we introduce messages of different sizes into the LogP-model. The main results of this work are the following: (i) in the LogP-model, less communication in linear schedules does not necessarily imply a better performance. (ii) We give an upper time bound on the execution time of linear clusterings. (iii) We give an efficient algorithm which computes linear clusterings with a minimum number of clusters.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems performance. Reliability</subject><subject>Exact sciences and technology</subject><subject>Execution Time</subject><subject>Linear Cluster</subject><subject>Linear Schedule</subject><subject>Software</subject><subject>Task Graph</subject><subject>Topological Sorting</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540634409</isbn><isbn>3540634401</isbn><isbn>9783540695493</isbn><isbn>3540695494</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkD9PwzAUxM0_iap04RN4YGAJPPs5dbwBFQWkSl1gjl7S5zQ0TSIbBvj0GIHU6Yb73Z10QlwquFEA9vZhWQGALlAfiZmzBeYG5i43Do_FRM2VyhCNOzl4aAy4UzEBBJ05a_BczGJ8TyWAWjvnJuJu3cuu7ZmCjPWWN58dRzl4-UFxJ5tA4zZKPwTZcM-BuvabN7IbmjHbU71NuXghzjx1kWf_OhVvy8fXxXO2Wj-9LO5X2ajSVsbWW3JzR7ownPYd5M6gh42hKve2qBUb5TU4T8iG2RasE-gr1N7byuBUXP31jhRr6nygvm5jOYZ2T-Gr1BbzHFTCrv-wmJy-4VBWw7CLpYLy98Py8CH-AGqgXVw</recordid><startdate>20050926</startdate><enddate>20050926</enddate><creator>Löwe, Welf</creator><creator>Zimmermann, Wolf</creator><creator>Eisenbiegler, Jörn</creator><general>Springer Berlin Heidelberg</general><general>Springer-Verlag</general><scope>IQODW</scope></search><sort><creationdate>20050926</creationdate><title>On linear schedules of task graphs for generalized logp-machines</title><author>Löwe, Welf ; Zimmermann, Wolf ; Eisenbiegler, Jörn</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1322-e7f7a969a284e000905943f0d4ab5f78c1e41f209fa3e4ee78e24e0fb32ff7b43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems performance. Reliability</topic><topic>Exact sciences and technology</topic><topic>Execution Time</topic><topic>Linear Cluster</topic><topic>Linear Schedule</topic><topic>Software</topic><topic>Task Graph</topic><topic>Topological Sorting</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Löwe, Welf</creatorcontrib><creatorcontrib>Zimmermann, Wolf</creatorcontrib><creatorcontrib>Eisenbiegler, Jörn</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Löwe, Welf</au><au>Zimmermann, Wolf</au><au>Eisenbiegler, Jörn</au><au>Gorlatch, Sergei</au><au>Lengauer, Christian</au><au>Griebl, Martin</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On linear schedules of task graphs for generalized logp-machines</atitle><btitle>Euro-Par'97 Parallel Processing</btitle><date>2005-09-26</date><risdate>2005</risdate><spage>895</spage><epage>904</epage><pages>895-904</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540634409</isbn><isbn>3540634401</isbn><eisbn>9783540695493</eisbn><eisbn>3540695494</eisbn><abstract>We discuss linear schedules of task-graphs under the communication cost model of the LogP-machine. In addition to our previous work, we consider also non-constant parameters L, o and g, i.e. we introduce messages of different sizes into the LogP-model. The main results of this work are the following: (i) in the LogP-model, less communication in linear schedules does not necessarily imply a better performance. (ii) We give an upper time bound on the execution time of linear clusterings. (iii) We give an efficient algorithm which computes linear clusterings with a minimum number of clusters.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0002832</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Euro-Par'97 Parallel Processing, 2005, p.895-904 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_2735501 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Computer systems performance. Reliability Exact sciences and technology Execution Time Linear Cluster Linear Schedule Software Task Graph Topological Sorting |
| title | On linear schedules of task graphs for generalized logp-machines |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T09%3A42%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20linear%20schedules%20of%20task%20graphs%20for%20generalized%20logp-machines&rft.btitle=Euro-Par'97%20Parallel%20Processing&rft.au=L%C3%B6we,%20Welf&rft.date=2005-09-26&rft.spage=895&rft.epage=904&rft.pages=895-904&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540634409&rft.isbn_list=3540634401&rft_id=info:doi/10.1007/BFb0002832&rft_dat=%3Cpascalfrancis_sprin%3E2735501%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540695493&rft.eisbn_list=3540695494&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |