Stochastic analysis of distributed deadlock scheduling

DOI10.1145/1073814.1073864MaRDI QIDQ5177248zbMATH OpenOpenAlexFDO

Authors Shigang Chen, Yibei Ling

Publication date 10 March 2015

Published in Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

deadlock detection schedulingdeadlock formation ratedeadlock persistence time

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 426137
• scientific article; zbMATH DE number 1953156
• Distributed deadlock detection
• Resolving all deadlocks in distributed systems
• Time efficient deadlock resolution algorithms

Cited in

(3)

• On the optimality of randomized deadlock avoidance policies
• Expected deadlock time in a multiprocessing system
• Deadlock-free scheduling of an automated manufacturing system using an enhanced colored time resource Petri-net model-based evolutionary endosymbiotic learning automata approach

This page was built for publication: Stochastic analysis of distributed deadlock scheduling

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