To solve the problem that process capability optimization in multistage manufacturing processes has not been studied so much. Firstly, a multistage manufacturing process quality variation model is built to analyze the impaction of each stage quality on process capability. Then, a multistage manufacturing process capability analysis method with “Costutility ratio” is proposed to prioritize proce...

This paper presents a hybrid shared memory architecture which combines the scalability of a multistage interconnection network with the contention reduction benefits of coherent caches. We achieve this by replacing the memory modules and final stages of a multistage interconnection network with clusters of coherent caches. The performance of Cache Coherent Hybrid Interconnected Memory Extension...

The choice of an interconnection network for a parallel computer depends on a large number of performance factors which are very often application dependent. We propose a performance evaluation and a comparison methodology. This methodology is applied to a recently introduced class of interconnection networks (Multistage Chordal Ring Based multistage interconnection network). These networks are...

In this work we provide equations to precisely calculate the asymptotic weighting of multistage detectors satisfying the individually and jointly LMMSE criteria in the projection subspace for scenarios with unequal powers. Additionally, a general expression of the SINR achievable at the filter output as system size grows large is derived. Such equation can be applied to any multistage detector....

All-optical multistage interconnection networks are desirable for overcoming the limitations of optical signal regeneration in switching systems. We present a new implementation of the perfect-shuffle interconnection pattern that is coupled with an all-optical switching element, forming a complete stage of a multistage network. Switching is performed with birefringent calcite crystals and a fer...

Numerous combinatorial optimization problems (knapsack, maximum-weight matching, etc.) can be expressed as subset maximization problems: One is given a ground set $$N=\{1,\dots ,n\}$$ , collection $$\mathcal {F}\subseteq 2^N$$ of subsets thereof such that $$\emptyset \in \mathcal {F}$$ and an objective (profit) function $$p:\mathcal {F}\rightarrow \mathbb {R}_+$$ . The task to choose $$S\in max...