Randomized parallel communications on an extension of the omega network

DOI10.1145/31846.42226MaRDI QIDQ3766827zbMATH OpenOpenAlexWikidataFDO

Authors Debasis Mitra, Randall A. Cieslak

Publication date 1987

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/31846.42226

zbMATH Keywords

asynchronous communicationrenewal point processesrouting

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99)

Recommendations

• scientific article; zbMATH DE number 3324367
• Reliable Omega Interconnected Network for Large-Scale Multiprocessor Systems
• Communication-efficient parallel algorithms for distributed random-access machines
• Randomized broadcast in networks
• scientific article; zbMATH DE number 2083798
• Optimal communication in networks with randomly distributed byzantine faults
• Parallel-algorithm communication operations generated by uniform dependences
• scientific article; zbMATH DE number 953281
• Communication-efficient randomized consensus

Cited in

(4)

• Communication-efficient and crash-quiescent omega with unknown membership
• Randomization Does Not Reduce the Average Delay in Parallel Packet Switches
• Efficient Schemes for Parallel Communication
• Sharper analysis of packet routing on a butterfly

Describes a project that uses

Uses Software

• PANACEA

This page was built for publication: Randomized parallel communications on an extension of the omega network

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