AbstractÐAnalytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm [10]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.
Broadcasting in Mobile Ad Hoc Networks (MANETs) is a fundamental data dissemination mechanism with a number of important applications in, e.g., route discovery, address resolution. However, broadcasting induces what is known as the ''broadcast storm problem'' which causes severe degradation in network performance due to excessive redundant retransmission, collision, and contention. Broadcasting in MANETs has traditionally been based on flooding, which simply swamps the network with large number of rebroadcast messages in order to reach all network nodes. Although probabilistic flooding has been one of the earliest suggested schemes to broadcasting, there has not been so far any attempt to analyse its performance behaviour in a MANET environment. In an effort to fill this gap, this paper investigates using extensive ns-2 simulations the effects of a number of important system parameters in a typical MANET, including node speed, pause time, traffic load, and node density on the performance of probabilistic flooding. The results reveal that most of these parameters have a critical impact on the reachability and the number of saved rebroadcast messages achieved by probabilistic flooding.
Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation as it requires that the allocated processors be contiguous and has the same topology as the network topology connecting these processors. In non-contiguous allocation, a job can execute on multiple disjoint smaller sub-meshes rather than always waiting until a single sub-mesh of the requested size is available. Lifting the contiguity condition in non-contiguous allocation is expected to reduce processor fragmentation and increase processor utilization. However, the communication overhead is increased because the distances traversed by messages can be longer. The extra communication overhead depends on how the allocation request is partitioned and allocated to free sub-meshes. In this paper, a new noncontiguous processor allocation strategy, referred to as Greedy-Available-Busy-List, is suggested for the 2D mesh network, and is compared using simulation against the well-known non-contiguous and contiguous allocation strategies. To show the performance improved by proposed strategy, we conducted simulation runs under the assumption of wormhole routing and all-to-all communication pattern. The results show that the proposed strategy can reduce the communication overhead and improve performance substantially in terms of turnaround times of jobs and finish times.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.