An effective approach to the enhancement of incomplete hypercube computers

An effective routing algorithm in incomplete hypercubes

Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze broadcasting algorithms based on the hierarchical binomial spanning trees, hierarchical edge-disjoint spanning trees and edge-disjoint spanning trees in an incomplete hypercube of 2/sup n/+2/sup k/ nodes, where 0<or=k<n. The hierarchical binomial spanning trees have the shortcoming of unbalanced load on parallel paths. In the one-port communication model, in which each node can send message along only one link at a time, the hierarchical edge-disjoint spanning tree algorithms are optimal within a factor of two. The edge-disjoint spanning trees algorithms are optimal with a factor of /sup n+1///sub k+1/ For all-port communication, in which a node can send messages to any number of links adjacent to it, the edge-disjoint spanning trees algorithms are strictly optimal.<<ETX>>

Incomplete hypercubes are analyzed. The elementary properties of complete hypercubes and a routing algorithm for incomplete hypercubes are briefly reviewed. Structural properties, including diameter, mean message traversal, and traffic density, of incomplete hypercube computers with size 2/sup n/+2/sup k/, 0 >

The wirelength is one of the key parameters of the quality of embedding graphs into host graphs. To our knowledge, no results for computing the wirelength of embedding irregular graphs into irregular graphs are known in the literature. We develop an algorithm that determines the wirelength of embedding of the Turán graph $T(\ell, 2^p)$, where $2^{n-1} \leq \ell &lt; 2^{n}$ and $1\le p\le \lceil \log_2 \ell\rceil\leq n$, into the incomplete hypercube $I^{\ell}_{n}$. Incomplete hypercubes form an important generalization of hypercubes because they eliminate the restriction on the number of nodes in a system.

Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2/sup n/+2/sup k/ nodes, where 0 >

In this paper we consider the routing and wavelength assignment problem in a wavelength routed all optical network. Inspired by techniques from artificial intelligence, in particular the Blocking Island (BI) abstraction, we propose a simple and intelligent routing and wavelength assignment (RWA) algorithm: BI_RWA. This algorithm can be used in arbitrarily connected optical networks. In addition, it is general enough such that with some simple modifications, it can be applied to different optical networking scenarios: static or dynamic traffic, single or multiple fiber links between node pairs, with or without wavelength converters. We have conducted simulation experiments to evaluate the performance of our algorithm. The simulation is carried out in two parts: static traffic and dynamic traffic. The results will demonstrate that our RWA algorithm outperforms state-of-the-art related algorithms.

In Wireless Sensor Networks (WSNs) localization -the assigning of sufficiently accurate positions to nodes -is frequently required to meaningfully identify the data collected. In Wireless Rechargeable Sensor Networks (WRSNs) -in which nodes are recharged by some external energy source -high accuracy (e.g. smaller than the mean internode distance) is often required to enable charging in a reasonably efficient manner with practical charger power.

A study, mainly by electron microscopy, has been made on two leg muscles of rat, in the course of atrophy experimentally induced by total denervation. As a preliminary the chief distinctive features of the soleus, chosen as a representative of pure red muscle, and of the gastrocnemius, representative of pure white muscle, are described. Two major phases of atrophy, somewhat overlapping in time, were observed. In the first, a degenerative autolytic process takes place in areas of the fiber, with loss of striation. It can be detected as early as the 7th day, but the maximum is observed at the 14th day, and accounts for a gross weight loss of 50 per cent. The first alteration appears in the Z lines; disorder in the disposition of filaments then follows. The process occurs very rapidly, leaving large areas in the cell in which one can detect only ground substance, glycogen, rare randomly disposed vesicular elements, and some mitochondria. Several lysosomes and masses of lipoproteins, which assume the configuration of concentric lamellae, show up in these fibers. Subsequently large parts of the waste sarcoplasm are discarded into the intercellular spaces. In the second major phase the so called "simple" atrophy takes place. The process starts early, but its effects are more detectable after 1 month. In this period, single myofibrils undergo different degrees of reduction in diameter, while the spatial disposition of primary and secondary filaments inside the fibrils remains normal. The appearance of the fibrils in longitudinal sections suggests that the process takes place by the detachment of filaments from the periphery of the fibrils and by their subsequent breakdown in the interfibrillary spaces. The sarcoplasmic reticulum is still well preserved, and relatively overdeveloped. Mitochondria disappear in parallel with the contractile material.

Network latency is an important metric specially for distributed systems. Depending on the system size, network latency can be either explicitly measured or predicted. However, prediction methods suffer from several drawbacks which lead to poor performance. The goal of this study is to demonstrate a novel method of network latency estimation which will be considered a valuable addition to the existing works due to its accuracy and efficiency. A number of machine learning techniques such as conventional linear regression, convolutional neural network, and support vector machine are used to predict the value to the end-to-end latency between any given pair of nodes. Two datasets: Ubique and iConnect-Ubisoft are used for training and testing the machine learning algorithms.

