Log in

Relevant bibliographies by topics / Routing Deadlocks / Journal articles

Journal articles on the topic 'Routing Deadlocks'

To see the other types of publications on this topic, follow the link: Routing Deadlocks.

Author: Grafiati

Published: 10 December 2022

Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Routing Deadlocks.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Verma, Renu, Mohammad Ayoub Khan, and Amit Zinzuwadiya. "Power and Latency Optimized Deadlock-Free Routing Algorithm on Irregular 2D Mesh NoC using LBDRe." International Journal of Embedded and Real-Time Communication Systems 4, no. 2 (April 2013): 36–49. http://dx.doi.org/10.4018/jertcs.2013040102.

Full text

Abstract:

Efficient routing is challenging and crucial problem in the irregular mesh NoC topologies because of increasing hardware cost and routing tables. In this paper, the authors propose an efficient deadlock-free routing algorithm for irregular mesh NoCs which reduces the latency and power consumption significantly. The problem with degree priority based routing algorithm is that it cannot remove deadlocks in irregular mesh topologies. Therefore, the authors use the extended Logic Based Distributed Routing (LBDRe) to remove deadlock situations without using any virtual channel in the degree priority based routing algorithm. The proposed LBDRe based technique also removes the dependency on routing tables. The authors further apply odd-Even routing algorithm to LBDRe to ensure that some turns are prohibited to remove deadlocks. Experimental results show that the proposed routing algorithm reduces power consumption by 9–22% and overall average latency by 8–12% with the minimum hardware cost for the irregular mesh NoC topologies.

APA, Harvard, Vancouver, ISO, and other styles

2

Romanov, Aleksandr Y., Nikolay M. Myachin, Evgenii V. Lezhnev, Alexander D. Ivannikov, and Ahmed El-Mesady. "Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip." Micromachines 14, no. 1 (January 5, 2023): 141. http://dx.doi.org/10.3390/mi14010141.

Full text

Abstract:

This article considers the usage of circulant topologies as a promising deadlock-free topology for networks-on-chip (NoCs). A new high-level model, Newxim, for the exploration of NoCs with any topology is presented. Two methods for solving the problem of cyclic dependencies in circulant topologies, which limit their applications for NoCs due to the increased possibility of deadlocks, are proposed. The first method of dealing with deadlocks is universal and applicable to any topology; it is based on the idea of bypassing blocked sections of the network on an acyclic subnetwork. The second method—Ring-Split—takes into account the features of circulant topologies. The results of high-level modeling and comparison of the peak throughput of NoCs for circulant and mesh topologies using deadlock-free routing algorithms are presented. It was shown that a new approach for routing in circulants (compared to mesh topology) shows up to 59% better network throughput with a uniform distribution of network load.

APA, Harvard, Vancouver, ISO, and other styles

3

KHONSARI, A., H. SARBAZI-AZAD, and M. OULD-KHAOUA. "A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes." Parallel Processing Letters 15, no. 01n02 (March 2005): 153–68. http://dx.doi.org/10.1142/s012962640500212x.

Full text

Abstract:

Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

APA, Harvard, Vancouver, ISO, and other styles

4

., Elavarasi, and G. Raja. "A Necessary and Sufficient Condition for Deadlock-Free Message Routing in Communication Networks." International Journal of Advance Research and Innovation 3, no. 2 (2015): 23–26. http://dx.doi.org/10.51976/ijari.321506.

Full text

Abstract:

Deadlocks are an important issue in the design and analysis of communication networks. Wormhole switching is a popular switching technique in direct networks. It refers to a simple flow control system in computer network that is primarily based on fixed links. It also reduces the latency and storage requirements on each node. Deadlock analysis of routing function is a manual and complex task. In the absence of contention, latencies are proportional to the sum of the packet length and the distances to travel. We propose an algorithm to analyze the deadlock in communication networks. The deadlock-free routing algorithm is the first to automatically check a necessary and sufficient condition for deadlock-free routing. Our algorithm performs Effective analysis in this network.

APA, Harvard, Vancouver, ISO, and other styles

5

KHONSARI, A., A. SHAHRABI, and M. OULD-KHAOUA. "A PERFORMANCE MODEL OF DISHA ROUTING IN K-ARY N-CUBE NETWORKS." Parallel Processing Letters 17, no. 02 (June 2007): 213–28. http://dx.doi.org/10.1142/s0129626407002971.

