Parallel Algorithms for Irregularly Structured Problems de Afonso Ferreira

Parallel Algorithms for Irregularly Structured Problems: Second International Workshop, IRREGULAR '95, Lyon, France, September 4 - 6, 1995. Proceedings: Lecture Notes in Computer Science, cartea 980

Afonso Ferreira

Jose Rolim

en Limba Engleză Paperback – 25 aug 1995

This book presents the proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '95, held in Lyon, France in September 1995. This workshop series addresses issues related to deriving efficient parallel solutions to irregularly structured problems and aims at fostering cooperation between practitioners and theoreticians in the field.
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.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 323^.14 lei
20%

Preț: 461^.32 lei
20%

Preț: 460^.98 lei
20%

Preț: 390^.41 lei
20%

Preț: 526^.98 lei
15%

Preț: 388^.21 lei
20%

Preț: 461^.21 lei
20%

Preț: 390^.08 lei
20%

Preț: 496^.30 lei
20%

Preț: 461^.21 lei
20%

Preț: 389^.45 lei
15%

Preț: 461^.53 lei
20%

Preț: 389^.63 lei
20%

Preț: 496^.68 lei
20%

Preț: 461^.70 lei
20%

Preț: 251^.97 lei
20%

Preț: 390^.86 lei
20%

Preț: 532^.16 lei
20%

Preț: 461^.52 lei
20%

Preț: 255^.72 lei
20%

Preț: 498^.10 lei
20%

Preț: 497^.19 lei
20%

Preț: 499^.02 lei
20%

Preț: 389^.82 lei
20%

Preț: 390^.92 lei
20%

Preț: 390^.86 lei
20%

Preț: 390^.92 lei
20%

Preț: 390^.08 lei
20%

Preț: 461^.45 lei
20%

Preț: 392^.36 lei
20%

Preț: 460^.75 lei
20%

Preț: 461^.32 lei
20%

Preț: 389^.90 lei
20%

Preț: 639^.26 lei
20%

Preț: 390^.66 lei
20%

Preț: 391^.57 lei
20%

Preț: 389^.57 lei
20%

Preț: 497^.97 lei
20%

Preț: 462^.36 lei
20%

Preț: 460^.67 lei
20%

Preț: 423^.95 lei
5%

Preț: 515^.91 lei
15%

Preț: 535^.55 lei
20%

Preț: 531^.90 lei
20%

Preț: 403^.00 lei
20%

Preț: 535^.41 lei
20%

Preț: 461^.25 lei
20%

Preț: 498^.17 lei
20%

Preț: 461^.52 lei
20%

Preț: 249^.77 lei

Cuprins

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.