scientific article; zbMATH DE number 1304056

MaRDI QIDQ4250741zbMATH OpenFDO

Authors Hae Kyeong Park, Kwan Woo Ryu

Publication date 17 June 1999

zbMATH Keywords

distributed-memory parallel computershigh-speed communication networks

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Optimal and efficient algorithms for summing and prefix summing on parallel machines
• An Improved Parallel Prefix Sums Algorithm
• Optimal computation of prefix sums on a binary tree of processors
• Faster optimal parallel prefix sums and list ranking
• Efficient parallel prefix algorithms on multiport message-passing systems

Cited in

(8)

• Optimal computation of prefix sums on a binary tree of processors
• Efficient parallel prefix algorithms on multiport message-passing systems
• Communication in the LARPBS (optical bus) model: A case study
• Orbital model for a class of algorithms solving the partial sums problem
• Internal masked prefix sums and its connection to fully internal measurement queries
• An Improved Parallel Prefix Sums Algorithm
• Optimal and efficient algorithms for summing and prefix summing on parallel machines
• Multiple addition and prefix sum on a linear array with a reconfigurable pipelined bus system

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 Q4250741)