6,734 research outputs found

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

    Get PDF
    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

    Get PDF
    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

    Microchips and their significance in isolation of circulating tumor cells and monitoring of cancers

    Get PDF
    In micro-fluid systems, fluids are injected into extremely narrow polymer channels in small amounts such as micro-, nano-, or pico-liter scales. These channels themselves are embedded on tiny chips. Various specialized structures in the chips including pumps, valves, and channels allow the chips to accept different types of fluids to be entered the channel and along with flowing through the channels, exert their effects in the framework of different reactions. The chips are generally crystal, silicon, or elastomer in texture. These highly organized structures are equipped with discharging channels through which products as well as wastes of the reactions are secreted out. A particular advantage regarding the use of fluids in micro-scales over macro-scales lies in the fact that these fluids are much better processed in the chips when they applied as micro-scales. When the laboratory is miniaturized as a microchip and solutions are injected on a micro-scale, this combination makes a specialized construction referred to as "lab-on-chip". Taken together, micro-fluids are among the novel technologies which further than declining the costs; enhancing the test repeatability, sensitivity, accuracy, and speed; are emerged as widespread technology in laboratory diagnosis. They can be utilized for monitoring a wide spectrum of biological disorders including different types of cancers. When these microchips are used for cancer monitoring, circulatory tumor cells play a fundamental role

    On computing joint invariants of vector fields

    Full text link
    A constructive version of the Frobenius integrability theorem -- that can be programmed effectively -- is given. This is used in computing invariants of groups of low ranks and recover examples from a recent paper of Boyko, Patera and Popoyvich \cite{BPP}
    corecore