A cost analysis for a higher-order parallel programming model:
Abstract: "Programming parallel computers remains a difficult task. An ideal programming environment should enable the user to concentrate on the problem solving activity at a convenient level of abstraction, while managing the intricate low-level details without sacrificing performance. This t...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
University of Edinburgh, Dept. of Computer Science
[1996]
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Programming parallel computers remains a difficult task. An ideal programming environment should enable the user to concentrate on the problem solving activity at a convenient level of abstraction, while managing the intricate low-level details without sacrificing performance. This thesis investigates a model of parallel programming based on the Bird-Meertens Formalism (BMF). This is a set of higher-order functions, many of which are implicitly parallel. Programs are expressed in terms of functions borrowed from BMF. A parallel implementation is defined for each of these functions for a particular topology, and the associated execution costs are derived. The topologies which have been considered include the hypercube, 2-D torus, tree and the linear array. An analyser estimates the costs associated with different implementations of a given program and selects a cost-effective one for a given topology. All the analysis is performed at compile-time which has the advantage of reducing run-time overheads. The cost model's accuracy in choosing a cost-effective implementation and predicting its performance has been studied for three example programs. The main contribution of the thesis is the cost model which aims to predict realistic performances and which considers several possible parallel implementations for a given program before selecting a cost-effective one." |
| Beschreibung: | x, 195 p. ill. 21 cm |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035044947 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 080909s1996 a||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)37433961 | ||
| 035 | |a (DE-599)BVBBV035044947 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 088 | |a CST-128-96 | ||
| 100 | 1 | |a Rangaswami, Roopa |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A cost analysis for a higher-order parallel programming model |c Roopa Rangaswami |
| 264 | 1 | |a Edinburgh |b University of Edinburgh, Dept. of Computer Science |c [1996] | |
| 300 | |a x, 195 p. |b ill. |c 21 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Thesis (Ph. D.)--University of Edinburgh, 1996 | ||
| 520 | |a Abstract: "Programming parallel computers remains a difficult task. An ideal programming environment should enable the user to concentrate on the problem solving activity at a convenient level of abstraction, while managing the intricate low-level details without sacrificing performance. This thesis investigates a model of parallel programming based on the Bird-Meertens Formalism (BMF). This is a set of higher-order functions, many of which are implicitly parallel. Programs are expressed in terms of functions borrowed from BMF. A parallel implementation is defined for each of these functions for a particular topology, and the associated execution costs are derived. The topologies which have been considered include the hypercube, 2-D torus, tree and the linear array. An analyser estimates the costs associated with different implementations of a given program and selects a cost-effective one for a given topology. All the analysis is performed at compile-time which has the advantage of reducing run-time overheads. The cost model's accuracy in choosing a cost-effective implementation and predicting its performance has been studied for three example programs. The main contribution of the thesis is the cost model which aims to predict realistic performances and which considers several possible parallel implementations for a given program before selecting a cost-effective one." | ||
| 650 | 4 | |a Parallel programming (Computer science) / Mathematical models | |
| 650 | 4 | |a Mathematisches Modell | |
| 650 | 4 | |a Parallel programming (Computer science) |x Mathematical models | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016713722 | ||
Datensatz im Suchindex
| _version_ | 1804137981396647936 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Rangaswami, Roopa |
| author_facet | Rangaswami, Roopa |
| author_role | aut |
| author_sort | Rangaswami, Roopa |
| author_variant | r r rr |
| building | Verbundindex |
| bvnumber | BV035044947 |
| ctrlnum | (OCoLC)37433961 (DE-599)BVBBV035044947 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02491nam a2200325 c 4500</leader><controlfield tag="001">BV035044947</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080909s1996 a||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37433961</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035044947</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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">CST-128-96</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rangaswami, Roopa</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A cost analysis for a higher-order parallel programming model</subfield><subfield code="c">Roopa Rangaswami</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="b">University of Edinburgh, Dept. of Computer Science</subfield><subfield code="c">[1996]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">x, 195 p.</subfield><subfield code="b">ill.</subfield><subfield code="c">21 cm</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="502" ind1=" " ind2=" "><subfield code="a">Thesis (Ph. D.)--University of Edinburgh, 1996</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract: "Programming parallel computers remains a difficult task. An ideal programming environment should enable the user to concentrate on the problem solving activity at a convenient level of abstraction, while managing the intricate low-level details without sacrificing performance. This thesis investigates a model of parallel programming based on the Bird-Meertens Formalism (BMF). This is a set of higher-order functions, many of which are implicitly parallel. Programs are expressed in terms of functions borrowed from BMF. A parallel implementation is defined for each of these functions for a particular topology, and the associated execution costs are derived. The topologies which have been considered include the hypercube, 2-D torus, tree and the linear array. An analyser estimates the costs associated with different implementations of a given program and selects a cost-effective one for a given topology. All the analysis is performed at compile-time which has the advantage of reducing run-time overheads. The cost model's accuracy in choosing a cost-effective implementation and predicting its performance has been studied for three example programs. The main contribution of the thesis is the cost model which aims to predict realistic performances and which considers several possible parallel implementations for a given program before selecting a cost-effective one."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science) / Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematisches Modell</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016713722</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV035044947 |
| illustrated | Illustrated |
| index_date | 2024-07-02T21:54:26Z |
| indexdate | 2024-07-09T21:20:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016713722 |
| oclc_num | 37433961 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | x, 195 p. ill. 21 cm |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | University of Edinburgh, Dept. of Computer Science |
| record_format | marc |
| spelling | Rangaswami, Roopa Verfasser aut A cost analysis for a higher-order parallel programming model Roopa Rangaswami Edinburgh University of Edinburgh, Dept. of Computer Science [1996] x, 195 p. ill. 21 cm txt rdacontent n rdamedia nc rdacarrier Thesis (Ph. D.)--University of Edinburgh, 1996 Abstract: "Programming parallel computers remains a difficult task. An ideal programming environment should enable the user to concentrate on the problem solving activity at a convenient level of abstraction, while managing the intricate low-level details without sacrificing performance. This thesis investigates a model of parallel programming based on the Bird-Meertens Formalism (BMF). This is a set of higher-order functions, many of which are implicitly parallel. Programs are expressed in terms of functions borrowed from BMF. A parallel implementation is defined for each of these functions for a particular topology, and the associated execution costs are derived. The topologies which have been considered include the hypercube, 2-D torus, tree and the linear array. An analyser estimates the costs associated with different implementations of a given program and selects a cost-effective one for a given topology. All the analysis is performed at compile-time which has the advantage of reducing run-time overheads. The cost model's accuracy in choosing a cost-effective implementation and predicting its performance has been studied for three example programs. The main contribution of the thesis is the cost model which aims to predict realistic performances and which considers several possible parallel implementations for a given program before selecting a cost-effective one." Parallel programming (Computer science) / Mathematical models Mathematisches Modell Parallel programming (Computer science) Mathematical models (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Rangaswami, Roopa A cost analysis for a higher-order parallel programming model Parallel programming (Computer science) / Mathematical models Mathematisches Modell Parallel programming (Computer science) Mathematical models |
| subject_GND | (DE-588)4113937-9 |
| title | A cost analysis for a higher-order parallel programming model |
| title_auth | A cost analysis for a higher-order parallel programming model |
| title_exact_search | A cost analysis for a higher-order parallel programming model |
| title_exact_search_txtP | A cost analysis for a higher-order parallel programming model |
| title_full | A cost analysis for a higher-order parallel programming model Roopa Rangaswami |
| title_fullStr | A cost analysis for a higher-order parallel programming model Roopa Rangaswami |
| title_full_unstemmed | A cost analysis for a higher-order parallel programming model Roopa Rangaswami |
| title_short | A cost analysis for a higher-order parallel programming model |
| title_sort | a cost analysis for a higher order parallel programming model |
| topic | Parallel programming (Computer science) / Mathematical models Mathematisches Modell Parallel programming (Computer science) Mathematical models |
| topic_facet | Parallel programming (Computer science) / Mathematical models Mathematisches Modell Parallel programming (Computer science) Mathematical models Hochschulschrift |
| work_keys_str_mv | AT rangaswamiroopa acostanalysisforahigherorderparallelprogrammingmodel |