Minimizing message complexity of partially replicated data on hypercubes

DOI10.1002/(SICI)1097-0037(199609)28:2%3C87::AID-NET2%3E3.0.CO;2-8MaRDI QIDQ5689820zbMATH OpenOpenAlexFDO

Authors

Publication date 25 May 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199609)28:2%3C87::aid-net2%3E3.0.co;2-8

zbMATH Keywords

hypercube

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Information storage and retrieval of data (68P20) Reliability, availability, maintenance, inspection in operations research (90B25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• On the message complexity of distributed problems
• scientific article; zbMATH DE number 1555940
• Complexity and approximations for multimessage multicasting
• Database Theory - ICDT 2005
• On multi-partition communication complexity
• An optimal voting scheme for minimizing the overall communication cost in replicated data management
• On optimal broadcasting in faulty hypercubes

This page was built for publication: Minimizing message complexity of partially replicated data on hypercubes

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