The existence of parallel node-disjoint paths between any pair of nodes is a desirable property of interconnection networks, because such paths allow tolerance to node and/or link failures along some of the paths, without causing disconnection. Additionally, node-disjoint paths support high-throughput communication via the concurrent transmission of parts of a message. We characterize maximum-sized families of parallel paths between any two nodes of alternating group networks. More specifically, we establish that in a given alternating group network AN n , there exist n?1 parallel paths (the maximum possible, given the node degree of n?1) between any pair of nodes. Furthermore, we demonstrate that these parallel paths are optimal or near-optimal, in the sense of their lengths exceeding the internode distance by no more than four. We also show that the wide diameter of AN n is at most one unit greater than the known lower bound D+1, where D is the network diameter.

We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances. The program is illustrated on the mean and variance. One encounters delayed Mellin transform equations, which we solve by inspection. Interestingly, the unbiased case gives a bounded variance, whereas the biased case gives a variance growing with the number of keys. It is therefore possible in the biased case to show that an appropriately normalized version of the distance converges to a limit. The complexity of moment calculation increases substantially with each higher moment; A shortcut to the limit is needed via a method that avoids the computation of all moments. Toward this end, we utilize the contraction method to show that in biased digital search trees the distribution of a suitably normalized version of the distances approaches a limit that is the fixed-point solution (in the Wasserstein space) of a distributional equation. An explicit solution to the fixed-point equation is readily demonstrated to be Gaussian.

To reduce traffic jam caused by various data competitions for channel, we present a low delay and energy efficient network-on-chip with three channels for different type's data. Hence, the transmission for control data between cores won’t be congested by the big amount of data transmitted from caches to core, and it achieves better performance in latency and energy. Our strategy is to make a directive long wire to connect two nodes in the same row or column, and distribute these connective wires to different layers which are connected by 3D stacking technology. In the many-core system applied with this topology, every pair of core-cache nodes are at most 5 hops away while real-time and short control information is transmitted by a 2D mesh network. The experimental results show up to 23% of network latency reduction and up to 15% energy reduction when compared to a 3D network-on-chip. DOI: http://dx.doi.org/10.11591/telkomnika.v11i12.2764 Full Text: PDF

The human airpuff-elicited reflexive eyeblink, like the startle reflex of rats and pigeons, occurs with either reduced amplitude or latency when a brief auditory stimulus precedes the reflex-eliciting event by an appropriate lead interval. In common with the overt startle reflex of lower animals, the degree of inhibition or latency reduction of an airpuff-elicited eyeblink in human adults proved to be independent of the intensity of the eyeblink-eliciting airpuff. This finding supports the principle that the amount of a given reflex modification effect (whether latency or amplitude reduction) is determined by the parameters and lead time of the modifying stimulus and not by those of the reflex-eliciting event.

Coronary arteriography in the intact rabbit: Demonstration of coronary vasomotor and electrocardiographic effects of ergonovine and indomethacin in rabbits after abrupt cessation of prolonged nitroglycerin treatment

In body area networks, various sensors are attached to clothing or on the body or even implanted under the skin. The sensors measure such as heart beat, the record of prolonged electrocardiogram, blood pressure, and so on. In this paper, an improved Successive interference cancellation (SIC) scheme based on zero correlation zone sequences is proposed. Here ZCZ is used as a random code for TH PPM UWB system. Nodes in a WBAN are connected through wireless communication channel within a very close range. The decrease in internode distance leads to interference between devices. To reduce this interference, an enhanced successive interference cancellation scheme based on ZCZ with optimal ordering is adopted. Because of zero correlation property of ZCZ, the performance of TH PPM UWB system through WBAN channel with ZCZ sequences outperforms performance of existing zero correlation duration code. In this paper, performance of UWB system for various modulation schemes are compared. Performance of UWB/MIMO (\n\t\n\t\t\n\t\t\t\n\t\t\t\t2\n\t\t\t\t×\n\t\t\t\t2\n\t\t\t\n\n\t\t\n\t\n) system employing SIC with optimal ordering using ZCZ codes also compared with pseudorandom (PN) and ZCD codes. Simulation results are obtained using sample biological functions as input to the proposed TH PPM UWB/MIMO (\n\t\n\t\t\n\t\t\t\n\t\t\t\t2\n\t\t\t\t×\n\t\t\t\t2\n\t\t\t\n\n\t\t\n\t\n) system with m-ZCZ codes in WBAN environment with multiple devices.