scientific article; zbMATH DE number 17559

zbMATH Open0756.68053MaRDI QIDQ3974884FDOQ3974884

Authors: Ivan Stojmenović, Frederick Neil Springsteel 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

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

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)

Cited In (8)

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

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)