scientific article; zbMATH DE number 4028858

MaRDI QIDQ3769937zbMATH OpenFDO

Authors Hans L. Bodlaender

Publication date 1987

zbMATH Keywords

controllersdeadlock in packet switching networkselection problems on rings of processorsload-distribution problem on rings of processorssimulation of large processor network on smaller networks

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 40998
• scientific article; zbMATH DE number 732976
• scientific article; zbMATH DE number 3951973
• scientific article; zbMATH DE number 996442
• Complexity of network synchronization

Cited in

(15)

• A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
• Predicting speedup for distributed computing on a token ring network
• Uniform homomorphisms of de Bruijn and Kautz networks
• Distributed computing theory to date. I: Models and an example
• scientific article; zbMATH DE number 682185 (Why is no real title available?)
• scientific article; zbMATH DE number 1950676 (Why is no real title available?)
• Distributed Computing: A Locality-Sensitive Approach
• Algorithms, Complexity, and Hans
• Appraising two decades of distributed computing theory research
• Programming for Distributed Computing: From Physical to Logical Networks
• Structural Information and Communication Complexity
• Uniform emulations of Cartesian-product and Cayley graphs
• Two lower bounds in asynchronous distributed computation
• New lower bound techniques for distributed leader finding and other problems on rings of processors
• The complexity of finding uniform emulations on paths and ring networks

This page was built for publication:

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