A simple livelock-free algorithm for packet switching

DOI10.1016/0167-6423(84)90002-9MaRDI QIDQ795501zbMATH OpenOpenAlexFDO

Authors R. K. Shyamasundar

Publication date 1984

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(84)90002-9

zbMATH Keywords

deadlockcommunication systemdeadlock-free algorithmhyper-fast banker's problemlivelock-free algorithmpacket switched computer networks

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• A deadlock free and starvation free network of packet switching communication processors
• Optimization aspects of deadlock prevention in packet-switching networks
• A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees
• An Efficient and Deadlock-Free Network Reconfiguration Protocol
• scientific article; zbMATH DE number 2185540
• Requirements for deadlock-free, adaptive packet routing
• Requirements for Deadlock-Free, Adaptive Packet Routing
• A universal randomized packet scheduling algorithm
• scientific article; zbMATH DE number 1340884

Cited in

(2)

• Optimization aspects of deadlock prevention in packet-switching networks
• Deadlock in packet switching networks

This page was built for publication: A simple livelock-free algorithm for packet switching

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