Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2012-02-06
IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 4, No 2, July 2011, 66-76
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
The research paper emphasizes that the Stable Matching problems are the same as the problems of stable configurations of Multi-stage Interconnection Networks (MIN). We have discusses the Stability Problems of Existing Regular Omega Multi-stage Interconnection Network (OMIN) and Proposed 3-Disjoint Paths Omega Multi-stage Interconnection Network (3DON) using the approaches and solutions provided by the Stable Matching Problem. Specifically, Stable Marriage Problem is used as an example of Stable Matching. On application of the concept of the Stable Marriage over the MINs states that OMIN is highly stable in comparison to 3DON.
Chauhan Durg Singh
Govil Mahesh Chandra
Nitin
Rastogi Ravi
No associations
LandOfFree
On Stability Problems of Omega and 3-Disjoint Paths Omega Multi-stage Interconnection Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Stability Problems of Omega and 3-Disjoint Paths Omega Multi-stage Interconnection Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Stability Problems of Omega and 3-Disjoint Paths Omega Multi-stage Interconnection Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-117963