Full text

Abstract:

A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance, e.g. Duato's routing. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable improvement in network performance. Disha is an example of a true fully adaptive routing algorithm that uses minimal hardware to implement a simple and efficient progressive method to recover from potential deadlocks. This paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various networks sizes and under different traffic conditions.

APA, Harvard, Vancouver, ISO, and other styles

6

Shrivastava, Anurag, and Sudhir Kumar Sharma. "Efficient bus based router for NOC architecture." World Journal of Engineering 13, no. 4 (August 1, 2016): 370–75. http://dx.doi.org/10.1108/wje-08-2016-049.

Full text

Abstract:

Purpose Increase in the speed of processors has led to crucial role of communication in the performance of systems. As a result, routing is taken into consideration as one of the most important subjects of the network-on-chip (NOC) architecture. Routing algorithms to deadlock avoidance prevent packets route completely based on network traffic condition by means of restricting the route of packets. This action leads to less performance especially in non-uniform traffic patterns. On the other hand, true fully adaptive routing algorithm provides routing of packets completely based on traffic conditions. However, deadlock detection and recovery mechanisms are needed to handle deadlocks. Use of a global bus beside NOC as a parallel supportive environment provides a platform to offer advantages of both features of bus and NOC. Design/methodology/approach In this research, the authors use this bus as an escaping path for deadlock recovery technique. Findings According to simulation results, this bus is a suitable platform for a deadlock recovery technique. Originality/value This bus is useful for broadcast and multicast operations, sending delay sensitive signals, system management and other services.

APA, Harvard, Vancouver, ISO, and other styles

7

Boppana, R. V., S. Chalasani, and C. S. Raghavendra. "Resource deadlocks and performance of wormhole multicast routing algorithms." IEEE Transactions on Parallel and Distributed Systems 9, no. 6 (June 1998): 535–49. http://dx.doi.org/10.1109/71.689441.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Dimopoulos, N. J., and R. Sivakumar. "Deadlock-preventing routing in hypercycles." Canadian Journal of Electrical and Computer Engineering 19, no. 4 (October 1994): 193–99. http://dx.doi.org/10.1109/cjece.1994.6591123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Flammini, Michele. "Deadlock-free interval routing schemes." Networks 34, no. 1 (August 1999): 47–60. http://dx.doi.org/10.1002/(sici)1097-0037(199908)34:1<47::aid-net5>3.0.co;2-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

WU, JIE, and LI SHENG. "DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING." Parallel Processing Letters 13, no. 04 (December 2003): 705–20. http://dx.doi.org/10.1142/s0129626403001616.

Full text

Abstract:

We propose a deadlock-free routing scheme in irregular networks using prefix routing. Prefix routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular network is done through constructing a spanning tree. The routing process follows a two-phase process of going up and then down along the spanning tree, with a possible cross channel (shortcut) between two branches of the tree between two phases. We show that the proposed routing scheme is deadlock- and livelock-free. We also compare prefix routing with the existing up*/down* routing which has been widely used in irregular networks. Possible extensions are also discussed.

APA, Harvard, Vancouver, ISO, and other styles

11

DI IANNI, MIRIAM. "WORMHOLE DEADLOCK PREDICTION." Parallel Processing Letters 10, no. 04 (December 2000): 295–303. http://dx.doi.org/10.1142/s0129626400000287.

Full text

Abstract:

Deadlock prevention is usually realized by forbidding transmissions that could eventually cause a deadlock to occur. However, an optimal routing algorithm with respect to channel utilization forbids transmissions only when they would bring the network into a configuration that will necessarily evolve into a deadlock. Hence, optimal deadlock prevention is closely related to deadlock prediction. In this paper it is shown that wormhole deadlock and livelock prediction is a hard problem for both oblivious and adaptive routing.

APA, Harvard, Vancouver, ISO, and other styles

12

BOVET, DANIEL P., MIRIAM DI IANNI, and PIERLUIGI CRESCENZI. "DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING." International Journal of Foundations of Computer Science 01, no. 03 (September 1990): 185–99. http://dx.doi.org/10.1142/s012905419000014x.

Full text

Abstract:

One of the main issues in flow control problems is deadlock of messages caused by a limited amount of resources. In this paper, the problem of predicting whether a deadlock will necessarily occur in a Store-and-Forward Network is analyzed. We show that, in the case of dynamic routing, the deadlock prediction problem can be decided in polynomial time if tokens are allowed to transit more than once through the same vertex, in contrast with an NP-completeness result in the case where they are allowed to transit at most once.

