Analytical performance modelling of adaptive wormhole routing in the star interconnection network

The star graph was introduced as an attractive alternative to the well-known hypercube and its properties have been well studied in the past. Most of these studies have focused on topological properties and algorithmic aspects of this network. Although several analytical models have been proposed in the literature for different interconnection networks, none of them have dealt with star graphs. This paper proposes the first analytical model to predict message latency in wormhole-switched star interconnection networks with fully adaptive routing. The analysis focuses on a fully adaptive routing algorithm which has shown to be the most effective for star graphs. The results obtained from simulation experiments confirm that the proposed model exhibits a good accuracy under different operating conditions

The impacts of timing constraints on virtual channels multiplexing in interconnect networks

Interconnect networks employing wormhole-switching play a critical role in shared memory multiprocessor systems-on-chip (MPSoC) designs, multicomputer systems and system area networks. Virtual channels greatly improve the performance of wormhole-switched networks because they reduce blocking by acting as "bypass" lanes for non-blocked messages. Capturing the effects of virtual channel multiplexing has always been a crucial issue for any analytical model proposed for wormhole-switched networks. Dally has developed a model to investigate the behaviour of this multiplexing which have been widely employed in the subsequent analytical models of most routing algorithms suggested in the literature. It is indispensable to modify Dally's model in order to evaluate the performance of channel multiplexing in more general networks where restrictions such as timing constraints of input arrivals and finite buffer size of queues are common. In this paper we consider timing constraints of input arrivals to investigate the virtual channel multiplexing problem inherent in most current networks. The analysis that we propose is completely general and therefore can be used with any interconnect networks employing virtual channels. The validity of the proposed equations has been verified through simulation experiments under different working conditions

The role of the intensive care unit environment and health-care workers in the transmission of bacteria associated with hospital acquired infections

The goal of this study was to attempt to determine the rate of contamination of health-care workers' (HCWs) hands and environmental surfaces in intensive care units (ICU) by the main bacteria associated with hospital acquired infections (HAIs) in Tehran, Iran. A total of 605 and 762 swab samples were obtained from six ICU environments and HCWs' hands. Identification of the bacterial isolates was performed according to standard biochemical methods, and their antimicrobial susceptibility was determined based on the guidelines recommended by clinical and laboratory standards institute (CLSI). The homology of the resistance patterns was assessed by the NTSYSsp software. The most frequent bacteria on the HCWs' hands and in the environmental samples were Acinetobacter baumannii (1.4 and 16.5, respectively), Staphylococcus aureus (5.9 and 8.1, respectively), S. epidermidis (20.9 and 18.7, respectively), and Enterococcus spp. (1 and 1.3, respectively). Patients' oxygen masks, ventilators, and bed linens were the most contaminated sites. Nurses' aides and housekeepers were the most contaminated staff. Imipenem resistant A. baumannii (94 and 54.5), methicillin-resistant S. aureus (MRSAs, 59.6 and 67.3), and vancomycin resistant Enterococci (VREs, 0 and 25) were detected on the hands of ICU staff and the environmental samples, respectively. Different isolates of S. aureus and Enterococcus spp. showed significant homology in these samples. These results showed contamination of the ICU environments and HCWs with important bacterial pathogens that are the main risk factors for HAIs in the studied hospitals. © 2015 King Saud Bin Abdulaziz University for Health Sciences

High-speed imaging receiver design for 6G optical wireless communications : a rate-FOV trade-off

The design of a compact high-speed and wide field of view (FOV) receiver is challenging due to the presence of two well-known trade-offs. The first one is the area-bandwidth trade-off of photodetectors (PDs) and the second one is the gain-FOV trade-off due to the use of optics. The combined effects of these two trade-offs imply that the achievable data rate of an imaging optical receiver is limited by its FOV, i.e., a rate-FOV trade-off. In this paper, we propose an imaging receiver design in the form of an array of (PD) arrays. To control the area-bandwidth trade-off, small PDs are used in an array of arrays structure instead of a single large PD. Moreover, to achieve a reasonable receiver FOV, we use an array of focusing lenses that focus the light individually on each inner PD array. The proposed array of arrays structure provides an effective method to control both gain-FOV trade-off (via an array of lenses) and area-bandwidth trade-off (via arrays of small PDs). We first derive a tractable analytical model for the signal-to-noise ratio (SNR) of an array of PDs that is equipped with a focusing lens assuming maximum ratio combining (MRC). Then, we extend the model to the proposed array of arrays structure and the accuracy of the analytical model is verified based on several Optic Studio-based simulations. Next, we formulate an optimization problem to maximize the achievable data rate of the imaging receiver subject to a minimum required FOV. The optimization problem is solved for two commonly used modulation techniques, namely, on-off keying (OOK) and direct current (DC) biased optical orthogonal frequency division multiplexing (DCO-OFDM) with variable rate quadrature amplitude modulation (QAM). Our results show the limits of high speed wide-FOV imaging receivers that can support mobility. For example, it is demonstrated that a data rate of ~ 24 Gbps with a FOV of 15° is achievable using OOK with a total receiver size of 2 cm×2 cm

Are feedback loops destructive to synchronization?

We study the effects of directionality on synchronization of dynamical networks. Performing the linear stability analysis and the numerical simulation of the Kuramoto model in directed networks, we show that balancing in- and out-degrees of all nodes enhances the synchronization of sparse networks, especially in networks with high clustering coefficient and homogeneous degree distribution. Furthermore, by omitting all the feedback loops, we show that while hierarchical directed acyclic graphs are structurally highly synchronizable, their global synchronization is too sensitive to the choice of natural frequencies and is strongly affected by noise

A simple mathematical model of adaptive routing in wormhole k-ary n-cubes

Many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. This model requires a running time of O(I) which is the fastest model yet reported in the literature while maintaining reasonable accuracy. 1