Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
Advances in Systems Analysis, Software Engineering, and High Performance Computing
The problem of preventing deadlocks and livelocks in computer communication networks with wormhole routing is considered. The method to prevent deadlocks is to prohibit certain turns (i.e., the use of certain pairs of connected edges) in the routing process, in such a way that eliminates all cycles in the graph. A new algorithm that constructs a minimal (irreducible) set of turns that breaks all cycles and preserves connectivity of the graph is proposed and analyzed. The algorithm is tree-free and is considerably simpler than earlier cycle-breaking algorithms. The properties of the algorithm are proven, and lower and upper bounds for minimum cardinalities of cycle-breaking connectivity preserving sets for graphs of general topology, as well as for planar graphs, are presented. In particular, the algorithm guarantees that not more than 1/3 of all turns in the network become prohibited. Experimental results are presented on the fraction of prohibited turns, the distance dilation, as w...
Journal of Parallel and Distributed …
A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing1996 •
Journal of the ACM ( …
A Foundation for Designing Deadlock-Free Routing Algorithms In Wormhole Networks2003 •
High-Performance Computer …
A very efficient distributed deadlock detection mechanism for wormhole networks2000 •
ABSTRACT ABSTRACT In this paper we consider the problem of deadlock- free unicast wormhole routing in computer networks with irregular topologies, such as Networks of Workstations (NOWs). The proposed algorithm consists of two stages. At the first stage, we minimize the set of turns in the network graph which should be prohibited for deadlock prevention by breaking all cycles
IEEE Transactions on Control of Network Systems
Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies2014 •
IEEE Transactions on Parallel and Distributed Systems
A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks1995 •
Journal of Information Science and Engineering
Deadlock detection and recovery for true fully adaptive routing in regular wormhole networks2009 •
1997 •
IEEE Transactions on Parallel and Distributed Systems
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks2010 •
International Journal of Networks and Systems
Potential Impact of 5G Technology on Various Aspects of Technology DevelopmentAustralian Journal of Agricultural and Resource Economics
Agricultural Development and Economic Transformation: Promoting Growth with Poverty Reduction, by John W.Mellor. Published by Palgrave Macmillan, New York, NY, 2017, pp. 259, ISBN: 978‐3‐319‐65259‐72019 •
2021 •
Metallurgical and Materials Transactions A
Improved Mechanical Properties of EBM Biomedical Co–28Cr–6Mo–0.11N Alloy by the Dispersed Precipitation Control of ε-HCP Phase Based on ε ↔ γ Phase TransformationAnais da Academia Brasileira de Ciências
Correlation between radiation dose and p53 protein expression levels in human lymphocytes2015 •
Pasavento: Revista de Estudios Hispánicos
Tránsfugas de sexo, género y especie2022 •
Heritage India Trust
Megalithic-Iron Age remains from Alambadi village in the Cauvery Wildlife Sanctuary in Karnataka2024 •
International Association for Development of the Information Society
Educational Criteria for Evaluating Simple Class Diagrams Made by Novices for Conceptual Modeling2016 •
medRxiv (Cold Spring Harbor Laboratory)
Wastewater monitoring of SARS-CoV-2 gene for COVID-19 epidemiological surveillance in Tucuman Argentina2023 •
2014 •