APA, Harvard, Vancouver, ISO, and other styles

13

Olenev, Valentin, and Alexandr Karandashev. "Configuring Methods for Deadlock-Free Routing." International Journal of Embedded and Real-Time Communication Systems 13, no. 1 (January 2022): 1–20. http://dx.doi.org/10.4018/ijertcs.289199.

Full text

Abstract:

This paper discusses the problem of tracking of deadlock-free routes. A brief overview of existing software tools providing this functionality is given. A complete overview of the proposed software for building routes for given SpaceWire onboard networks is presented. The paper discusses the application of different existing methods for the choosing of the best route from the list of the deadlock-free routes. A brief overview of the methods for of choosing the best route according to the provided criteria is given. A new method for choosing of the best route and its modification is proposed. Authors provide the result of the methods application and the detailed comparison.

APA, Harvard, Vancouver, ISO, and other styles

14

Kinsy, Michel A., Myong Hyon Cho, Tina Wen, Edward Suh, Marten van Dijk, and Srinivas Devadas. "Application-aware deadlock-free oblivious routing." ACM SIGARCH Computer Architecture News 37, no. 3 (June 15, 2009): 208–19. http://dx.doi.org/10.1145/1555815.1555782.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Tsai, Ming-Jer. "Fault-Tolerant Routing in Wormhole Meshes." Journal of Interconnection Networks 04, no. 04 (December 2003): 463–95. http://dx.doi.org/10.1142/s0219265903000970.

Full text

Abstract:

In wormhole meshes, many a routing algorithm prevents a deadlock by enclosing unlimited number of faulty nodes with faulty blocks and dividing a physical interconnection network into a fixed number of virtual ones; none of them, however, is able to tolerate two faulty blocks with a distance of two, no less, in at least one dimension by use of only two virtual interconnection networks. To fill this gap, an adaptive and fault-tolerant routing algorithm is proposed. The algorithm is fully-adaptive until encountering a faulty block. It then detours the blocked message around the faulty block. Arranging the detours around faulty blocks attempts to prevent a deadlock. The proposed method has no need for global information.

APA, Harvard, Vancouver, ISO, and other styles

16

Cypher, Robert, and Luis Gravano. "Requirements for Deadlock-Free, Adaptive Packet Routing." SIAM Journal on Computing 23, no. 6 (December 1994): 1266–74. http://dx.doi.org/10.1137/s0097539792231830.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Hilbers, Peter A. J., and Johan J. Lukkien. "Deadlock-free message routing in multicomputer networks." Distributed Computing 3, no. 4 (December 1989): 178–86. http://dx.doi.org/10.1007/bf01784886.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

ARRUABARRENA, A., R. BEIVIDE, C. IZU, and J. MIGUEL. "A PERFORMANCE EVALUATION OF ADAPTIVE ROUTING IN BIDIMENSIONAL CUT-THROUGH NETWORKS." Parallel Processing Letters 03, no. 04 (December 1993): 469–84. http://dx.doi.org/10.1142/s0129626493000496.

Full text

Abstract:

The performance of the communication network of a massively parallel processor depends, among other parameters, on the network topology, the message flow control and the routing mechanisms. This paper analyses the gains in average message latency and maximum sustained throughput that can be achieved using an adaptive routing strategy instead of an oblivious one. Two different bidimensional topologies have been studied, mesh and torus, using cut-through message flow control. First, we have simulated an ideal case in which there is no limit to the temporary storage capacity of the routing node. Then, a more realistic design, that implies the implementation of a deadlock avoidance technique, is analysed. To assure deadlock-free routing, the network is split into several virtual networks. Results show that adaptive routing is not a good election with this kind of networks. The torus topology shows potentially better results than the mesh. In any case, a different deadlock avoidance technique should be implemented if these potential gains are to be exploited.

APA, Harvard, Vancouver, ISO, and other styles

19

Kalaivani, J., and B. Vinayagasundaram. "Deadlock Free Load Balanced Adaptive Routing for Network on Chip (NoC) Systems." Journal of Computational and Theoretical Nanoscience 13, no. 10 (October 1, 2016): 7592–98. http://dx.doi.org/10.1166/jctn.2016.5757.

Full text

Abstract:

