A simple livelock-free algorithm for packet switching

DOI10.1016/0167-6423(84)90002-9zbMATH Open0542.68018OpenAlexW2152782659MaRDI QIDQ795501

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

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A deadlock free and starvation free network of packet switching communication processors 👍 👎
• Optimization aspects of deadlock prevention in packet-switching networks 👍 👎
• A universal randomized packet scheduling algorithm 👍 👎
• A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees 👍 👎
• Requirements for Deadlock-Free, Adaptive Packet Routing 👍 👎
• An Efficient and Deadlock-Free Network Reconfiguration Protocol 👍 👎
• Requirements for deadlock-free, adaptive packet routing 👍 👎

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)