Ordered \(h\)-level graphs on the BSP model

DOI10.1006/JPDC.1998.1430zbMath0905.68053OpenAlexW1977171954MaRDI QIDQ1130321

Alexandros V. Gerbessiotis, Constantinos J. Siniolakis

Publication date: 11 January 1999

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1998.1430

zbMATH Keywords

bulk-synchronous parallel modelparallel random access machinedistributed memory models

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Computer system organization (68M99)

Related Items (4)

Trinomial-tree Based Parallel Option Price Valuations ⋮ A randomized sorting algorithm on the BSP model ⋮ Architecture independent parallel selection with applications to parallel priority queues ⋮ An architecture independent study of parallel segment trees

This page was built for publication: Ordered \(h\)-level graphs on the BSP model