IEEE Transactions on Control of Network Systems, 2014
ABSTRACT In this paper, we consider the problem of constructing minimal cycle-breaking connectivi... more ABSTRACT In this paper, we consider the problem of constructing minimal cycle-breaking connectivity preserving sets of turns for graphs that model communication networks, as a method to prevent deadlocks. Cycle-breaking provides for deadlock-free wormhole routing constrained by turns prohibited at some nodes. We present lower and upper bounds for minimal cardinalities of cycle-breaking connectivity preserving sets for several classes of graphs such as homogeneous meshes, mbi p-ary mbi n-cubes, cube-connected cycles, hexagonal and honeycomb meshes, tori, etc.
The problem of preventing deadlocks and livelocks in computer communication networks with wormhol... more 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 well...
ABSTRACT ABSTRACT In this paper we consider the problem of deadlock- free unicast wormhole routin... more 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
Page 1. Running head: DEADLOCKPREVENTION In MULTIPROCESSOR SYSTEMS 1 Deadlock Prevention in Multi... more Page 1. Running head: DEADLOCKPREVENTION In MULTIPROCESSOR SYSTEMS 1 Deadlock Prevention in Multiprocessor Systems with Wormhole Routing Mark Karpovsky, Lev Levitin, and Mehmet Mustafa Boston University USA Page 2. ...
Real Time embedded system designers are facing extreme challenges in underlying architectural des... more Real Time embedded system designers are facing extreme challenges in underlying architectural design selection. It involves the selection of a programmable, concurrent, heterogeneous multiprocessor architecture platform. Such a multiprocessor system on chip (MPSoC) platform has set ...
IEEE Transactions on Control of Network Systems, 2014
ABSTRACT In this paper, we consider the problem of constructing minimal cycle-breaking connectivi... more ABSTRACT In this paper, we consider the problem of constructing minimal cycle-breaking connectivity preserving sets of turns for graphs that model communication networks, as a method to prevent deadlocks. Cycle-breaking provides for deadlock-free wormhole routing constrained by turns prohibited at some nodes. We present lower and upper bounds for minimal cardinalities of cycle-breaking connectivity preserving sets for several classes of graphs such as homogeneous meshes, mbi p-ary mbi n-cubes, cube-connected cycles, hexagonal and honeycomb meshes, tori, etc.
The problem of preventing deadlocks and livelocks in computer communication networks with wormhol... more 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 well...
ABSTRACT ABSTRACT In this paper we consider the problem of deadlock- free unicast wormhole routin... more 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
Page 1. Running head: DEADLOCKPREVENTION In MULTIPROCESSOR SYSTEMS 1 Deadlock Prevention in Multi... more Page 1. Running head: DEADLOCKPREVENTION In MULTIPROCESSOR SYSTEMS 1 Deadlock Prevention in Multiprocessor Systems with Wormhole Routing Mark Karpovsky, Lev Levitin, and Mehmet Mustafa Boston University USA Page 2. ...
Real Time embedded system designers are facing extreme challenges in underlying architectural des... more Real Time embedded system designers are facing extreme challenges in underlying architectural design selection. It involves the selection of a programmable, concurrent, heterogeneous multiprocessor architecture platform. Such a multiprocessor system on chip (MPSoC) platform has set ...
Uploads
Papers by Mehmet Mustafa