Mathematical foundations of parallel computing:
Parallel implementation of algorithms involves many difficult problems. In particular among them are round-off analysis, the way to convert sequential programs and algorithms into the parallel mode, the choice of appropriate or optimal computer architect and so on. To solve these problems, it is nec...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Singapore
World Scientific Pub. Co.
c1992
|
Schriftenreihe: | World Scientific series in computer science
v. 33 |
Schlagworte: | |
Online-Zugang: | FHN01 Volltext |
Zusammenfassung: | Parallel implementation of algorithms involves many difficult problems. In particular among them are round-off analysis, the way to convert sequential programs and algorithms into the parallel mode, the choice of appropriate or optimal computer architect and so on. To solve these problems, it is necessary to know very well the structure of algorithms. This book deal with the mathematical mechanism that permits us to investigate structures of both sequential and parallel algorithms. This mechanism allows us to recognize and explain the relations between different methods of constructing parallel algorithms, the methods of analysing round-off errors, the methods of optimizing memory traffic, the methods of working out the fastest implementation for a given parallel computer and other methods attending the joint investigation of algorithms and computers |
Beschreibung: | xix, 343 p. ill |
ISBN: | 9789814360043 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV044638619 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 171120s1992 |||| o||u| ||||||eng d | ||
020 | |a 9789814360043 |c electronic bk. |9 978-981-4360-04-3 | ||
024 | 7 | |a 10.1142/1533 |2 doi | |
035 | |a (ZDB-124-WOP)00005308 | ||
035 | |a (OCoLC)1012624621 | ||
035 | |a (DE-599)BVBBV044638619 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-92 | ||
082 | 0 | |a 511.8 |2 22 | |
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
100 | 1 | |a Voevodin, V. V. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Mathematical foundations of parallel computing |c Valentin V. Voevodin |
264 | 1 | |a Singapore |b World Scientific Pub. Co. |c c1992 | |
300 | |a xix, 343 p. |b ill | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a World Scientific series in computer science |v v. 33 | |
520 | |a Parallel implementation of algorithms involves many difficult problems. In particular among them are round-off analysis, the way to convert sequential programs and algorithms into the parallel mode, the choice of appropriate or optimal computer architect and so on. To solve these problems, it is necessary to know very well the structure of algorithms. This book deal with the mathematical mechanism that permits us to investigate structures of both sequential and parallel algorithms. This mechanism allows us to recognize and explain the relations between different methods of constructing parallel algorithms, the methods of analysing round-off errors, the methods of optimizing memory traffic, the methods of working out the fastest implementation for a given parallel computer and other methods attending the joint investigation of algorithms and computers | ||
650 | 4 | |a Parallel processing (Electronic computers) | |
650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9810208200 |
856 | 4 | 0 | |u http://www.worldscientific.com/worldscibooks/10.1142/1533#t=toc |x Verlag |z URL des Erstveroeffentlichers |3 Volltext |
912 | |a ZDB-124-WOP | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-030036593 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u http://www.worldscientific.com/worldscibooks/10.1142/1533#t=toc |l FHN01 |p ZDB-124-WOP |q FHN_PDA_WOP |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804178055463174144 |
---|---|
any_adam_object | |
author | Voevodin, V. V. |
author_facet | Voevodin, V. V. |
author_role | aut |
author_sort | Voevodin, V. V. |
author_variant | v v v vv vvv |
building | Verbundindex |
bvnumber | BV044638619 |
classification_rvk | ST 130 ST 134 |
collection | ZDB-124-WOP |
ctrlnum | (ZDB-124-WOP)00005308 (OCoLC)1012624621 (DE-599)BVBBV044638619 |
dewey-full | 511.8 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.8 |
dewey-search | 511.8 |
dewey-sort | 3511.8 |
dewey-tens | 510 - Mathematics |
discipline | Informatik Mathematik |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02553nmm a2200445zcb4500</leader><controlfield tag="001">BV044638619</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">171120s1992 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814360043</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-981-4360-04-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1142/1533</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-124-WOP)00005308</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1012624621</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044638619</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.8</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Voevodin, V. V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mathematical foundations of parallel computing</subfield><subfield code="c">Valentin V. Voevodin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">World Scientific Pub. Co.</subfield><subfield code="c">c1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xix, 343 p.</subfield><subfield code="b">ill</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">World Scientific series in computer science</subfield><subfield code="v">v. 33</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Parallel implementation of algorithms involves many difficult problems. In particular among them are round-off analysis, the way to convert sequential programs and algorithms into the parallel mode, the choice of appropriate or optimal computer architect and so on. To solve these problems, it is necessary to know very well the structure of algorithms. This book deal with the mathematical mechanism that permits us to investigate structures of both sequential and parallel algorithms. This mechanism allows us to recognize and explain the relations between different methods of constructing parallel algorithms, the methods of analysing round-off errors, the methods of optimizing memory traffic, the methods of working out the fastest implementation for a given parallel computer and other methods attending the joint investigation of algorithms and computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Paralleler Algorithmus</subfield><subfield code="0">(DE-588)4193615-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9810208200</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/1533#t=toc</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveroeffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-124-WOP</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030036593</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/1533#t=toc</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-124-WOP</subfield><subfield code="q">FHN_PDA_WOP</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV044638619 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:57:53Z |
institution | BVB |
isbn | 9789814360043 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030036593 |
oclc_num | 1012624621 |
open_access_boolean | |
owner | DE-92 |
owner_facet | DE-92 |
physical | xix, 343 p. ill |
psigel | ZDB-124-WOP ZDB-124-WOP FHN_PDA_WOP |
publishDate | 1992 |
publishDateSearch | 1992 |
publishDateSort | 1992 |
publisher | World Scientific Pub. Co. |
record_format | marc |
series2 | World Scientific series in computer science |
spelling | Voevodin, V. V. Verfasser aut Mathematical foundations of parallel computing Valentin V. Voevodin Singapore World Scientific Pub. Co. c1992 xix, 343 p. ill txt rdacontent c rdamedia cr rdacarrier World Scientific series in computer science v. 33 Parallel implementation of algorithms involves many difficult problems. In particular among them are round-off analysis, the way to convert sequential programs and algorithms into the parallel mode, the choice of appropriate or optimal computer architect and so on. To solve these problems, it is necessary to know very well the structure of algorithms. This book deal with the mathematical mechanism that permits us to investigate structures of both sequential and parallel algorithms. This mechanism allows us to recognize and explain the relations between different methods of constructing parallel algorithms, the methods of analysing round-off errors, the methods of optimizing memory traffic, the methods of working out the fastest implementation for a given parallel computer and other methods attending the joint investigation of algorithms and computers Parallel processing (Electronic computers) Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 s 1\p DE-604 Erscheint auch als Druck-Ausgabe 9810208200 http://www.worldscientific.com/worldscibooks/10.1142/1533#t=toc Verlag URL des Erstveroeffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Voevodin, V. V. Mathematical foundations of parallel computing Parallel processing (Electronic computers) Paralleler Algorithmus (DE-588)4193615-2 gnd |
subject_GND | (DE-588)4193615-2 |
title | Mathematical foundations of parallel computing |
title_auth | Mathematical foundations of parallel computing |
title_exact_search | Mathematical foundations of parallel computing |
title_full | Mathematical foundations of parallel computing Valentin V. Voevodin |
title_fullStr | Mathematical foundations of parallel computing Valentin V. Voevodin |
title_full_unstemmed | Mathematical foundations of parallel computing Valentin V. Voevodin |
title_short | Mathematical foundations of parallel computing |
title_sort | mathematical foundations of parallel computing |
topic | Parallel processing (Electronic computers) Paralleler Algorithmus (DE-588)4193615-2 gnd |
topic_facet | Parallel processing (Electronic computers) Paralleler Algorithmus |
url | http://www.worldscientific.com/worldscibooks/10.1142/1533#t=toc |
work_keys_str_mv | AT voevodinvv mathematicalfoundationsofparallelcomputing |