Parallel Algorithms for Irregularly Structured Problems
Springer Berlin (Verlag)
978-3-540-60321-4 (ISBN)
Besides three invited papers, 20 full papers and eight short contributions are presented, all selected during a highly competitive refereeing process; the volume is organized in sections on programming methods and compiling techniques, mapping and scheduling, applications, and optimization.
Regular versus irregular problems and algorithms.- Algorithmic skeletons for adaptive multigrid methods.- Run-time techniques for parallelizing sparse matrix problems.- Fast execution of irregularly structured programs with low communication frequency on the hypercube.- Run-time parallelization of irregular DOACROSS loops.- Instruction scheduling and global register allocation for SIMD multiprocessors.- General bounds for the assignment of irregular dependency graphs.- A new scheme for dynamic processor assignment for irregular problems.- An efficient mean field annealing formulation for mapping unstructured domains to hypercubes.- Partitioning & mapping of unstructured meshes to parallel machine topologies.- Integrating software pipelining and graph scheduling for iterative scientific computations.- Approximation algorithms for time constrained scheduling.- On the scope of applicability of the ETF algorithm.- Optimal mapping of neighbourhood-constrained systems.- Parallel processing in DNA analysis.- Solving computational fluid dynamics problems on unstructured grids with distributed parallel processing.- Parallel decomposition of unstructured FEM-meshes.- Massively parallel approximation of irregular triangular meshes with G1 parametric surfaces.- Distributed symbolic computation with DTS.- A parallel processing paradigm for irregular applications.- Load balancing strategies for a parallel system of particles.- A reconfigurable parallel algorithm for sparse Cholesky factorization.- Adapted wavelet analysis on moderate parallel distributed memory MIMD architectures.- A new parallel approach to the constrained two-dimensional cutting stock problem.- Using the ProSet-Linda prototyping language for investigating MIMD algorithms for model matching in 3-D computer vision.-Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP.- Better algorithms for parallel backtracking.- Parallel game tree search on SIMD machines.- Asynchronous parallel branch and bound and anomalies.- Fast priority queues for parallel branch-and-bound.- A parallel formulation for general branch-and-bound algorithms.
| Erscheint lt. Verlag | 25.8.1995 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | X, 418 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 569 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Schlagworte | algorithm • Algorithmen • algorithms • Algorithmus • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • HC/Mathematik/Arithmetik, Algebra • Irregularly structured problems • Irregulärstrukturierte Probleme • Optimierung • Optimization • Parallel Algorithms • Parallele Algorithmen • Parallele Datenverarbeitung • Paralleles Programmieren • Parallel Processing • Parallelprogrammierung • Parallel Programming • Parallelverarbeitung • Programmierung • programming • Scheduling |
| ISBN-10 | 3-540-60321-2 / 3540603212 |
| ISBN-13 | 978-3-540-60321-4 / 9783540603214 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