The Network-on-Chip (NoC) systems have emerged in on-chip communication architecture in various fields. To achieve excellent results in Network on Chip (NoC) systems application, the routing must eliminate the deadlock issues from the network. To overcome this issue in the network, in this paper, we propose Deadlock Free Load Balanced Adaptive Routing. In this approach, Oblivious Routing (OR) algorithm is implemented on the channel by using the probability function. The network considers the capacity of the node and tries to maximize the throughput based on the connectivity between the data packets flow and minimize the channel load. A Reconfiguration Protocol is used for the data packets to choose other channel in the network if the deadlock occurs. Simulation results show that this approach reduces the delay and packet loss in the network.

APA, Harvard, Vancouver, ISO, and other styles

20

Zhou, Jiazheng, and Yeh-Ching Chung. "Tree-turn routing: an efficient deadlock-free routing algorithm for irregular networks." Journal of Supercomputing 59, no. 2 (September 9, 2010): 882–900. http://dx.doi.org/10.1007/s11227-010-0477-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

SENGUPTA, ABHIJIT, and SURESH VISWANATHAN. "DEADLOCK-FREE FAULT-TOLERANT MULTICAST ROUTING IN HYPERCUBES." Parallel Processing Letters 10, no. 04 (December 2000): 327–42. http://dx.doi.org/10.1142/s0129626400000317.

Full text

Abstract:

In this paper, an algorithm is presented to embedd a ring in an n-dimensional hypercube with at most n-1 faults; subsequently, the embedded ring is used for efficient deadlock-free multicast routing between all the fault-free nodes. Simulation results are presented to compare the performance of the algorithm to that of the routing algorithm proposed in [9] for a fault-free hypercube to study the performance degradation because of faults. A modification to the algorithm of [9] is also presented for improved performance.

APA, Harvard, Vancouver, ISO, and other styles

22

Lawley, M. A. "Deadlock avoidance for production systems with flexible routing." IEEE Transactions on Robotics and Automation 15, no. 3 (June 1999): 497–509. http://dx.doi.org/10.1109/70.768182.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Dally and Seitz. "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks." IEEE Transactions on Computers C-36, no. 5 (May 1987): 547–53. http://dx.doi.org/10.1109/tc.1987.1676939.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Corradi, Antonio, and Cesare Stefanelli. "A deadlock prevention strategy for adaptive routing systems." Microprocessors and Microsystems 20, no. 2 (April 1996): 97–103. http://dx.doi.org/10.1016/0141-9331(95)01077-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Lin, Xiaola, and Lionel M. Ni. "Deadlock-free multicast wormhole routing in multicomputer networks." ACM SIGARCH Computer Architecture News 19, no. 3 (May 1991): 116–25. http://dx.doi.org/10.1145/115953.115965.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Schwiebert, L. "Deadlock-free oblivious wormhole routing with cyclic dependencies." IEEE Transactions on Computers 50, no. 9 (2001): 865–76. http://dx.doi.org/10.1109/12.954503.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Kim, J., and K. G. Shin. "Deadlock-free fault-tolerant routing in injured hypercubes." IEEE Transactions on Computers 42, no. 9 (1993): 1078–88. http://dx.doi.org/10.1109/12.241597.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

DUATO, JOSÉ. "ON THE DESIGN OF DEADLOCK-FREE ADAPTIVE MULTICAST ROUTING ALGORITHMS." Parallel Processing Letters 03, no. 04 (December 1993): 321–33. http://dx.doi.org/10.1142/s0129626493000368.

Full text

Abstract:

Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. Two multicast wormhole routing methods have been presented in [13] for multicomputers with 2D-mesh and hypercube topologies. Also, a theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in [7, 8]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. This paper analyses the additional channel dependencies produced by multicast routing algorithms on wormhole networks. Then, the theory proposed in [7, 8] is extended by considering them. As an example, the multicast routing algorithms presented in [13] are extended, taking advantage of the alternative paths offered by the network.

APA, Harvard, Vancouver, ISO, and other styles

29

DUATO, JOSÉ. "CHANNEL CLASSES: A NEW CONCEPT FOR DEADLOCK AVOIDANCE IN WORMHOLE NETWORKS." Parallel Processing Letters 02, no. 04 (December 1992): 347–54. http://dx.doi.org/10.1142/s0129626492000490.

Full text

Abstract:

