Search results for "deadlock-free"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
107	Barbara E. Wójcik, Zbigniew M. Wójcik	Sufficient Condition for a Communication Deadlock and Distributed Deadlock Detection.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	wait-for contiguous requests, query message, wait-for cycle, no-deadlock message, query initiator, deadlock-free situation, query intercessor, periodical deadlock handling, indefinite wait-die scheme, protocol, distributed processing, replication, system recovery, sufficient condition, distributed deadlock detection, communication deadlock
103	Prasasth Palnati, Mario Gerla, Emilio Leonardi	Deadlock-free routing in an optical interconnect for high-speed wormhole routing networks.	ICPADS	1996	DBLP DOI BibTeX RDF	high-speed wormhole routing networks, Supercomputer SuperNet, two-level hierarchical high-speed network, electronic mesh fabric, WDM optical backbone network, metropolitan area, campus area, backpressure hop-by-hop flow control mechanism, shufflenet multihop virtual topology, physical channels, up/down deadlock free routing scheme, bidirectional shufflenet, optical backbone, multiprocessor interconnection networks, network routing, virtual channels, wavelength division multiplexing, optical interconnections, optical interconnect, deadlock-free routing, deadlock prevention
101	Juan-Miguel Martínez 0001, Pedro López 0001, José Duato, Timothy Mark Pinkston	Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks.	ICPP	1997	DBLP DOI BibTeX RDF	adaptive routing, virtual channels, Wormhole switching, deadlock detection, deadlock recovery
86	Dong Xiang, Yueli Zhang, Yi Pan 0001, Jie Wu 0001	Deadlock-Free Adaptive Routing in Meshes Based on Cost-Effective Deadlock Avoidance Schemes.	ICPP	2007	DBLP DOI BibTeX RDF	Deadlock-free adaptive routing, minimum-connected components, planar adaptive routing, mesh, fault-tolerant routing
86	Zhonghua Huang, Zhiming Wu	Deadlock-free Scheduling Method for Automated Manufacturing Systems with Limited Central Buffers.	ICRA	2004	DBLP DOI BibTeX RDF
84	Anjan K. Venkatramani, Timothy Mark Pinkston, José Duato	Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent.	IPPS	1996	DBLP DOI BibTeX RDF	deadlock-free adaptive wormhole routing, Disha Concurrent, central buffers, sequential recovery, resource cost, mutual exclusive access, deadlock-free lane, tree-based networks, performance evaluation, parallel architectures, fault tolerant computing, concurrency control, multiprocessor interconnection networks, multiprocessor interconnection networks, network routing, system recovery, edge, Token, Hamiltonian path, deadlock recovery, k-ary n-cube networks
80	Ken Hironaka, Hideo Saito, Kenjiro Taura	High performance wide-area overlay using deadlock-free routing.	HPDC	2009	DBLP DOI BibTeX RDF	grids, bandwidth, collective communication, overlays, parallel applications, deadlock-free routing
76	Dong Xiang, Yueli Zhang, Yi Pan 0001	Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
76	Nidhi Agrawal, C. P. Ravikumar	An Euler Path Based Technique for Deadlock-free Multicasting.	ICPP	1997	DBLP DOI BibTeX RDF	Euler-Path, Routing, Multicasting, Multicomputers, Virtual Channels, Deadlock-free
76	Hyunmin Park, Dharma P. Agrawal	A Topology-Independent Generic Methodology for Deadlock-Free Wormhole Routing.	HPCA	1996	DBLP DOI BibTeX RDF	Subdigraph, Hypercube, Mesh, Adaptive Routing, Virtual Channel, Torus, Channels, Wormhole, Deadlock-free Routing Algorithm
76	Hyunmin Park, Dharma P. Agrawal	Generic Methodologies for Deadlock-Free Routing.	IPPS	1996	DBLP DOI BibTeX RDF	Subdigraph, Hypercube, Mesh, Adaptive Routing, Virtual Channel, Torus, Channels, Wormhole, Virtual Cut-through, Store-and-Forward, Deadlock-free Routing Algorithm
71	Andrew A. Chien, Jae H. Kim	Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors.	J. ACM	1995	DBLP DOI BibTeX RDF	transmission-order preservation, fault tolerance, parallel processing, interconnection networks, adaptive routing, multicomputers, packet routing
70	David J. Pritchard, Denis A. Nicole	Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	deadlock-free fixed degree network, cube-connected Mobius ladders, deadlock-free routingstrategy, fixed node degree, fixed degree topology of size, transputernetworks, parallel algorithms, computational complexity, graph theory, topology, Cayley graph, multiprocessorinterconnection network, network diameter, multiprocessor interconnectionnetworks, interval routing
66	Hiromi Hiraishi	Verification of deadlock free property of high level robot control.	Asian Test Symposium	2000	DBLP DOI BibTeX RDF	deadlock free property, high level robot control, verification algorithm, task control architecture, concurrent robot control processes, symbolic model verifier, symbolic model checking algorithm, robots, formal verification, logic testing, concurrency control, message passing, symbol manipulation, safety properties, liveness properties
66	Xiaola Lin, Philip K. McKinley, Lionel M. Ni	Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	deadlock-free multicastwormhole routing, 2-D mesh multicomputers, nCUBE-2, wormhole-routed hypercubemulticomputer, broadcast routing algorithm, dynamic network trafficconditions, dual-path routing algorithm, parallel architectures, hypercube networks, digital simulation, simulation study
65	Gerald M. Karam, Raymond J. A. Buhr	Temporal Logic-Based Deadlock Analysis For Ada.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	temporal logic-based specification language, deadlock analyzer, Timebench, concurrent system-design environment, COL, linear-time temporal logic, formal basis, axiomatic reasoning, deadlock analysis tool, reasoning power, Ada designs, systemwide deadlock-free, deadlock algorithm, finite systems, worst-case computational complexity, gas station, layered communications system, computational complexity, Ada, logic programming, temporal logic, Prolog, specification language, specification languages, inference mechanisms, system recovery, theorem prover, readers, dining philosophers, writers
65	José Duato	A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	interconnection networks, design methodologies, Adaptive routing, deadlock avoidance, virtual cut-through, store-and-forward
64	Dong Xiang, Qi Wang, Yi Pan 0001	Deadlock-Free Adaptive Routing in 2D Tori with a New Turn Model.	ICA3PP	2008	DBLP DOI BibTeX RDF	deadlock-free adaptive routing, odd-even turn model, torus, Deadlock avoidance, turn model
62	Paola Inverardi, Massimo Tivoli	Automatic synthesis of deadlock free connectors for COM/DCOM applications.	ESEC / SIGSOFT FSE	2001	DBLP DOI BibTeX RDF
61	Timothy Mark Pinkston, Ruoming Pang, José Duato	Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	dependable communication, hard link-level flow control, parallel processing, interconnection networks, dynamic reconfiguration, Deadlock-free routing
61	José Duato, Timothy Mark Pinkston	A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	General theory for deadlock-free fully adaptive routing, nonatomic queue allocation, irregular networks, regular networks
60	C. S. Yang, Y. M. Tsai, Y. L. Tsai	Adaptive routing in k-ary n-cube multicomputers.	ICPADS	1996	DBLP DOI BibTeX RDF	k-ary n-cube multicomputers, distributed memory multiprocessor systems, virtual system, network congestion delay, performance evaluation, virtual reality, throughput, hypercube networks, wormhole routing, digital simulation, adaptive routing, distributed memory systems, simulation results, network routing, buffer size, deadlock-free routing, deadlock free routing, communication latency
60	Gregor Gößler, Joseph Sifakis	Component-Based Construction of Deadlock-Free Systems: Extended Abstract.	FSTTCS	2003	DBLP DOI BibTeX RDF
60	José Duato	On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Theoretical Aspects.	EDMCC	1991	DBLP DOI BibTeX RDF
60	José Duato	On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies.	PARLE (1)	1991	DBLP DOI BibTeX RDF
58	Sugath Warnakulasuriya, Timothy Mark Pinkston	Characterization of Deadlocks in Interconnection Networks.	IPPS	1997	DBLP DOI BibTeX RDF	deadlocks characterisation, true deadlock detection, bidirectionality, routing adaptivity, node degree, deadlock formation, routing flexibility blocked messages, resource dependencies, simulator, interconnection networks, multiprocessor interconnection networks, virtual channels, buffer size, design parameters, deadlock-free routing algorithms
58	Vikram S. Adve, Mary K. Vernon	Performance Analysis of Mesh Interconnection Networks with Deterministic Routing.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	mesh interconnection networks, single-hit buffers, infinite buffers, nonadaptive deadlock-free routing scheme, closedqueueing network, message blocking, message pipelining, arbitrary source-destinationprobability distribution, 2D networks, shared-memory traffic, two dimensional network, performance evaluation, performance analysis, concurrency control, probability, multiprocessor interconnection networks, queueing theory, wormhole routing, network routing, virtual channels, deterministic routing, k-ary n-cube networks, deadlock-free routing algorithm, performance issues
57	Maurizio Palesi, Rickard Holsmark, Shashi Kumar, Vincenzo Catania	A methodology for design of application specific deadlock-free routing algorithms for NoC systems.	CODES+ISSS	2006	DBLP DOI BibTeX RDF	networks, networks on chip, adaptive routing, application specific, deadlock-free routing
57	Jie Wu 0001, Dajin Wang	Fault-Tolerant and Deadlock-Free Routing in 2-D Meshes Using Rectilinear-Monotone Polygonal Fault Blocks.	ICPP	2002	DBLP DOI BibTeX RDF	fault tolerance, fault models, virtual channels, Deadlock-free routing, deterministic routing, turn models
57	Ming-Jer Tsai, Sheng-De Wang	Adaptive and Deadlock-Free Routing for Irregular Faulty Patterns in Mesh Multicomputers.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	Adaptive and deadlock-free routing, irregular faulty pattern, fault tolerance, virtual channel, wormhole switching, mesh multicomputer
57	William J. Dally, Hiromichi Aoki	Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	multicomputer interconnection network, virtual channel utilization, parallel processing, multiprocessor interconnection networks, adaptive routing, virtual channels, network performance, deadlock-free, faulttolerance, fault tolerantcomputing
55	José Duato	A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF	path-based multicast, graph theory, wormhole routing, Adaptive routing, multicomputers, virtual channels, multicast routing, deadlock avoidance
54	Zeng Fancong	Deadlock Resolution via Exceptions for Dependable Java Applications.	DSN	2003	DBLP DOI BibTeX RDF
53	Michele Flammini	Deadlock-Free Interval Routing Schemes.	STACS	1997	DBLP DOI BibTeX RDF
53	José Duato	A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF	Adaptive routing, multicomputers, virtual channels, deadlock avoidance, wormhole
50	Michel A. Kinsy, Myong Hyon Cho, Tina Wen, G. Edward Suh, Marten van Dijk, Srinivas Devadas	Application-aware deadlock-free oblivious routing.	ISCA	2009	DBLP DOI BibTeX RDF	systems-on-chip, oblivious routing, on-chip interconnection networks
50	Seungjoo Lee, Dawn M. Tilbury	Deadlock-Free Resource Allocation Control for a Reconfigurable Manufacturing System With Serial and Parallel Configuration.	IEEE Trans. Syst. Man Cybern. Part C	2007	DBLP DOI BibTeX RDF
50	Olav Lysne, Timothy Mark Pinkston, José Duato	Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	deadlock-freedom methodology, system reliability and availability, Interconnection network, dynamic reconfiguration
50	Gang Xu, Zhiming Wu	Deadlock-free scheduling strategy for automated production cell.	IEEE Trans. Syst. Man Cybern. Part A	2004	DBLP DOI BibTeX RDF
50	Naoki Kobayashi 0001	A Partially Deadlock-Free Typed Process Calculus.	LICS	1997	DBLP DOI BibTeX RDF
50	José Duato	A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	deadlock-free adaptive routing, wormhole networks, channeldependency graph, performance, graph theory, fault tolerant computing, concurrency control, message passing, routing algorithms, telecommunication network routing, adaptive algorithm, fault-tolerant algorithms
48	Naoki Kobayashi 0001	A New Type System for Deadlock-Free Processes.	CONCUR	2006	DBLP DOI BibTeX RDF
48	José Carlos Sancho, Antonio Robles, José Flich, Pedro López 0001, José Duato	Effective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks.	ICPP	2002	DBLP DOI BibTeX RDF
48	Loren Schwiebert	Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	channel dependency graph, unreachable configuration, Wormhole routing, oblivious routing, deadlock freedom
47	Jason Cong, Chunyue Liu, Glenn Reinman	ACES: application-specific cycle elimination and splitting for deadlock-free routing on irregular network-on-chip.	DAC	2010	DBLP DOI BibTeX RDF	application-specific Network-on-Chip, deadlock-free routing
47	Mostafa Rezazad, Mohammad Reza Hoseiny Farahabady, Hamid Sarbazi-Azad	A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes.	ICDCN	2008	DBLP DOI BibTeX RDF	WK-recursive, shortest path routing, Deadlock Free Routing Algorithm
47	Jie Wu 0001	A Fault-Tolerant and Deadlock-Free Routing Protocol in 2D Meshes Based on Odd-Even Turn Model.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	fault tolerance, fault models, virtual channels, Deadlock-free routing, deterministic routing, turn models
47	Jie Wu 0001	A deterministic fault-tolerant and deadlock-free routing protocol in 2-D meshes based on odd-even turn model.	ICS	2002	DBLP DOI BibTeX RDF	fault tolerance, fault models, virtual channels, deadlock-free routing, deterministic routing, turn models
47	Li Sheng 0001, Jie Wu 0001	A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	strongly connected digraphs, interconnection networks, Deadlock-free routing
47	Hyunmin Park, Dharma P. Agrawal	A novel deadlock-free routing technique for a class of de Bruijn graph based networks.	IPPS	1995	DBLP DOI BibTeX RDF	deadlock-free routing technique, de Bruijn graph based networks, maximum message path length, dBCube graph, outcluster channels, cluster-to-cluster path, concurrency control, hypercube networks, virtual channels
46	Hamid Reza Golmakani, James K. Mills, Beno Benhabib	Deadlock-Free Scheduling and Control of Flexible Manufacturing Cells Using Automata Theory.	IEEE Trans. Syst. Man Cybern. Part A	2006	DBLP DOI BibTeX RDF
46	Gang Xu, Zhiming Wu	A Kind of Deadlock-free Scheduling Method Based on Petri Net.	HASE	2002	DBLP DOI BibTeX RDF
46	Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan	On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks.	Theory Comput. Syst.	2000	DBLP DOI BibTeX RDF
46	Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic	Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.	DISC	1998	DBLP DOI BibTeX RDF
46	Rajendra V. Boppana, Suresh Chalasani	A Framework for Designing Deadlock-Free Wormhole Routing Algorithms.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	Cayley networks, performance evaluation, deadlocks, wormhole routing, Adaptive routing, mesh networks, design techniques, multicomputer networks, de Bruijn networks
45	César Sánchez 0001, Henny B. Sipma, Zohar Manna, Venkita Subramonian, Christopher D. Gill	On efficient distributed deadlock avoidance for real-time and embedded systems.	IPDPS	2006	DBLP DOI BibTeX RDF
45	Miriam Di Ianni	Wormhole Deadlock Prediction.	Euro-Par	1997	DBLP DOI BibTeX RDF
43	Dong Xiang, Yi Pan 0001, Qi Wang, Zhen Chen	Deadlock-Free Fully Adaptive Routing in 2-Dimensional Tori Based on New Virtual Network Partitioning Scheme.	ICDCS	2008	DBLP DOI BibTeX RDF
43	Dong Xiang, Qi Wang, Yi Pan 0001	Deadlock-Free Fully Adaptive Routing in Tori Based on a New Virtual Network Partitioning Scheme.	ICPP	2008	DBLP DOI BibTeX RDF
43	Akiya Jouraku, Michihiro Koibuchi, Hideharu Amano	An Effective Design of Deadlock-Free Routing Algorithms Based on 2D Turn Model for Irregular Networks.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	interconnection networks, Adaptive routing, PC clusters, deadlock avoidance, irregular topologies, system area networks, turn model
43	Sven-Arne Reinemo, Tor Skeie	Ethernet as a Lossless Deadlock Free System Area Network.	ISPA	2005	DBLP DOI BibTeX RDF
43	Yu Ru, Weimin Wu, Hongye Su, Jian Chu	State feedback based deadlock-free supervisor synthesis for bounded Petri nets.	SMC (2)	2004	DBLP DOI BibTeX RDF
43	Doddaballapur Narasimha-Murthy Jayasimha, Loren Schwiebert, D. Manivannan 0001, Jeff A. May	A foundation for designing deadlock-free routing algorithms in wormhole networks.	J. ACM	2003	DBLP DOI BibTeX RDF	Knowledge complexity, statistical difference, zero knowledge, proof systems
43	D. P. Simpson, J. S. Reeve	Deadlock Free Specification Based on Local Process Properties.	International Conference on Computational Science	2003	DBLP DOI BibTeX RDF
43	Dah-Ming Chiu, Miriam Kadansky, Radia J. Perlman, John Reynders, Guy L. Steele Jr., Murat Yuksel	Deadlock-Free Routing Based on Ordered Links.	LCN	2002	DBLP DOI BibTeX RDF
43	Eric Fleury, Pierre Fraigniaud	A General Theory for Deadlock Avoidance in Wormhole-Routed Networks.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Routing, multicast, deadlock, wormhole
41	Zhonghua Huang, Zhiming Wu	Deadlock-free Scheduling Method for Automated Manufacturing Systems Using Genetic Algorithm and Petri Nets.	ICRA	2004	DBLP DOI BibTeX RDF
41	José Carlos Sancho, Antonio Robles, José Duato	A New Methodology to Computer Deadlock-Free Routing Tables for Irregular Networks.	CANPC	2000	DBLP DOI BibTeX RDF
41	Yoshiko Yasuda, Hiroaki Fujii, Hideya Akashi, Yasuhiro Inagami, Teruo Tanaka, Junji Nakagoshi, Hideo Wada, Tsutomu Sumimoto	Deadlock-Free Fault-tolerant Routing in the Multi-dimensional Crossbar Network and Its Implementation for the Hitachi SR2201.	IPPS	1997	DBLP DOI BibTeX RDF
40	Wenjian Qiao, Lionel M. Ni, Tomas Rokicki	Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	incremental scalability, performance evaluation, Adaptive routing, deadlock-free routing, irregular networks, cut-through switches
40	Xiaola Lin, Philip K. McKinley, Lionel M. Ni	The Message Flow Model for Routing in Wormhole-Routed Networks.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF	Channel dependency graph, message flow model, wormhole routing, adaptive routing, mesh networks, multicast communication, deadlock-free routing
38	Sumit Ghosh	P2EDAS: Asynchronous, Distributed Event Driven Simulation Algorithm with Inconsistent Event Preemption for Accurate Execution of VHDL Descriptions on Parallel Processors.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	simulation of hardware descriptions, inertial delays, descheduling, anticipatory scheduling, preemption of inconsistent events, parallel processing, VLSI, distributed algorithms, discrete event simulation, VHDL, Digital simulation, logic simulation, event driven simulation, timing semantics
38	Majid Janidarmian, Vahhab Samadi Bokharaie, Ahmad Khademzadeh, Misagh Tavanpour	Sorena: New on Chip Network Topology Featuring Efficient Mapping and Simple Deadlock Free Routing Algorithm.	CIT	2010	DBLP DOI BibTeX RDF	routing, mapping, network on chip, topology, deadlock-free
38	Yuri Nishikawa, Michihiro Koibuchi, Hiroki Matsutani, Hideharu Amano	A Deadlock-Free Non-minimal Fully Adaptive Routing Using Virtual Cut-Through Switching.	NAS	2010	DBLP DOI BibTeX RDF	non-minimal fully adaptive routing, NoC, deadlock-free routing, SAN, turn-model, virtual cut-through
38	Shivali Agarwal, Rajkishore Barik, Dan Bonachea, Vivek Sarkar, R. K. Shyamasundar, Katherine A. Yelick	Deadlock-free scheduling of X10 computations with bounded resources.	SPAA	2007	DBLP DOI BibTeX RDF	deadlock-free scheduling, X10, active messages
38	Ran Libeskind-Hadas	A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing.	IEEE Trans. Computers	1998	DBLP DOI BibTeX RDF	fault tolerance, Wormhole routing, deadlock-free routing algorithms
38	Robert Cypher, Luis Gravano	Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	deadlock-free packet routing algorithms, torus interconnection networks, minimal length packet routing, VLSI, multiprocessor interconnection networks, packet switching, VLSI implementation, torus networks
38	Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz	Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	adaptive minimal deadlock-free packet routing, virtual cut-through routing models, simulations, algorithms, concurrency control, message passing, hypercubes, multiprocessor interconnection networks, multiprocessor interconnection networks, meshes, packet switching, parallel machines, parallel machines, routing algorithms, deadlock, packet routing, shuffle-exchange, minimal paths, two-dimensional mesh
38	Jörg Liebeherr, Ian F. Akyildiz	Deadlock properties of queueing networks with finite capacities and multiple routing chains.	Queueing Syst. Theory Appl.	1995	DBLP DOI BibTeX RDF	blocking networks, deadlocks, Queueing networks, deadlock prevention
37	Olav Lysne, Timothy Mark Pinkston, José Duato	A Methodology for Developing Dynamic Network Reconfiguration Processes.	ICPP	2003	DBLP DOI BibTeX RDF	dynamic network reconfiguration, interconnection network architecture, highly-available and highly-dependable network-based systems, Deadlock-free routing
37	Robert W. Horst	ServerNet Deadlock Avoidance and Fractahedral Topologies.	IPPS	1996	DBLP DOI BibTeX RDF	scalable topologies, fractahedral topologies, maximum link contention, 6-port ServerNet routers, performance evaluation, concurrency control, hypercube, mesh, multistage interconnection networks, network routing, deadlock avoidance, multistage networks, deadlock-free
36	Yaoting Jiao, Mei Yang, Yingtao Jiang, Yulu Yang, Xiao-chun Yun	Deadlock-Free Multi-Path Routing for Torus-Based NoCs.	ITNG	2008	DBLP DOI BibTeX RDF	deadlock, NoC, MPR
36	Maurizio Palesi, Shashi Kumar, Rickard Holsmark, Vincenzo Catania	Exploiting Communication Concurrency for Efficient Deadlock Free Routing in Reconfigurable NoC Platforms.	IPDPS	2007	DBLP DOI BibTeX RDF
36	Jie Wu 0001, Li Sheng 0001	Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing.	J. Supercomput.	2005	DBLP DOI BibTeX RDF	prefix routing, multicasting, multiprocessor systems, deadlock
36	Robert Wójcik, Krzysztof Bzdyra, Manuel M. Crisóstomo, Zbigniew Antoni Banaszak	Constraint programming approach to design of deadlock-free schedules in concurrent production systems.	ETFA	2005	DBLP DOI BibTeX RDF
36	Michihiro Koibuchi, Akiya Jouraku, Konosuke Watanabe, Hideharu Amano	Descending Layers Routing: A Deadlock-Free Deterministic Routing using Virtual Channels in System Area Networks with Irregular Topologies.	ICPP	2003	DBLP DOI BibTeX RDF	RHiNET, interconnection networks, virtual channels, PC clusters, deadlock avoidance, irregular topologies, Deterministic routing, System Area Networks
36	Hsin-Chou Chi, Chih-Tsung Tang	A Deadlock-Free Routing Scheme for Interconnection Networks with Irregular Topologies.	ICPADS	1997	DBLP DOI BibTeX RDF
36	David J. Pritchard	Load Balanced Deadlock-Free Deterministic Routing of Arbitrary Networks.	ACM Conference on Computer Science	1992	DBLP DOI BibTeX RDF
36	Xiaoxiong Zhong, Virginia Mary Lo	Application-Specific Deadlock Free Wormhole Routing on Multicomputers.	PARLE	1992	DBLP DOI BibTeX RDF
34	Sherif A. Fahmy, Tarek Y. ElMekkawy, Subramaniam Balakrishnan	Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices.	SMC	2007	DBLP DOI BibTeX RDF
34	Srinivasan Murali, Paolo Meloni, Federico Angiolini, David Atienza, Salvatore Carta, Luca Benini, Giovanni De Micheli, Luigi Raffo	Designing Message-Dependent Deadlock Free Networks on Chips for Application-Specific Systems on Chips.	VLSI-SoC	2006	DBLP DOI BibTeX RDF
34	José Duato, Olav Lysne, Ruoming Pang, Timothy Mark Pinkston	Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	deadlock-freedom theory, system reliability and availability, Interconnection network, dynamic reconfiguration
34	Olav Lysne, José Miguel Montañana, Timothy Mark Pinkston, José Duato, Tor Skeie, José Flich	Simple Deadlock-Free Dynamic Network Reconfiguration.	HiPC	2004	DBLP DOI BibTeX RDF
34	Pablo Boronat, Vicent Cholvi	A Transformation to Provide Deadlock-Free Programs.	International Conference on Computational Science	2003	DBLP DOI BibTeX RDF
34	Zhen Chen, Zengji Liu, Zhiliang Qiu	A Deadlock-Free Wormhole Routing Scheme in the Pan-Mesh.	AINA	2003	DBLP DOI BibTeX RDF
34	Rafael Casado, Aurelio Bermúdez, José Duato, Francisco J. Quiles 0001, José L. Sánchez 0002	A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	Interconnection networks, dynamic reconfiguration, deadlock avoidance, irregular topologies, system availability
34	Paola Inverardi, Simone Scriboni	Connectors Synthesis for Deadlock-Free Component-Based Architectures.	ASE	2001	DBLP DOI BibTeX RDF
34	Ruoming Pang, Timothy Mark Pinkston, José Duato	The Double Scheme: Deadlock-Free Dynamic Reconfiguration of Cut-Through Networks.	ICPP	2000	DBLP DOI BibTeX RDF
34	Rafael Casado, Francisco J. Quiles 0001, José L. Sánchez 0002, José Duato	Deadlock-Free Routing in Irregular Networks with Dynamic Reconfiguration.	CANPC	1999	DBLP DOI BibTeX RDF
34	Jin Suk Kim, Eric Lehman, Frank Thomson Leighton	Oblivious Deadlock-Free Routing in a Faulty Hypercube.	IPPS/SPDP	1999	DBLP DOI BibTeX RDF