Vor Ort
Merkzettel Warenkorb
Produktbild: Parallel Algorithms for Irregularly Structured Problems
Band 1117

Parallel Algorithms for Irregularly Structured Problems Third International Workshop, IRREGULAR '96, Santa Barbara, CA, USA, August 19 - 21, 1996. Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.07.1996

Abbildungen

X, 366 p.

Herausgeber

Alfonso Ferreira + weitere

Verlag

Springer Berlin

Seitenzahl

366

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

569 g

Auflage

1996

Sprache

Englisch

ISBN

978-3-540-61549-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.07.1996

Abbildungen

X, 366 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

366

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

569 g

Auflage

1996

Sprache

Englisch

ISBN

978-3-540-61549-1

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Parallel Algorithms for Irregularly Structured Problems
  • Allocating independent tasks to parallel processors: An experimental study.- Parallel implementation of an adaptive scheme for 3D unstructured grids on the SP2.- Solution of large, sparse, irregular systems on a massively parallel computer.- Parallel implementation of a sparse approximate inverse preconditioner.- Decomposing irregularly sparse matrices for parallel matrix-vector multiplication.- Dynamic spectral partitioning.- Fast distributed genetic algorithms for partitioning uniform grids.- Toward efficient unstructured multigrid preprocessing (extended abstract).- Domain decomposition for particle methods on the sphere.- Coordination of distributed/parallel multiple-grid domain decomposition.- Systems support for irregular parallel applications.- Distributed object oriented data structures and algorithms for VLSI CAD.- Parallel progressive radiosity with adaptive meshing.- Lineal feature extraction by parallel stick growing.- A simple parallel algorithm for the single-source shortest path problem on planar digraphs.- A regular VLSI array for an irregular algorithm.- Digital librarires and spatial information processing.- Flexible communication mechanisms for dynamic structured applications.- Multi-Message Multicasting.- Synchronization as a strategy for designing efficient parallel algorithms.- Supporting dynamic data and processor repartitioning for irregular applications.- Simple quantitative experiments with a sparse compiler.- Using algorithmic skeletons with dynamic data structures.- An interface design for general parallel branch-and-bound algorithms.- Support for irregular computation in high performance Fortran.- Efficient dynamic embedding of arbitrary binary trees into hypercubes.- Practical dynamic load balancing for irregular problems.- The module allocation problem: An average case analysis.- Dynamically adapting the degree of parallelism with reflexive programs.- On the complexity of the generalized block distribution.- Adaptive load balancing of irregular applications a case study: IDA* applied to the 15-puzzle problem.- Manufacturing progressive addition lenses using distributed parallel processing.- The parallel complexity of randomized fractals.