In previous papers, we have developed the theoretical background for the design of deadlock-free adaptive routing algorithms for store-and-forward and wormhole networks. Some definitions and theorems have been proposed, developing conditions to verify that an adaptive algorithm is deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies have been proposed. In this paper, we propose a partial order between channels as well as an equivalence relation. This relation splits the set of channels into equivalence classes. Then, we extend our previous theory by considering equivalence classes (channel classes) instead of channels. This extension drastically simplifies the verification of deadlock freedom for adaptive routing algorithms with cyclic dependencies between channels. Finally, we present an example.

APA, Harvard, Vancouver, ISO, and other styles

30

Khonsari, A., A. Shahrabi, M. Ould-Khaoua, and H. Sarbazi-Azad. "Performance comparison of deadlock recovery and deadlock avoidance routing algorithms in wormhole-switched networks." IEE Proceedings - Computers and Digital Techniques 150, no. 2 (2003): 97. http://dx.doi.org/10.1049/ip-cdt:20030279.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Lee, Wan Y., Sung Je Hong, and Jong Kim. "On the Configuration of Switch-Based Networks with Wormhole Routing." Journal of Interconnection Networks 01, no. 02 (June 2000): 95–114. http://dx.doi.org/10.1142/s021926590000007x.

Full text

Abstract:

In this paper we investigate the configuration of switches suitable for high performance communication, and propose communication schemes which exploit the structural strengths of that configuration. In switch-based networks, communication performance heavily depends on the configuration of switches and communication schemes for the networks. The deadlock problem caused by wormhole routing is another crucial factor affecting communication performance. Thus, we first evaluate several candidate configurations in terms of deadlock avoidance, scalability, flexibility, cost, and network properties (bandwidth, diameter, and average distance), and verify that the incomplete fat tree is the most promising configuration. Next, we show how to implement a routing algorithm and a unicast-based multicast algorithm on the incomplete fat tree configuration. The routing algorithm always finds a shortest path and fully utilizes network resources without using a routing tables. The multicast algorithm is optimal in that it is contention-free and requires a minimum number of communication steps.

APA, Harvard, Vancouver, ISO, and other styles

32

Choe, Ri, Tae-Jin Park, and Kwang-Ryel Ryu. "Deadlock-free Routing of an AGV in Accelerated Motion." Journal of Korean navigation and port research 30, no. 10 (December 31, 2006): 855–60. http://dx.doi.org/10.5394/kinpr.2006.30.10.855.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Ravikumar, C. P., and A. M. Goel. "Deadlock-free wormhole routing algorithms for star graph topology." IEE Proceedings - Computers and Digital Techniques 142, no. 6 (1995): 395. http://dx.doi.org/10.1049/ip-cdt:19952221.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Boppana, R. V., and S. Chalasani. "A framework for designing deadlock-free wormhole routing algorithms." IEEE Transactions on Parallel and Distributed Systems 7, no. 2 (1996): 169–83. http://dx.doi.org/10.1109/71.485506.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Wu, Jie, and Li Sheng. "Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing." Journal of Supercomputing 31, no. 1 (January 2005): 63–78. http://dx.doi.org/10.1023/b:supe.0000049325.58858.72.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Pinkston, T. M. "Flexible and efficient routing based on progressive deadlock recovery." IEEE Transactions on Computers 48, no. 7 (July 1999): 649–69. http://dx.doi.org/10.1109/12.780873.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Li, Qiang. "Minimum deadlock-free message routing restrictions in binary hypercubes." Journal of Parallel and Distributed Computing 15, no. 2 (June 1992): 153–59. http://dx.doi.org/10.1016/0743-7315(92)90107-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Row, Ter-Chan, and Yen-Liang Pan. "Maximally permissive deadlock prevention policies for flexible manufacturing systems using control transition." Advances in Mechanical Engineering 10, no. 7 (July 2018): 168781401878740. http://dx.doi.org/10.1177/1687814018787406.

Full text

Abstract:

Nowadays, many kinds of flexible manufacturing systems are used to process many complex manufacturing works due to their machine flexibility and routing flexibility. However, such competition (i.e. robots and machines) for shared resources by concurrent job processes can lead to the problem of a system deadlock. In existing researches, almost experts adopted place-based as controllers to solve the deadlock problems of flexible manufacturing systems whatever the concept of siphons or the reachability graph method are used. Among them, only the reachability graph ones can obtain maximally permissive live states. In this article, the authors try to propose one novel transition-based deadlock prevention concept to solve flexible manufacturing system’s deadlock problem. In addition, two algorithms are developed to support above concept. The experimental results indicate that the proposed policy not only can obtain maximally permissive controllers but also recover all original deadlock markings.

