Introduction to parallel algorithms and architectures : arrays, trees, hypercubes /

Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes provides an introduction to the expanding field of parallel algorithms and architectures. This book focuses on parallel computation involving the most popular network architectures, namely, arrays, trees, hypercubes, and...

Description complète

Détails bibliographiques
Cote:Libro Electrónico
Auteur principal: Leighton, Frank Thomson
Format: Électronique eBook
Langue:Inglés
Publié: San Mateo, Calif. : M. Kaufmann Publishers, �1992.
Sujets:
Parallel algorithms.
Parallel processing (Electronic computers)
Parallel programming (Computer science)
Parall�elisme (Informatique)
Programmation parall�ele (Informatique)
Algorithmes parall�eles.
COMPUTERS > Computer Literacy.
COMPUTERS > Computer Science.
COMPUTERS > Data Processing.
COMPUTERS > Hardware > General.
COMPUTERS > Information Technology.
COMPUTERS > Machine Theory.
COMPUTERS > Reference.
Parallel algorithms
Rechnerorganisation
Paralleler Algorithmus
Parallelrechner
Parallelprogrammering.
Computerarchitectuur.
Accès en ligne:Texto completo
Table des matières:
  • Elementary sorting and counting
  • Integer arithmetic
  • Matrix algorithms
  • Retiming and systolic conversion
  • Graph algorithms
  • Sorting revisited
  • Packet routing
  • Image analysis and computational geometry
  • Higher-dimensional arrays
  • The two-dimensional mesh of trees
  • Elementary O(log N)-step algorithms
  • Integer arithmetic
  • Matrix algorithms
  • Graph algorithms
  • Fast evaluation of straight-line code
  • Higher-dimensional meshes of trees
  • The hypercube
  • The butterfly, cube-connected-cycles, and Bene�s network
  • The shuffle-exchange and de Bruijn graphs
  • Packet-routing algorithms
  • Sorting
  • Simulating a parallel random access machine
  • The fast Fourier transform
  • Other hypercubic networks.

Documents similaires