No abstract

No abstract

No abstract

This short paper presents a novel pipelining and processor allocation strategy for monoid computations on an unshuffle-exchange network. In the strategy, the processor utilization is near 1 and the communication is collision-free. With the characteristics of constant connections to each processor and only a single output node on the network, the method given here can compete with the method of Barnard and Skillicorn based on a hypercube network with multiple output nodes.

Abstract:Various indices of component importance with respect to system reliability have been proposed. The most popular one is the Birnbaum importance. In particular, a special case called uniform Birnbaum importance in which all components have the same reliability p has been widely studied for the consecutive-k system. Since it is not easy to compare uniform Birnbaum importance, the literature has looked into the case p = . In this paper, we look into the case p → 0 to complete the spectrum of examining Birnbaum importance over the whole range of p.