Algorithms sequential and parallel: a unified approach
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Hingham, Mass.
Charles River Media
2005
|
| Edition: | 2. ed. |
| Series: | Computer engineering series
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XVIII, 382 S. graph. Darst. |
| ISBN: | 1584504129 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV024603818 | ||
| 003 | DE-604 | ||
| 005 | 20100430 | ||
| 007 | t | ||
| 008 | 090924s2005 d||| |||| 00||| eng d | ||
| 020 | |a 1584504129 |9 1-584-50412-9 | ||
| 035 | |a (OCoLC)253727895 | ||
| 035 | |a (DE-599)BVBBV024603818 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-355 | ||
| 082 | 0 | |a 005.11 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Miller, Russ |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms sequential and parallel |b a unified approach |c Russ Miller ; Laurence Boxer |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Hingham, Mass. |b Charles River Media |c 2005 | |
| 300 | |a XVIII, 382 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Computer engineering series | |
| 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 Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Paralleler Algorithmus |0 (DE-588)4193615-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Boxer, Laurence |e Verfasser |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Regensburg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018576976&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018576976 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804140618824286208 |
|---|---|
| adam_text | Contents
Preface
xv
1
Asymptotic Analysis
2
Notation and Terminology
4
Asymptotic Notation
6
More Notation
9
Asymptotic Relationships
11
Asymptotic Analysis and Limits
12
Summations and Integrals
14
Rules for Analysis of Algorithms
21
Limitations of Asymptotic Analysis
27
Common Terminology
29
Summary
29
Chapter Notes
30
Exercises
30
2
Induction and Recursion
34
Mathematical Induction
36
Induction Examples
37
Recursion
40
Binary Search
43
Merging and Mergesort
47
Summary
54
Chapter Notes
54
Exercises
54
vii
viii
Contents
3
The Master Method
58
Master Theorem
61
Proof of the Master Theorem (optional)
61
The General Case
66
Summary
73
Chapter Notes
73
Exercises
73
4
Combinational Circuits
74
Combinational Circuits and Sorting Networks
76
Sorting Networks
76
Bitonic Merge
80
BitonicSort
84
Summary
87
Chapter Notes
88
Exercises
88
5
Models of Computation
90
RAM (Random Access Machine)
92
PRAM (Parallel Random Access Machine)
94
Examples: Simple Algorithms
98
Fundamental Terminology
106
Distributed Memory versus Shared Memory
107
Distributed Address Space versus Shared Address Space
108
Interconnection Networks
108
Processor Organizations
109
Linear Array
110
Ring
118
Mesh
119
Tree
123
Pyramid
125
Mesh-of-trees
127
Hypercube
131
Contents ix
Coarse-Grained Parallel Computers 136
Additional Terminology
139
Summary
142
Chapter Notes
142
Exercises
143
6
Matrix Operations
146
Matrix Multiplication
148
Gaussian Elimination
153
Roundoff Error
160
Summary
161
Chapter Notes
161
Exercises
161
7
Parallel Prefix
164
Parallel Prefix
166
Parallel Algorithms
167
Parallel Prefix on the PRAM
167
Mesh
171
Hypercube
174
Analysis
176
Coarse-Grained Multicomputer
176
Application: Maximum Sum Subsequence
176
RAM
176
PRAM
177
Mesh
179
Array Packing
179
RAM
180
PRAM
181
Network Models
181
Interval (Segment) Broadcasting
182
Solution Strategy
182
Analysis
183
Contents
(Simple) Point
Domination
Query 1
83
RAM 185
PRAM
and Network Models 185
Computing
Overlapping Line
Segments 185
RAM 186
PRAM
187
Mesh
188
Maximal
Overlapping
Point 188
Analysis
188
Summary
189
Chapter
Notes 189
Exercises
189
8
Pointer Jumping
192
List Ranking
194
Linked List Parallel Prefix
196
Summary
197
Chapter Notes
198
Exercises
198
9
Divide-and-Conquer
200
MergeSort (Revisited)
202
RAM
202
Linear Array
203
Selection
205
RAM
206
Analysis of Running Time
209
Parallel Machines
210
Quicksort (Partition Sort)
211
Array Implementation
216
Analysis of Quicksort
221
Expected-Case Analysis of Quicksort
223
Improving Quicksort
226
Contents xi
Modifications of Quicksort for Parallel Models
228
HyperQuickSort
228
BitonicSort (Revisited)
229
BitonicSort on a Mesh
230
Sorting Data with Respect to Other
Orderings
234
Concurrent Read/Write
235
Implementation of a Concurrent Read
236
Implementation of Concurrent Write (overview)
237
Concurrent Read/Write on a Mesh
238
Summary
238
Chapter Notes
238
Exercises
239
10
Computational Geometry
242
Convex Hull
244
Graham s Scan
246
Jarvis March
250
Divide-and-Conquer Solution
251
Smallest Enclosing Box
260
RAM
261
PRAM
261
Mesh
261
All-Nearest Neighbor Problem
262
Running Time
264
Architecture-Independent Algorithm Development
264
Line Intersection Problems
265
Overlapping Line Segments
266
Summary
270
Chapter Notes
270
Exercises
272
11
Image Processing
276
Preliminaries
278
xii
Contents
Component
Labeling
280
RAM
280
Mesh
281
Convex Hull
285
Running Time
287
Distance Problems
288
All-Nearest Neighbor between Labeled Sets
288
Running Time
289
Minimum Internal Distance within Connected Components
290
Hausdorff Metric for Digital Images
293
Summary
296
Chapter Notes
296
Exercises
297
12
Graph Algorithms
300
Terminology
303
Representations
306
Adjacency Lists
307
Adjacency Matrix
308
Unordered Edges
309
Fundamental Algorithms
309
Breadth-First Search
309
Depth-First Search
313
Discussion of Depth-First and Breadth-First Search
315
Fundamental PRAM Graph Techniques
316
List Ranking via Pointer Jumping
316
Euler Tour
Technique
318
Tree Contraction
318
Computing the Transitive Closure of an Adjacency Matrix
323
Connected Component Labeling
325
RAM
325
PRAM
325
Mesh
330
Contents xiii
Minimum-Cost Spanning Trees
330
RAM
330
PRAM
334
Mesh
336
Shortest-Path Problems
339
RAM
339
PRAM and Mesh
342
Summary
343
Chapter Notes
344
Exercises
345
13
Numerical Problems
350
Primality
352
Greatest Common Divisor
354
Lamé s
Theorem
355
Integral Powers
355
Evaluating a Polynomial
357
Approximation by Taylor Series
359
Trapezoidal Integration
362
Summary
365
Chapter Notes
365
Exercises
366
Bibliography
368
Index
373
|
| any_adam_object | 1 |
| author | Miller, Russ Boxer, Laurence |
| author_facet | Miller, Russ Boxer, Laurence |
| author_role | aut aut |
| author_sort | Miller, Russ |
| author_variant | r m rm l b lb |
| building | Verbundindex |
| bvnumber | BV024603818 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)253727895 (DE-599)BVBBV024603818 |
| dewey-full | 005.11 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.11 |
| dewey-search | 005.11 |
| dewey-sort | 15.11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01556nam a2200397 c 4500</leader><controlfield tag="001">BV024603818</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100430 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090924s2005 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1584504129</subfield><subfield code="9">1-584-50412-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)253727895</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024603818</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-83</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.11</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">Miller, Russ</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms sequential and parallel</subfield><subfield code="b">a unified approach</subfield><subfield code="c">Russ Miller ; Laurence Boxer</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hingham, Mass.</subfield><subfield code="b">Charles River Media</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 382 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="490" ind1="0" ind2=" "><subfield code="a">Computer engineering series</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">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">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="700" ind1="1" ind2=" "><subfield code="a">Boxer, Laurence</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Regensburg</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=018576976&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-018576976</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></record></collection> |
| id | DE-604.BV024603818 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:02:51Z |
| institution | BVB |
| isbn | 1584504129 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018576976 |
| oclc_num | 253727895 |
| open_access_boolean | |
| owner | DE-83 DE-355 DE-BY-UBR |
| owner_facet | DE-83 DE-355 DE-BY-UBR |
| physical | XVIII, 382 S. graph. Darst. |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Charles River Media |
| record_format | marc |
| series2 | Computer engineering series |
| spelling | Miller, Russ Verfasser aut Algorithms sequential and parallel a unified approach Russ Miller ; Laurence Boxer 2. ed. Hingham, Mass. Charles River Media 2005 XVIII, 382 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer engineering series Paralleler Algorithmus (DE-588)4193615-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Paralleler Algorithmus (DE-588)4193615-2 s 1\p DE-604 Boxer, Laurence Verfasser aut Digitalisierung UB Regensburg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018576976&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 |
| spellingShingle | Miller, Russ Boxer, Laurence Algorithms sequential and parallel a unified approach Paralleler Algorithmus (DE-588)4193615-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4193615-2 (DE-588)4001183-5 |
| title | Algorithms sequential and parallel a unified approach |
| title_auth | Algorithms sequential and parallel a unified approach |
| title_exact_search | Algorithms sequential and parallel a unified approach |
| title_full | Algorithms sequential and parallel a unified approach Russ Miller ; Laurence Boxer |
| title_fullStr | Algorithms sequential and parallel a unified approach Russ Miller ; Laurence Boxer |
| title_full_unstemmed | Algorithms sequential and parallel a unified approach Russ Miller ; Laurence Boxer |
| title_short | Algorithms sequential and parallel |
| title_sort | algorithms sequential and parallel a unified approach |
| title_sub | a unified approach |
| topic | Paralleler Algorithmus (DE-588)4193615-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Paralleler Algorithmus Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018576976&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT millerruss algorithmssequentialandparallelaunifiedapproach AT boxerlaurence algorithmssequentialandparallelaunifiedapproach |