Hypercube Algorithms (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
237
Utgivningsdatum
2011-12-14
Upplaga
Softcover reprint of the original 1st ed. 1990
Förlag
Springer-Verlag New York Inc.
Medarbetare
Sahni, Sartaj
Illustrationer
IX, 237 p.
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9781461396949
Hypercube Algorithms (häftad)

Hypercube Algorithms

with Applications to Image Processing and Pattern Recognition

Häftad Engelska, 2011-12-14
1059
Skickas inom 5-8 vardagar.
Fri frakt inom Sverige för privatpersoner.
Finns även som
  • Laddas ned direkt
    949
  • Skickas inom 11-20 vardagar (specialorder)
    539
Visa alla 2 format & utgåvor
Fundamentals algorithms for SIMD and MIMD hypercubes are developed. These include algorithms for such problems as data broadcasting, data sum, prefix sum, shift, data circulation, data accumulation, sorting, random access reads and writes and data permutation. The fundamental algorithms are then used to obtain efficient hypercube algorithms for matrix multiplication, image processing problems such as convolution, template matching, hough transform, clustering and image processing transformation, and string editing. Most of the algorithms in this book are for hypercubes with the number of processors being a function of problems size. However, for image processing problems, the book also includes algorithms for and MIMD hypercube with a small number of processes. Experimental results on an NCUBE/77 MIMD hypercube are also presented. The book is suitable for use in a one-semester or one-quarter course on hypercube algorithms. For students with no prior exposure to parallel algorithms, it is recommended that one week will be spent on the material in chapter 1, about six weeks on chapter 2 and one week on chapter 3. The remainder of the term can be spent covering topics from the rest of the book.
Visa hela texten

Passar bra ihop

  1. Hypercube Algorithms
  2. +
  3. Computing and Combinatorics

De som köpt den här boken har ofta också köpt Computing and Combinatorics av My T Thai, Sartaj Sahni (häftad).

Köp båda 2 för 2308 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Bloggat om Hypercube Algorithms

Innehållsförteckning

1 Introduction.- 1.1 Parallel Architectures.- 1.2 Embedding In A Hypercube.- 1.3 Performance Measures.- 2 Fundamental Operations.- 2.1 Data Broadcasting.- 2.2 Window Broadcast.- 2.3 Data Sum.- 2.4 Prefix Sum.- 2.5 Shift.- 2.6 Data Circulation.- 2.7 Even, Odd, And All Shifts.- 2.8 Consecutive Sum.- 2.9 Adjacent Sum.- 2.10 Data Accumulation.- 2.11 Rank.- 2.12 Concentrate.- 2.13 Distribute.- 2.14 Generalize.- 2.15 Sorting.- 2.16 Random Access Read.- 2.17 Random Access Write.- 2.18 BPC Permutations.- 2.19 Summary.- 3 SIMD Matrix Multiplication.- 3.1 n3 Processors.- 3.2 n2 Processors.- 3.3 n2r, 1? r ? n Processors.- 3.4 r2, 1? r ? n Processors.- 3.5 Summary.- 4 One Dimensional Convolution.- 4.1 The Problem.- 4.2 O(M) Memory Algorithms.- 4.3 O(1) Memory MIMD Algorithm.- 4.4 O(l) Memory SIMD Algorithm.- 5 Template Matching.- 5.1 The Problem.- 5.2 General Square Templates.- 5.3 Kirsch Motivated Templates.- 5.4 Medium Grain Template Matching.- 6 Hough Transform.- 6.1 Introduction.- 6.2 MIMD Algorithm.- 6.3 SIMD Algorithms.- 6.4 NCUBE Algorithms.- 7 Clustering.- 7.1 Introduction.- 7.2 NM Processor Algorithms.- 7.3 Clustering On An NCUBE Hypercube.- 8 Image Transformations.- 8.1 Introduction.- 8.2 Shrinking and Expanding.- 8.3 Translation.- 8.4 Rotation.- 8.5 Scaling.- 9 SIMD String Editing.- 9.1 Introduction.- 9.2 Dynamic Programming Formulation.- 9.3 Shared Memory Parallel Algorithm.- 9.4 SIMD Hypercube Mapping.- References.