Pages that link to "Item:Q4571970"

The following pages link to Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970):

Displaying 3 items.

• 1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163) (← links)
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
• PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS (Q5249012) (← links)