scientific article; zbMATH DE number 17559

MaRDI QIDQ3974884zbMATH OpenFDO

Authors Ivan Stojmenović, Frederick Neil Springsteel

Publication date 26 June 1992

zbMATH Keywords

hypercuberange searchingCREW PRAMbroadcasting with selective reductionparallel computation modelsmesh-connected computers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Parallel general prefix computations with geometric, algebraic, and other applications
• scientific article; zbMATH DE number 1003255
• The strict time lower bound and optimal schedules for parallel prefix with resource constraints
• Optimal computation of prefix sums on a binary tree of processors
• The complexity of parallel prefix problems on small domains

Cited in

(8)

• An optimal algorithm for reconstructing a binary tree
• Parallel general prefix computations with geometric, algebraic, and other applications
• The strict time lower bound and optimal schedules for parallel prefix with resource constraints
• Prefix computations on symmetric multiprocessors
• GAPPCO: an easy to configure geometric algebra coprocessor based on GAPP programs
• New algorithms for the LCA problem and the binary tree reconstruction problem
• Towards massively parallel computations in algebraic geometry
• Theoretical parallel computing models for GPU computing

This page was built for publication:

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