Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540615491, 9783540688082

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Simple quantitative experiments with a sparse compiler

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030115 ◽

1996 ◽

pp. 249-262 ◽

Cited By ~ 2

Author(s):

Aart J. C. Bik ◽

Harry A. G. Wijshoff

Download Full-text

Support for irregular computation in high performance Fortran

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030118 ◽

1996 ◽

pp. 285-285

Author(s):

Rob Schreiber

Keyword(s):

High Performance ◽

High Performance Fortran

Download Full-text

Dynamic spectral partitioning

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030099 ◽

1996 ◽

pp. 87-87

Author(s):

Horst D. Simon ◽

Andrew Sohn

Keyword(s):

Spectral Partitioning

Download Full-text

Fast distributed genetic algorithms for partitioning uniform grids

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030100 ◽

1996 ◽

pp. 89-103 ◽

Cited By ~ 2

Author(s):

Ioannis T. Christou ◽

Robert R. Meyer

Keyword(s):

Genetic Algorithms ◽

Distributed Genetic Algorithms ◽

Uniform Grids

Download Full-text

Decomposing irregularly sparse matrices for parallel matrix-vector multiplication

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030098 ◽

1996 ◽

pp. 75-86 ◽

Cited By ~ 27

Author(s):

Ümit V. Çatalyürek ◽

Cevdet Aykanat

Keyword(s):

Sparse Matrices ◽

Matrix Vector Multiplication ◽

Matrix Vector

Download Full-text

A simple parallel algorithm for the single-source shortest path problem on planar digraphs

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030108 ◽

1996 ◽

pp. 183-194 ◽

Cited By ~ 8

Author(s):

Jesper L. Träff ◽

Christos D. Zaroliagis

Keyword(s):

Parallel Algorithm ◽

Shortest Path ◽

Shortest Path Problem ◽

Single Source

Download Full-text

An interface design for general parallel branch-and-bound algorithms

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030117 ◽

1996 ◽

pp. 277-284 ◽

Cited By ~ 3

Author(s):

Yuji Shinano ◽

Masahiro Higaki ◽

Ryuichi Hirabayashi

Keyword(s):

Branch And Bound ◽

Interface Design ◽

Branch And Bound Algorithms ◽

Parallel Branch And Bound

Download Full-text

Coordination of distributed/parallel multiple-grid domain decomposition

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030103 ◽

1996 ◽

pp. 131-144 ◽

Cited By ~ 5

Author(s):

C. T. H. Everaars ◽

F. Arbab

Keyword(s):

Domain Decomposition ◽

Grid Domain

Download Full-text

Dynamically adapting the degree of parallelism with reflexive programs

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030122 ◽

1996 ◽

pp. 313-318 ◽

Cited By ~ 6

Author(s):

Niels Reimer ◽

Stefan U. Hänßgen ◽

Walter F. Tichy

Download Full-text

Synchronization as a strategy for designing efficient parallel algorithms

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0030113 ◽

1996 ◽

pp. 229-236

Author(s):

Claude G. Diderich ◽

Marc Gengler

Keyword(s):

Parallel Algorithms

Download Full-text

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Simple quantitative experiments with a sparse compiler

Support for irregular computation in high performance Fortran

Dynamic spectral partitioning

Fast distributed genetic algorithms for partitioning uniform grids

Decomposing irregularly sparse matrices for parallel matrix-vector multiplication

A simple parallel algorithm for the single-source shortest path problem on planar digraphs

An interface design for general parallel branch-and-bound algorithms

Coordination of distributed/parallel multiple-grid domain decomposition

Dynamically adapting the degree of parallelism with reflexive programs

Synchronization as a strategy for designing efficient parallel algorithms

Parallel Algorithms for Irregularly Structured Problems - Lecture Notes in Computer Science
Latest Publications