This paper describes algorithms for interval labelling packet-switching networks. The central algorithm produces a labelling which optimises the path length of routings. This labelling can then be modified, if necessary, to produce one which excludes the possibility of deadlock. The algorithm is ...
In this paper a new switching technique called virtual cut-through is proposed and its performance is analyzed. This switching system is very similar to message switching, with the difference that when a message arrives in an intermediat... KL Kleinrock - 《Computer Networks》 被引量: 1592发表...
Moreover, MCC improves 10% performance with similar area and power, compared to packet-switching architecture with virtual channels. Introduction Nowadays, many-core systems have been the mainstream solution to improve the performance and power efficiency for both general purpose chip multiprocessors (...
(command=COM_QUERY, thd=0x3eae310, packet=0x3eb0db1 "KILL QUERY 3", packet_length=12) at sql_parse.cc:1233 #10 0x000000000064f5b1 in do_command (thd=0x3eae310) at sql_parse.cc:874 #11 0x000000000063b89b in handle_one_connection (arg=0x3eae310) at sql_connect.cc:1134 #12 0x...
6047331 Method and apparatus for automatic protection switching 2000-04-04 Medard et al. 5732072 Method for adaptive routing in a communication network 1998-03-24 Thanner et al. 5491690 Method and apparatus to speed up the path selection in a packet switching network 1996-02-13 Alfonsi et al...
Other attempts have been made to provide interprocessor switching networks that solve the deadlock problem. The use of control circuitry as part of a regularly-structured message passing network is described in U.S. Pat. Nos. 5,058,001, 5,105,424 and 5,291,489. The problem of deadlocks ...
PURPOSE:To simplify connection constitution and control, and to speed up the operation of a packet exchange and accelerate an increase in capacity by providing each transmission line with a connection path only at a switching unit and connecting the transmission line to a controller through the ...
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 analyse the deadlock in communication networks. The deadlock-free routing algorithm is the first to automatically check a necessary and sufficient ...
Deadlock-Free Routing in Irregular Networks Using Prefix Routing - Wu, Sheng - 1999 () Citation Context ...fix routing [14], Left/Right routing [8], L-turn routing [8], Layered routing [9], The source of Deadlock among the packet is a cyclic dependency between the busy and requested...
Multicast packets are routed and scheduled in the NoC by using a flexible multiplexing/interleaving technique with wormhole switching. The flexibility of the proposed multicast routing method is based on a locally managed packet identity (ID-tag) attached to every flit. This concept allows different ...