Cantitate/Preț
Produs

Parallel Algorithms for Irregular Problems: State of the Art

Editat de Alfonso Ferreira, José Rolim
en Limba Engleză Paperback – 3 dec 2010
Efficient parallel solutions have been found to many problems. Some of them can be obtained automatically from sequential programs, using compilers. However, there is a large class of problems - irregular problems - that lack efficient solutions. IRREGULAR 94 - a workshop and summer school organized in Geneva - addressed the problems associated with the derivation of efficient solutions to irregular problems. This book, which is based on the workshop, draws on the contributions of outstanding scientists to present the state of the art in irregular problems, covering aspects ranging from scientific computing, discrete optimization, and automatic extraction of parallelism.
Audience: This first book on parallel algorithms for irregular problems is of interest to advanced graduate students and researchers in parallel computer science.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 96155 lei  43-57 zile
  Springer Us – 3 dec 2010 96155 lei  43-57 zile
Hardback (1) 96762 lei  43-57 zile
  Springer Us – 31 oct 1995 96762 lei  43-57 zile

Preț: 96155 lei

Preț vechi: 120194 lei
-20% Nou

Puncte Express: 1442

Preț estimativ în valută:
18404 19181$ 15320£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781441947475
ISBN-10: 1441947477
Pagini: 356
Ilustrații: XII, 338 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.5 kg
Ediția:Softcover reprint of hardcover 1st ed. 1995
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

I Scientific Computation.- 1 Parallelization Strategies for Matrix Assembly in Finite Element Methods.- 2 A Parallelisable Algorithm for Partitioning Unstructured Meshes.- 3 Plump: Parallel Library for Unstructured Mesh Problems.- 4 Parallelizing Vision Computations on CM-5: Algorithms and Experiences.- II Discrete Optimization.- 5 Scalable Parallel Algorithms for Unstructured Problems.- 6 A Parallel Grasp Implementation for the Quadratic Assignment Problem.- 7 Concurrent Data Structures for Tree Search Algorithms.- 8 A Distributed Implementation of Asynchronous Parallel Branch and Bound.- 9 Experiments with a Parallel Synchronized Branch and Bound Algorithm.- 10 Parallel Local Search and Job Shop Scheduling.- 11 A Randomized Parallel Search Strategy.- 12 A Parallel Approximation Schema for Symmetric Linear Assignment Problem.- III Tools for Automatic Parallelization.- 13 Applications of Graph Scheduling Techniques in Parallelizing Irregular Scientific Computation.- 14 Atredia: A Mapping Environment for Dynamic Tree-Structured Problems.- 15 Regularising Transformations for Integral Dependencies.- 16 Some Strategies for Load Balancing.