Search results for "deadlock-free"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Dongkook Park, Chrysostomos Nicopoulos, Jongman Kim, Narayanan Vijaykrishnan, Chita R. Das	A Distributed Multi-Point Network Interface for Low-Latency, Deadlock-Free On-Chip Interconnects.	Nano-Net	2006	DBLP DOI BibTeX RDF
17	Srinivasan Murali, Paolo Meloni, Federico Angiolini, David Atienza, Salvatore Carta, Luca Benini, Giovanni De Micheli, Luigi Raffo	Designing Routing and Message-Dependent Deadlock Free Networks on Chips.	VLSI-SoC (Selected Papers)	2006	DBLP DOI BibTeX RDF
17	Y. L. He, G. N. Wang	Petri Nets based Deadlock-free Scheduling for Flexible Manufacturing Systems.	ICARCV	2006	DBLP DOI BibTeX RDF
17	Xin Wang 0003, Yingqun Yu, Georgios B. Giannakis	A Deadlock-Free High-Throughput Tree Algorithm for Random Access over Fading Channels.	CISS	2006	DBLP DOI BibTeX RDF
17	Da-Yin Liao, Paladin Liu	Deadlock-free verification and performance enhancement of RosettaNet PIPs with time Petri nets.	Int. J. Comput. Integr. Manuf.	2005	DBLP DOI BibTeX RDF
17	Jie Wu 0001, Dajin Wang	Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks.	Parallel Algorithms Appl.	2005	DBLP DOI BibTeX RDF
17	Hsien-Ting Kuo, Jiazheng Zhou, Xuan-Yi Lin, Yeh-Ching Chung	An Efficient and Low Overhead Random Forwarding Table Construction Method for Deadlock-Free Routing Algorithms in Infiniband Networks.	IASTED PDCS	2005	DBLP BibTeX RDF
17	M. Gamal Darwish, Ahmed A. Radwan, Mohamed A. Abd El-Baky, Kadry Hamed	GTTPM - An Efficient Deadlock-Free Multicast Wormhold Algorithm for Communication in 2D Torus Multicomputers.	IASTED PDCS	2005	DBLP BibTeX RDF
17	Xiangqiong Shi, Zhiming Wu	Deadlock-Free Scheduling Method for FMSs Using Beam Search.	SMC	2005	DBLP DOI BibTeX RDF
17	Martin K. F. Schafer, Thomas Hollstein, Heiko Zimmer, Manfred Glesner	Deadlock-free routing and component placement for irregular mesh-based networks-on-chip.	ICCAD	2005	DBLP DOI BibTeX RDF
17	Sukhamay Kundu	Deadlock-Free Distributed Relaxed Mutual-Exclusion Without Revoke-Messages.	IWDC	2005	DBLP DOI BibTeX RDF
17	Bilal Zafar 0002, Timothy Mark Pinkston, Aurelio Bermúdez, José Duato	Deadlock-free dynamic reconfiguration over InfiniBandTM NETWORKS.	Parallel Algorithms Appl.	2004	DBLP DOI BibTeX RDF
17	Zhonghua Huang, Zhiming Wu	Deadlock-free scheduling method using genetic algorithm and timed S3/PR nets.	ACC	2004	DBLP DOI BibTeX RDF
17	R. S. Rajesh, S. Arumugam	An Optimistic Deadlock Free Adaptive Wormhole Routing Algorithm for Two Dimensional Meshes.	Communications in Computing	2004	DBLP BibTeX RDF
17	Jie Wu 0001, Li Sheng 0001	Deadlock-Free Routing In Irregular Networks Using Prefix Routing.	Parallel Process. Lett.	2003	DBLP DOI BibTeX RDF
17	Tarek Y. ElMekkawy, Hoda A. ElMaraghy	Efficient search of Petri Nets for deadlock-free scheduling in FMSs using heuristic functions.	Int. J. Comput. Integr. Manuf.	2003	DBLP DOI BibTeX RDF
17	Paola Inverardi, Massimo Tivoli	Deadlock-free software architectures for COM/DCOM Applications.	J. Syst. Softw.	2003	DBLP DOI BibTeX RDF
17	Hamid Reza Golmakani, James K. Mills, Beno Benhabib	Deadlock-Free Scheduling of Flexible Manufacturing Workcells Using Automata Theory.	ICRA	2003	DBLP DOI BibTeX RDF
17	Philip K. F. Hölzenspies, Erik Schepers, Wouter Bach, Mischa Jonker, Bart Sikkes, Gerard J. M. Smit, Paul J. M. Havinga	A Communication Model Based on an n-Dimensional Torus Architecture Using Deadlock-Free Wormhole Routing.	DSD	2003	DBLP DOI BibTeX RDF
17	Hamid Reza Golmakani, James K. Mills, Beno Benhabib	Deadlock-free optimal routing in flexible manufacturing cells via supervisory control theory.	SMC	2003	DBLP DOI BibTeX RDF
17	Da-Yin Liao, Paladin Liu	Deadlock-free verification of RosettaNet PIPs with time Petri nets.	SMC	2003	DBLP DOI BibTeX RDF
17	D. P. Simpson	Deadlock free algorithmic parallelism : analysis, implementation and performance.		2003	RDF
17	Rastislav Kralovic	Efficient Deadlock-free Multidimensional Interval Routing in Hypercube-like Networks.	Comput. Artif. Intell.	2002	DBLP BibTeX RDF
17	Fuh-Hwa Liu, Pi-Chuan Hung	Control Strategy for Dispatching Multi-load Automated Guided Vehicles in a Deadlock-Free Environment.	J. Math. Model. Algorithms	2002	DBLP DOI BibTeX RDF
17	Xiao Jun Chen, Hasan Ural	Construction of Deadlock-free Designs of Communication Protocols from Observation.	Comput. J.	2002	DBLP DOI BibTeX RDF
17	Jenq-Shyan Yang, Chung-Ta King	Designing Deadlock-Free Turn-Restricted Routing Algorithms for Irregular Wormhole-routed Networks.	J. Inf. Sci. Eng.	2001	DBLP BibTeX RDF
17	Vicent Cholvi, Pablo Boronat	A minimal property for characterizing deadlock-free programs.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
17	Hyunmin Park, Dharma P. Agrawal	A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks.	J. Parallel Distributed Comput.	2001	DBLP DOI BibTeX RDF
17	Franco Zambonelli, Robert H. B. Netzer	Deadlock-Free Incremental Replay of Message-Passing Programs.	J. Parallel Distributed Comput.	2001	DBLP DOI BibTeX RDF
17	Yazid Mati, Nidhal Rezg, Xiaolan Xie	A taboo search approach for deadlock-free scheduling of automated manufacturing systems.	J. Intell. Manuf.	2001	DBLP DOI BibTeX RDF
17	Jie Wu 0001, Li Sheng 0001	Deadlock-Free Prefix Multicasting in Irregular Networks.	PDCS	2001	DBLP BibTeX RDF
17	Fu-Shiung Hsieh	Deadlock free task distribution and resource allocation for holonic manufacturing systems based on multi-agent framework.	SMC	2001	DBLP DOI BibTeX RDF
17	Daniel Stefankovic	Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms.	Inf. Process. Lett.	2000	DBLP DOI BibTeX RDF
17	Abhijit Sengupta, Suresh Viswanathan	Deadlock-Free Fault-Tolerant Multicast Routing in Hypercubes.	Parallel Process. Lett.	2000	DBLP DOI BibTeX RDF
17	Ayla Gürel, Stjepan Bogdan, Frank L. Lewis	Matrix approach to deadlock-free dispatching in multi-class finite buffer flowlines.	IEEE Trans. Autom. Control.	2000	DBLP DOI BibTeX RDF
17	A. K. Bandyopadhyay 0001, J. Bandyopadhyay	On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification.	J. Syst. Archit.	2000	DBLP DOI BibTeX RDF
17	H. Moharam, M. A. Abd El-Baky, S. M. M. Nassar	YOMNA - An efficient deadlock-free multicast wormhole algorithm in 2-D mesh multicomputers.	J. Syst. Archit.	2000	DBLP DOI BibTeX RDF
17	Michael D. Lemmon	Deadlock-free piecewise-linear controlled hybrid automata.	CDC	2000	DBLP DOI BibTeX RDF
17	Hyun Joong Yoon, Doo Yong Lee	Deadlock-free scheduling method for track systems in semiconductor fabrication.	SMC	2000	DBLP DOI BibTeX RDF
17	Rocky K. C. Chang, Ho Y. Chan	A throughput deadlock-free TCP for high-speed Internet.	ICON	2000	DBLP DOI BibTeX RDF
17	Naiqi Wu	Necessary and sufficient conditions for deadlock-free operation in flexible manufacturing systems using a colored Petri net model.	IEEE Trans. Syst. Man Cybern. Part C	1999	DBLP DOI BibTeX RDF
17	Michele Flammini	Deadlock-free interval routing schemes.	Networks	1999	DBLP DOI BibTeX RDF
17	Yoshiro Hada, Kunikatsu Takase	A robust and deadlock free navigation of mobile robots based on a task-level feedback control.	IROS	1999	DBLP DOI BibTeX RDF
17	Rastislav Kralovic, Peter Ruzicka	Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing.	SIROCCO	1999	DBLP BibTeX RDF
17	Mustapha Hadim	A Minimal, Deadlock Free and Storage Optimal Routing Algorithm for Torus Networks.	PDPTA	1999	DBLP BibTeX RDF
17	Eijiro Sumii, Naoki Kobayashi 0001	A Generalized Deadlock-Free Process Calculus.	HLCL	1998	DBLP DOI BibTeX RDF
17	Mark A. Firth, Andrew Jones	Deadlock-free interval labelling.	Microprocess. Microsystems	1998	DBLP DOI BibTeX RDF
17	Naoki Kobayashi 0001	A Partially Deadlock-Free Typed Process Calculus.	ACM Trans. Program. Lang. Syst.	1998	DBLP DOI BibTeX RDF	concurrency, type theory, deadlock-freedom
17	Imed Ben Abdallah, Hoda A. ElMaraghy, Tarek Y. ElMekkawy	An Efficient Search Algorithm for Deadlock-Free Scheduling in FMS Using Petri Nets.	ICRA	1998	DBLP DOI BibTeX RDF
17	Carmen Carrión 0001, Cruz Izu, José A. Gregorio, Fernando Vallejo, Ramón Beivide	Ghost packets: a deadlock-free solution for k-ary n-cube networks.	PDP	1998	DBLP DOI BibTeX RDF
17	Imed Ben Abdallah, Tarek Y. ElMekkawy, Hoda A. ElMaraghy	On deadlock-free scheduling in FMS.	SMC	1998	DBLP DOI BibTeX RDF
17	MuDer Jeng, Wan Der Chiou, YuanLin Wen	Deadlock-free scheduling of flexible manufacturing systems based on heuristic search and Petri net structures.	SMC	1998	DBLP DOI BibTeX RDF
17	Ambrose Kofi Laing, Robert Cypher	Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method.	SPAA	1998	DBLP DOI BibTeX RDF
17	Yonghua Li	On deadlock-free modular supervisory control of discrete-event systems.	IEEE Trans. Autom. Control.	1997	DBLP DOI BibTeX RDF
17	Hyunmin Park, Dharma P. Agrawal	Efficient Deadlock-Free Wormhole Routing and Virtual-Channel Reduction in Shuffle-Based Networks.	J. Parallel Distributed Comput.	1997	DBLP DOI BibTeX RDF
17	Huanxin Henry Xiong, Mengchu Zhou	Deadlock-free scheduling of an automated manufacturing system based on Petri nets.	ICRA	1997	DBLP DOI BibTeX RDF
17	Antonio Robles, José Duato	Multilink extension to support deadlock-free adaptive non-minimal routing.	PDP	1997	DBLP BibTeX RDF
17	Stephan Kleuker	Incremental Development of Deadlock-Free Communicating Systems.	TACAS	1997	DBLP DOI BibTeX RDF
17	Ji-Yun Kirn, José Duato, Jung Wan Cho	Channel Bypassing: A Deadlock-Free Flow Control Policy for Adaptive Routing in Wormhole Networks.	PDPTA	1997	DBLP BibTeX RDF
17	Loren Schwiebert	Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies.	SPAA	1997	DBLP DOI BibTeX RDF
17	W. David Crowe, Peter E. D. Strain-Clark	Deadlock-free completely connected networks: towards a π-calculus approach.	Softw. Eng. J.	1996	DBLP DOI BibTeX RDF
17	Takashi Yoshioka, Hiroshi Noborio	Sensor-Based Traffic Rules for Multiple Automata Based on a Geometric Deadlock-Free Characteristic.	J. Robotics Mechatronics	1996	DBLP DOI BibTeX RDF
17	Patrick T. Gaughan, Binh Vien Dao, Sudhakar Yalamanchili, David E. Schimmel	Distributed Deadlock-Free Routing in Faulty, Pipelined, Direct Interconnection Networks.	IEEE Trans. Computers	1996	DBLP DOI BibTeX RDF
17	Chien-Chun Su, Kang G. Shin	Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes.	IEEE Trans. Computers	1996	DBLP DOI BibTeX RDF
17	Loren Schwiebert, Doddaballapur Narasimha-Murthy Jayasimha	A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing.	J. Parallel Distributed Comput.	1996	DBLP DOI BibTeX RDF
17	Sanjay E. Ramaswamy, Sanjay B. Joshi	Deadlock-free schedules for automated manufacturing workstations.	IEEE Trans. Robotics Autom.	1996	DBLP DOI BibTeX RDF
17	Silvia M. Müller, Wolfgang J. Paul	Making the Original Scoreboard Mechanism Deadlock Free.	ISTCS	1996	DBLP BibTeX RDF
17	Mohamed E. El-Sharkawi, Hossam S. Hassanein	Conservation Locking for Nested Transactions is not Deadlock-Free.	CODAS	1996	DBLP BibTeX RDF
17	Doddaballapur Narasimha-Murthy Jayasimha, D. Manivannan 0001, Jeff A. May, Loren Schwiebert, Stephen L. Hary	A foundation for designing deadlock-free routing algorithms in wormhole networks.	SPDP	1996	DBLP DOI BibTeX RDF
17	Jeffrey T. Draper	The Red Rover Algorithm for Deadlock-Free Routing on Bidirectional Rings.	PDPTA	1996	DBLP BibTeX RDF
17	Jeremy Malcolm Randolph Martin	The design and construction of deadlock-free concurrent systems.		1996	RDF
17	Gil Utard, Gaétan Hains	Deadlock-Free Absorption of Barrier Synchronisations.	Inf. Process. Lett.	1995	DBLP DOI BibTeX RDF
17	Pedro López 0001, José Duato	Deadlock-Free Fully-Adaptive Minimal Routing Algorithms: Limitations and Solutions.	Comput. Artif. Intell.	1995	DBLP BibTeX RDF
17	Gerard J. M. Smit, Paul J. M. Havinga, Walter H. Tibboel	Virtual Lines, a Deadlock-Free and Real-Time Routing Mechanism for ATM Networks.	Inf. Sci.	1995	DBLP DOI BibTeX RDF
17	Seungjin Park	Adaptive Deadlock-Free Wormhole Routing in Faulty Hypercubes.	Parallel and Distributed Computing and Systems	1995	DBLP BibTeX RDF
17	Robert Cypher	Minimal, deadlock-free routing in hypercubic and arbitrary networks.	SPDP	1995	DBLP DOI BibTeX RDF
17	Hyunmin Park, Dharma P. Agrawal	Efficient deadlock-free wormhole routing in shuffle based networks.	SPDP	1995	DBLP DOI BibTeX RDF
17	Johan Vounckx, Geert Deconinck, Rudy Lauwereins	A Compact Fault-tolerant, Deadlock-free, Minimal Routing Algorithm for n-Dimensional Wormhole Switching Based Meshes.	SIROCCO	1995	DBLP BibTeX RDF
17	M. B. Hadim, Ibrahima Sakho	Minimal, Deadlock Free and o(n) Space Memory Routing for k-ary n-cubes with Wraparound Connections.	PDPTA	1995	DBLP BibTeX RDF
17	Loren Schwiebert, Doddaballapur Narasimha-Murthy Jayasimha	A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks.	SPAA	1995	DBLP DOI BibTeX RDF
17	Robert Cypher, Luis Gravano	Requirements for Deadlock-Free, Adaptive Packet Routing.	SIAM J. Comput.	1994	DBLP DOI BibTeX RDF
17	Takashi Yoshioka, Hiroshi Noborio	On a proof of the deadlock-free property in an on-line path-planning by using world topology.	IROS	1994	DBLP DOI BibTeX RDF
17	Ziqiang Liu, Andrew A. Chien	Hierarchical adaptive routing: a framework for fully adaptive and deadlock-free wormhole routing.	SPDP	1994	DBLP DOI BibTeX RDF
17	Chiu-Chuan Lin, Ferng-Ching Lin	Minimal turn restrictions for designing deadlock-free adaptive routing.	SPDP	1994	DBLP DOI BibTeX RDF
17	Hiroshi Noborio, Takashi Yoshioka	On a Deadlock-free Characteristic of the On-line and Decentralized Path-planning for Multiple Automata.	DARS	1994	DBLP DOI BibTeX RDF
17	José Duato, V. B. Dao, Patrick T. Gaughan, Sudhakar Yalamanchili	Scouting: Fully Adaptive, Deadlock-Free Routing in Faulty Pipelined Networks.	ICPADS	1994	DBLP DOI BibTeX RDF
17	José Duato	A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks.	ICPP (1)	1994	DBLP DOI BibTeX RDF
17	Sesh Venugopal, Vijay K. Naik	Deadlock Free Asynchronous Communication Strategies for Unstructured Computations on iPSC/860.	ICPP (1)	1994	DBLP DOI BibTeX RDF
17	George R. Ribeiro-Justo, Paulo Roberto Freire Cunha	Deadlock-free configuration programming.	CDS	1994	DBLP DOI BibTeX RDF
17	José Duato	On the Design of Deadlock-Free Adaptive Multicast Routing Algorithms.	Parallel Process. Lett.	1993	DBLP DOI BibTeX RDF
17	Jong Kim 0001, Kang G. Shin	Deadlock-Free Fault-Tolerant Routing in Injured Hypercubes.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF
17	Hiroshi Noborio, Takashi Yoshioka	An on-line and deadlock-free path-planning algorithm based on world topology.	IROS	1993	DBLP DOI BibTeX RDF
17	José Duato	A New Theory of Deadlock-free Adaptive Multicast Routing in Wormhole Networks.	SPDP	1993	DBLP DOI BibTeX RDF
17	Chien-Chun Su, Kang G. Shin	Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel.	ICPP (1)	1993	DBLP DOI BibTeX RDF
17	Mario Cannataro, Giandomenico Spezzano, Domenico Talia, E. Gallizzi	Design, implementation and evaluation of a deadlock-free routing algorithm for concurrent computers.	Concurr. Pract. Exp.	1992	DBLP DOI BibTeX RDF
17	Keisuke Sato	Deadlock-free motion planning using the Laplace potential field.	Adv. Robotics	1992	DBLP DOI BibTeX RDF
17	Hiroshi Noborio	A sufficient condition for designing a family of sensor-based deadlock-free path-planning algorithms.	Adv. Robotics	1992	DBLP DOI BibTeX RDF
17	Qiang Li	Minimum Deadlock-Free Message Routing Restrictions in Binary Hypercubes.	J. Parallel Distributed Comput.	1992	DBLP DOI BibTeX RDF
17	William Edwin Clark, Gregory L. McColm, W. Richard Stark	On the Complexity of Deadlock-Free Programs on a Ring of Processors.	J. Parallel Distributed Comput.	1992	DBLP DOI BibTeX RDF
17	George A. Grover, Jeffrey M. Jaffe	Standoff and standoff resolution in deadlock free networks with virtual circuits.	IEEE Trans. Commun.	1992	DBLP DOI BibTeX RDF