Sorting on a Mesh-Connected Computer with Delaying Links

DOI10.1137/S0895480191198604zbMATH Open0802.68039OpenAlexW2016819257MaRDI QIDQ4287945FDOQ4287945

Authors Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

Publication date 12 May 1994

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480191198604

zbMATH Keywords

fault toleranceparallel sortingmesh-connected computer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Publication:3484347
• scientific article; zbMATH DE number 4035170
• Lower bounds for sorting on mesh-connected architectures
• scientific article; zbMATH DE number 1026282
• scientific article; zbMATH DE number 3958741

Cited in

(1)

• Fast gossiping with short unreliable messages

This page was built for publication: Sorting on a Mesh-Connected Computer with Delaying Links

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