Designing efficient algorithms for parallel computers:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York, NY [u.a.]
McGraw-Hill
1987
|
| Schriftenreihe: | McGraw-Hill series in supercomputing and artificial intelligence
|
| Schlagworte: | |
| Beschreibung: | XVI, 288 S. |
| ISBN: | 0070510717 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002128066 | ||
| 003 | DE-604 | ||
| 005 | 20220913 | ||
| 007 | t | ||
| 008 | 890928s1987 |||| 00||| eng d | ||
| 020 | |a 0070510717 |9 0-07-051071-7 | ||
| 035 | |a (OCoLC)247075353 | ||
| 035 | |a (DE-599)BVBBV002128066 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-739 |a DE-29T |a DE-188 |a DE-706 | ||
| 050 | 0 | |a QA76.5 | |
| 082 | 0 | |a 004/.35 |2 19 | |
| 084 | |a ST 150 |0 (DE-625)143594: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 151 |0 (DE-625)143595: |2 rvk | ||
| 084 | |a DAT 516f |2 stub | ||
| 100 | 1 | |a Quinn, Michael J. |e Verfasser |0 (DE-588)129802980 |4 aut | |
| 245 | 1 | 0 | |a Designing efficient algorithms for parallel computers |c Michael J. Quinn |
| 264 | 1 | |a New York, NY [u.a.] |b McGraw-Hill |c 1987 | |
| 300 | |a XVI, 288 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a McGraw-Hill series in supercomputing and artificial intelligence | |
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algorithmes |2 ram | |
| 650 | 4 | |a Parallélisme (Informatique) | |
| 650 | 7 | |a Parallélisme (informatique) |2 ram | |
| 650 | 7 | |a algorithme graphe |2 inriac | |
| 650 | 7 | |a algorithme numérique |2 inriac | |
| 650 | 7 | |a algorithme parallèle |2 inriac | |
| 650 | 7 | |a architecture parallèle |2 inriac | |
| 650 | 7 | |a architecture pipe-line |2 inriac | |
| 650 | 7 | |a machine parallèle |2 inriac | |
| 650 | 7 | |a parallélisme |2 inriac | |
| 650 | 7 | |a programmation en logique |2 inriac | |
| 650 | 7 | |a recherche combinatoire |2 inriac | |
| 650 | 7 | |a traitement parallèle |2 inriac | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelrechner |0 (DE-588)4173280-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Parallelrechner |0 (DE-588)4173280-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
Datensatz im Suchindex
| _version_ | 1805083502892285952 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Quinn, Michael J. |
| author_GND | (DE-588)129802980 |
| author_facet | Quinn, Michael J. |
| author_role | aut |
| author_sort | Quinn, Michael J. |
| author_variant | m j q mj mjq |
| building | Verbundindex |
| bvnumber | BV002128066 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.5 |
| callnumber-search | QA76.5 |
| callnumber-sort | QA 276.5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 150 ST 134 ST 151 |
| classification_tum | DAT 516f |
| ctrlnum | (OCoLC)247075353 (DE-599)BVBBV002128066 |
| dewey-full | 004/.35 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.35 |
| dewey-search | 004/.35 |
| dewey-sort | 14 235 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV002128066</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220913</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1987 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0070510717</subfield><subfield code="9">0-07-051071-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)247075353</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002128066</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><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 150</subfield><subfield code="0">(DE-625)143594:</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="084" ind1=" " ind2=" "><subfield code="a">ST 151</subfield><subfield code="0">(DE-625)143595:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Quinn, Michael J.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)129802980</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Designing efficient algorithms for parallel computers</subfield><subfield code="c">Michael J. Quinn</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY [u.a.]</subfield><subfield code="b">McGraw-Hill</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 288 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="0" ind2=" "><subfield code="a">McGraw-Hill series in supercomputing and artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallélisme (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallélisme (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme numérique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">architecture parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">architecture pipe-line</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">machine parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">parallélisme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation en logique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">recherche combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">traitement parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Parallelrechner</subfield><subfield code="0">(DE-588)4173280-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield></record></collection> |
| id | DE-604.BV002128066 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-20T07:49:35Z |
| institution | BVB |
| isbn | 0070510717 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001395514 |
| oclc_num | 247075353 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-739 DE-29T DE-188 DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-739 DE-29T DE-188 DE-706 |
| physical | XVI, 288 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | McGraw-Hill |
| record_format | marc |
| series2 | McGraw-Hill series in supercomputing and artificial intelligence |
| spelling | Quinn, Michael J. Verfasser (DE-588)129802980 aut Designing efficient algorithms for parallel computers Michael J. Quinn New York, NY [u.a.] McGraw-Hill 1987 XVI, 288 S. txt rdacontent n rdamedia nc rdacarrier McGraw-Hill series in supercomputing and artificial intelligence Algorithmes Algorithmes ram Parallélisme (Informatique) Parallélisme (informatique) ram algorithme graphe inriac algorithme numérique inriac algorithme parallèle inriac architecture parallèle inriac architecture pipe-line inriac machine parallèle inriac parallélisme inriac programmation en logique inriac recherche combinatoire inriac traitement parallèle inriac Computer algorithms Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Parallelrechner (DE-588)4173280-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Parallelrechner (DE-588)4173280-7 s DE-604 Parallelverarbeitung (DE-588)4075860-6 s |
| spellingShingle | Quinn, Michael J. Designing efficient algorithms for parallel computers Algorithmes Algorithmes ram Parallélisme (Informatique) Parallélisme (informatique) ram algorithme graphe inriac algorithme numérique inriac algorithme parallèle inriac architecture parallèle inriac architecture pipe-line inriac machine parallèle inriac parallélisme inriac programmation en logique inriac recherche combinatoire inriac traitement parallèle inriac Computer algorithms Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd Parallelrechner (DE-588)4173280-7 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4075860-6 (DE-588)4173280-7 (DE-588)4001183-5 |
| title | Designing efficient algorithms for parallel computers |
| title_auth | Designing efficient algorithms for parallel computers |
| title_exact_search | Designing efficient algorithms for parallel computers |
| title_full | Designing efficient algorithms for parallel computers Michael J. Quinn |
| title_fullStr | Designing efficient algorithms for parallel computers Michael J. Quinn |
| title_full_unstemmed | Designing efficient algorithms for parallel computers Michael J. Quinn |
| title_short | Designing efficient algorithms for parallel computers |
| title_sort | designing efficient algorithms for parallel computers |
| topic | Algorithmes Algorithmes ram Parallélisme (Informatique) Parallélisme (informatique) ram algorithme graphe inriac algorithme numérique inriac algorithme parallèle inriac architecture parallèle inriac architecture pipe-line inriac machine parallèle inriac parallélisme inriac programmation en logique inriac recherche combinatoire inriac traitement parallèle inriac Computer algorithms Parallel programming (Computer science) Parallelverarbeitung (DE-588)4075860-6 gnd Parallelrechner (DE-588)4173280-7 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes Parallélisme (Informatique) Parallélisme (informatique) algorithme graphe algorithme numérique algorithme parallèle architecture parallèle architecture pipe-line machine parallèle parallélisme programmation en logique recherche combinatoire traitement parallèle Computer algorithms Parallel programming (Computer science) Parallelverarbeitung Parallelrechner Algorithmus |
| work_keys_str_mv | AT quinnmichaelj designingefficientalgorithmsforparallelcomputers |