Parallel geometric algorithms in coarse-grain network models

DOI10.1007/3-540-68535-9_9MaRDI QIDQ4218407zbMATH OpenFDO

Authors Danny Z. Chen, Mikhail J. Atallah

Publication date 30 March 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-68535-9_9

zbMATH Keywords

coarse-grain network computationcoarse-grain parallel computer

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
• Coarse-grained parallel geometric search

Cited in

(7)

• Coarse-grained parallel geometric search
• Scalable parallel algorithms for geometric pattern recognition
• A general computational formalism for networks of structured grids
• Finding coarse grained parallelism in computational geometry algorithms
• scientific article; zbMATH DE number 1857643 (Why is no real title available?)
• Simulating parallel neighboring communications among square meshes and square toruses
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS

This page was built for publication: Parallel geometric algorithms in coarse-grain network models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218407)