An introduction to parallel algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston ; Munich [u.a.]
Addison-Wesley
2001
|
| Ausgabe: | 4. printing |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | X, 566 S. graph. Darst. |
| ISBN: | 0201548569 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV017561573 | ||
| 003 | DE-604 | ||
| 005 | 20130531 | ||
| 007 | t | ||
| 008 | 031008s2001 d||| |||| 00||| eng d | ||
| 020 | |a 0201548569 |9 0-201-54856-9 | ||
| 035 | |a (OCoLC)316031979 | ||
| 035 | |a (DE-599)BVBBV017561573 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-473 |a DE-384 | ||
| 050 | 0 | |a QA76.58 | |
| 082 | 0 | |a 004/.35 |2 20 | |
| 082 | 0 | |a 004/.35 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 151 |0 (DE-625)143595: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 084 | |a DAT 516f |2 stub | ||
| 100 | 1 | |a JáJá, Joseph |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An introduction to parallel algorithms |c Joseph JáJá |
| 250 | |a 4. printing | ||
| 264 | 1 | |a Boston ; Munich [u.a.] |b Addison-Wesley |c 2001 | |
| 300 | |a X, 566 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Parallelprogrammering |2 gtt | |
| 650 | 4 | |a Parallélisme (Informatique) | |
| 650 | 4 | |a Parallel algorithms | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010570212&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-010570212 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804130333703012352 |
|---|---|
| adam_text | CONTENTS
PREFACE
iii
1
INTRODUCTION
1
1.1
Parallel Processing
2
1.2
Background
4
1.3
Parallel Models
6
1.4
Performance of Parallel Algorithms
26
1.5
The Work-Time Presentation Framework of Parallel
Algorithms
27
1.6
The Optimality Notion
32
1.7
Communication Complexity
33
1.8
Summary
35
Exercises
36
Bibliographic Notes
40
References
40
2
BASIC TECHNIQUES
43
2.1
Balanced Trees
43
2.2
Pointer Jumping
52
2.3
Divide and Conquer
56
2.4
Partitioning
61
2.5
Pipelining
65
2.6
Accelerated Cascading
71
VII
viii Contents
2.7
Symmetry Breaking
75
2.8
Summary
80
Exercises
82
Bibliographic Notes
88
References
88
3
LISTS AND TREES
91
3.1
List Ranking
92
3.2
The Euler-Tour Technique
108
3.3
Tree Contraction
118
3.4
Lowest Common Ancestors
128
3.5
Summary
136
Exercises
136
Bibliographic Notes
143
References
143
4
SEARCHING, MERGING, AND SORTING
145
4.1
Searching
146
4.2
Merging
148
4.3
Sorting
157
4.4
Sorting Networks
173
4.5
Selection
181
4.6
*Lower Bounds for Comparison Problems
184
4.7
Summary
192
Exercises
193
Bibliographic Notes
200
References
202
5
GRAPHS
203
5.1
Connected Components
204
5.2
Minimum Spanning Trees
222
5.3
Biconnected Components
227
5.4
Ear Decomposition
240
5.5
Directed Graphs
246
5.6
Summary
252
Exercises
253
Bibliographic Notes
259
References
260
6
PLANAR GEOMETRY
263
6.1
The Convex-Hull Problem Revisited
264
6.2
Intersections of Convex Sets
272
6.3
Plane Sweeoinn
279
Contents
ix
6.4
Visibility Problems
285
6.5
Dominance Counting
291
6.6
Summary
299
Exercises
300
Bibliographic Notes
307
References
308
STRINGS
311
7.1
Preliminary Facts About Strings
312
7.2
String Matching
318
7.3
Text Analysis
319
7.4
Pattern Analysis
327
7.5
Suffix Trees
339
7.6
Applications of Suffix Trees
352
7.7
Summary
355
Exercises
357
Bibliographic Notes
363
References
364
ARITHMETIC COMPUTATIONS
367
8.1
Linear Recurrences
368
8.2
Triangular Linear Systems
375
8.3
The Discrete Fourier Transform
379
8.4
Polynomial Multiplication and Convolution
386
8.5
Toeplitz Matrices
389
8.6
Polynomial Division
394
8.7
Polynomial Evaluation and Interpolation
397
8.8
General Dense Matrices
403
8.9
*
Dense Structured Matrices
410
8.10
Summary
419
Exercises
421
Bibliographic Notes
429
References
430
RANDOMIZED ALGORITHMS
433
9.1
Performance Measures of Randomized Parallel
Algorithms
434
9.2
The Problem of the Fractional Independent Set
441
9.3
Point Location in Triangulated Planar Subdivisions
445
9.4
Pattern Matching
450
9.5
Verification of Polynomial Identities
460
9.6
Sorting
464
9.7
Maximum Matching
473
Contents
9.8
Summary
485
Exercises
485
Bibliographic Notes
490
References
491
10
♦LIMITATIONS OF PRAMS
495
10.1
Simulations Between PRAM Models
496
10.2
Lower Bounds for the CREW PRAM
502
10.3
Lower Bounds for the EREW PRAM
508
10.4
Lower Bounds for the CRCW PRAM
512
10.5
Introduction to P-Completeness
529
10.6
Summary
553
Exercises
554
Bibliographic Notes
558
References
559
INDEX
563
|
| any_adam_object | 1 |
| author | JáJá, Joseph |
| author_facet | JáJá, Joseph |
| author_role | aut |
| author_sort | JáJá, Joseph |
| author_variant | j j jj |
| building | Verbundindex |
| bvnumber | BV017561573 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.58 |
| callnumber-search | QA76.58 |
| callnumber-sort | QA 276.58 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 151 ST 230 |
| classification_tum | DAT 516f |
| ctrlnum | (OCoLC)316031979 (DE-599)BVBBV017561573 |
| 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 |
| edition | 4. printing |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02101nam a2200553zc 4500</leader><controlfield tag="001">BV017561573</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130531 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">031008s2001 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0201548569</subfield><subfield code="9">0-201-54856-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)316031979</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017561573</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-703</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.58</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35</subfield><subfield code="2">20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.35</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 151</subfield><subfield code="0">(DE-625)143595:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</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">JáJá, Joseph</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An introduction to parallel algorithms</subfield><subfield code="c">Joseph JáJá</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">4. printing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Munich [u.a.]</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 566 S.</subfield><subfield code="b">graph. Darst.</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="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallelprogrammering</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallélisme (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel algorithms</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">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">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="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">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="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010570212&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010570212</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="883" ind1="1" ind2=" "><subfield code="8">2\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></record></collection> |
| id | DE-604.BV017561573 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T19:19:22Z |
| institution | BVB |
| isbn | 0201548569 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010570212 |
| oclc_num | 316031979 |
| open_access_boolean | |
| owner | DE-703 DE-473 DE-BY-UBG DE-384 |
| owner_facet | DE-703 DE-473 DE-BY-UBG DE-384 |
| physical | X, 566 S. graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Addison-Wesley |
| record_format | marc |
| spelling | JáJá, Joseph Verfasser aut An introduction to parallel algorithms Joseph JáJá 4. printing Boston ; Munich [u.a.] Addison-Wesley 2001 X, 566 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Algorithmes Parallelprogrammering gtt Parallélisme (Informatique) Parallel algorithms Parallel processing (Electronic computers) Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Paralleler Algorithmus (DE-588)4193615-2 s DE-604 Algorithmus (DE-588)4001183-5 s 1\p DE-604 Parallelverarbeitung (DE-588)4075860-6 s 2\p DE-604 Digitalisierung UB Bamberg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010570212&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | JáJá, Joseph An introduction to parallel algorithms Algorithmes Parallelprogrammering gtt Parallélisme (Informatique) Parallel algorithms Parallel processing (Electronic computers) Parallelverarbeitung (DE-588)4075860-6 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4075860-6 (DE-588)4193615-2 (DE-588)4001183-5 |
| title | An introduction to parallel algorithms |
| title_auth | An introduction to parallel algorithms |
| title_exact_search | An introduction to parallel algorithms |
| title_full | An introduction to parallel algorithms Joseph JáJá |
| title_fullStr | An introduction to parallel algorithms Joseph JáJá |
| title_full_unstemmed | An introduction to parallel algorithms Joseph JáJá |
| title_short | An introduction to parallel algorithms |
| title_sort | an introduction to parallel algorithms |
| topic | Algorithmes Parallelprogrammering gtt Parallélisme (Informatique) Parallel algorithms Parallel processing (Electronic computers) Parallelverarbeitung (DE-588)4075860-6 gnd Paralleler Algorithmus (DE-588)4193615-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmes Parallelprogrammering Parallélisme (Informatique) Parallel algorithms Parallel processing (Electronic computers) Parallelverarbeitung Paralleler Algorithmus Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010570212&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT jajajoseph anintroductiontoparallelalgorithms |