APA, Harvard, Vancouver, ISO, and other styles

39

Wang, Hao, and Ling Wu. "Design and Simulation of Multicast Communication Model Based on 2D Torus Network on Chip." Advanced Materials Research 630 (December 2012): 276–82. http://dx.doi.org/10.4028/www.scientific.net/amr.630.276.

Full text

Abstract:

In order to avoid the deadlock and high transmission delay of network on chip in multicast communication, this paper put forward a solution of multicast communication model. First, the author carried out a formalized description for the multicast communication model. Secondly, illustrate the deadlock caused by the loop circuit waiting. To solve this problem, the NOC multicast communication model was proposed based on the 2D Torus topology. In addition, this paper also presented an example to validate its correctness. Finally, simulate and apply this model simulation to the NOC of 2D Torus topology structure by the OPNET Modeler. The test results show that this multicast communication model has lower transmission delay and higher throughput volume compared with the unicast routing strategy using XY routing.

APA, Harvard, Vancouver, ISO, and other styles

40

Dally, W. J., and H. Aoki. "Deadlock-free adaptive routing in multicomputer networks using virtual channels." IEEE Transactions on Parallel and Distributed Systems 4, no. 4 (April 1993): 466–75. http://dx.doi.org/10.1109/71.219761.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Xiaola Lin, P. K. McKinley, and L. M. Ni. "Deadlock-free multicast wormhole routing in 2-D mesh multicomputers." IEEE Transactions on Parallel and Distributed Systems 5, no. 8 (1994): 793–804. http://dx.doi.org/10.1109/71.298203.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Pifarre, G. D., L. Gravano, G. Denicolay, and J. L. C. Sanz. "Adaptive deadlock- and livelock-free routing in the hypercube network." IEEE Transactions on Parallel and Distributed Systems 5, no. 11 (1994): 1121–39. http://dx.doi.org/10.1109/71.329674.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Xiang, Dong, and Xiaowei Liu. "Deadlock-Free Broadcast Routing in Dragonfly Networks without Virtual Channels." IEEE Transactions on Parallel and Distributed Systems 27, no. 9 (September 1, 2016): 2520–32. http://dx.doi.org/10.1109/tpds.2015.2503746.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Wei Luo and Dong Xiang. "An Efficient Adaptive Deadlock-Free Routing Algorithm for Torus Networks." IEEE Transactions on Parallel and Distributed Systems 23, no. 5 (May 2012): 800–808. http://dx.doi.org/10.1109/tpds.2011.145.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Verbeek, Freek, and Julien Schmaltz. "A Decision Procedure for Deadlock-Free Routing in Wormhole Networks." IEEE Transactions on Parallel and Distributed Systems 25, no. 8 (August 2014): 1935–44. http://dx.doi.org/10.1109/tpds.2013.121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Turner, Yoshio, and Yuval Tamir. "Deadlock-free connection-based adaptive routing with dynamic virtual circuits." Journal of Parallel and Distributed Computing 67, no. 1 (January 2007): 13–32. http://dx.doi.org/10.1016/j.jpdc.2006.08.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Cypher, R., and L. Gravano. "Storage-efficient, deadlock-free packet routing algorithms for torus networks." IEEE Transactions on Computers 43, no. 12 (1994): 1376–85. http://dx.doi.org/10.1109/12.338097.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Gaughan, P. T., B. V. Dao, S. Yalamanchili, and D. E. Schimmel. "Distributed, deadlock-free routing in faulty, pipelined, direct interconnection networks." IEEE Transactions on Computers 45, no. 6 (June 1996): 651–65. http://dx.doi.org/10.1109/12.506422.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Chien-Chun Su and K. G. Shin. "Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes." IEEE Transactions on Computers 45, no. 6 (June 1996): 666–83. http://dx.doi.org/10.1109/12.506423.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Chung, Jai-Hoon, Hyunsoo Yoon, and Seung Ryoul Maeng. "A new deadlock prevention scheme for nonminimal adaptive wormhole routing." Microprocessing and Microprogramming 40, no. 7 (October 1994): 465–86. http://dx.doi.org/10.1016/0165-6074(94)90011-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!