Graph reduction and pipelined parallel algorithms:
Abstract: "We report upon an experiment designed to investigate the extent to which a straightforward implementation of graph reduction on a message passing architecture can, given a suitably pre-distributed graph, mimic the dynamic behaviour of explicitly programmed algorithms for the same arc...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1991
|
| Series: | University <Edinburgh> / Department of Computer Science: CSR
18 |
| Subjects: | |
| Summary: | Abstract: "We report upon an experiment designed to investigate the extent to which a straightforward implementation of graph reduction on a message passing architecture can, given a suitably pre-distributed graph, mimic the dynamic behaviour of explicitly programmed algorithms for the same architecture. In this paper we investigate distributions which are intended to invoke pipelined behaviour." |
| Physical Description: | 13 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009841252 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941012s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)32408789 | ||
| 035 | |a (DE-599)BVBBV009841252 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 088 | |a CSR 18 91 | ||
| 100 | 1 | |a Cole, Murray |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Graph reduction and pipelined parallel algorithms |c by Murray Cole |
| 264 | 1 | |a Edinburgh |c 1991 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Computer Science: CSR |v 18 | |
| 520 | 3 | |a Abstract: "We report upon an experiment designed to investigate the extent to which a straightforward implementation of graph reduction on a message passing architecture can, given a suitably pre-distributed graph, mimic the dynamic behaviour of explicitly programmed algorithms for the same architecture. In this paper we investigate distributions which are intended to invoke pipelined behaviour." | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Functional programming (Computer science) | |
| 810 | 2 | |a Department of Computer Science: CSR |t University <Edinburgh> |v 18 |w (DE-604)BV008906637 |9 18 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006516377 | ||
Record in the Search Index
| _version_ | 1804124198090571776 |
|---|---|
| any_adam_object | |
| author | Cole, Murray |
| author_facet | Cole, Murray |
| author_role | aut |
| author_sort | Cole, Murray |
| author_variant | m c mc |
| building | Verbundindex |
| bvnumber | BV009841252 |
| ctrlnum | (OCoLC)32408789 (DE-599)BVBBV009841252 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01367nam a2200313 cb4500</leader><controlfield tag="001">BV009841252</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941012s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32408789</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009841252</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CSR 18 91</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cole, Murray</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph reduction and pipelined parallel algorithms</subfield><subfield code="c">by Murray Cole</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Computer Science: CSR</subfield><subfield code="v">18</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We report upon an experiment designed to investigate the extent to which a straightforward implementation of graph reduction on a message passing architecture can, given a suitably pre-distributed graph, mimic the dynamic behaviour of explicitly programmed algorithms for the same architecture. In this paper we investigate distributions which are intended to invoke pipelined behaviour."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional programming (Computer science)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: CSR</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">18</subfield><subfield code="w">(DE-604)BV008906637</subfield><subfield code="9">18</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006516377</subfield></datafield></record></collection> |
| id | DE-604.BV009841252 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:41:51Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006516377 |
| oclc_num | 32408789 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Computer Science: CSR |
| spelling | Cole, Murray Verfasser aut Graph reduction and pipelined parallel algorithms by Murray Cole Edinburgh 1991 13 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Computer Science: CSR 18 Abstract: "We report upon an experiment designed to investigate the extent to which a straightforward implementation of graph reduction on a message passing architecture can, given a suitably pre-distributed graph, mimic the dynamic behaviour of explicitly programmed algorithms for the same architecture. In this paper we investigate distributions which are intended to invoke pipelined behaviour." Computer software sigle Functional programming (Computer science) Department of Computer Science: CSR University <Edinburgh> 18 (DE-604)BV008906637 18 |
| spellingShingle | Cole, Murray Graph reduction and pipelined parallel algorithms Computer software sigle Functional programming (Computer science) |
| title | Graph reduction and pipelined parallel algorithms |
| title_auth | Graph reduction and pipelined parallel algorithms |
| title_exact_search | Graph reduction and pipelined parallel algorithms |
| title_full | Graph reduction and pipelined parallel algorithms by Murray Cole |
| title_fullStr | Graph reduction and pipelined parallel algorithms by Murray Cole |
| title_full_unstemmed | Graph reduction and pipelined parallel algorithms by Murray Cole |
| title_short | Graph reduction and pipelined parallel algorithms |
| title_sort | graph reduction and pipelined parallel algorithms |
| topic | Computer software sigle Functional programming (Computer science) |
| topic_facet | Computer software Functional programming (Computer science) |
| volume_link | (DE-604)BV008906637 |
| work_keys_str_mv | AT colemurray graphreductionandpipelinedparallelalgorithms |