In this paper we will describe two known strategies for static processors allocation in an n-cube multiprocessor, namely the buddy system strategy and the gray code strategy and then propose a new strategy that outperforms the first by (n-k+1) and the second by (n-k+1)/2 in cube recognition. Furthermore, our strategy...
One of the most popular topologies is the hypercube, that has n = 2ᵏ processors, numbered 0 to 2ᵏ -1 and connected in such a way that there is a link between any two if and only if they differ in one bit. Its popularity is due to the fact...
In this paper, based on coding theory concepts, new time scheduling algorithms for multihop packet radio networks are described. Each mobile host is assigned a word from an appropriate constant weight code of length n, distance d and weight w. The host can send a message at the j[superscipt th]...
A fault-tolerant routing method that can tolerate solid faults using only two virtual channels is presented. The proposed routing algorithm not only uses a fewer number of virtual channels but also tolerates f-chains in the meshes. It is shown that the proposed algorithm is deadlock-free and livelock-free in meshes when...
A binary code of length n is called a balanced code if each codeword contains exactly ⌊n/2⌋ (or ⌈n/2⌉) ones and ⌈n/2⌉ (or ⌊n/2⌋) zeros. In this paper, we give two improved methods for encoding and decoding the balanced codes. The first one, called improved single map, improves the computation...