Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties

Authors:
Nitin;Ashok Subramanian
Affiliations:
Department of Computer Science Engineering and Information Technology, Jaypee University of Information Technology (JUIT), Waknaghat, via Kandaghat, P.O. Dumehar Bani, Solan-173215, Himachal Prade ...;Center for Advanced Study of Algorithms, A-10, Sector-62, Noida-201307, Uttar Pradesh, India
Venue:
Journal of Discrete Algorithms
Year:
2008

Citing 17
Cited 5

Three fast algorithms for four problems in stable marriage

SIAM Journal on Computing
A Survey and Comparision of Fault-Tolerant Multistage Interconnection Networks

Computer
Augmented Shuffle-Exchange Multistage Interconnection Networks

Computer
An efficient algorithm for the “optimal” stable marriage

Journal of the ACM (JACM)
The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
Multiprocessors

Multiprocessors
A new fixed point approach for stable networks and stable marriages

Journal of Computer and System Sciences
A New Approach to Stable Matching Problems

SIAM Journal on Computing
On a fault-tolerant multistage interconnection network

Computers and Electrical Engineering
Design and analysis of fault-tolerant multistage interconnection networks with low link complexity

ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Inside Parallel Computers: Trends in Interconnection Networks

IEEE Computational Science & Engineering
The computational complexity of the circuit value and network stability problems

The computational complexity of the circuit value and network stability problems
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
Performance of Processor-Memory Interconnections for Multiprocessors

IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor

IEEE Transactions on Computers
A Survey of Interconnection Networks

Computer

Designing a Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths

The Journal of Supercomputing
Stochastic communication for application-specific Networks-on-Chip

The Journal of Supercomputing
Comparative analysis of Traffic Patterns on k-ary n-tree using adaptive algorithms based on Burton Normal Form

The Journal of Supercomputing
On a deadlock and performance analysis of ALBR and DAR algorithm on X-Torus topology by optimal utilization of Cross Links and minimal lookups

The Journal of Supercomputing
Message broadcasting via a new fault tolerant irregular advance omega network in faulty and nonfaulty network environments

Journal of Electrical and Computer Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We claimed that Stable Matching problems are the same as problems about stable configurations of Multi-stage Interconnection Networks (MINs). We solved the Regular and Irregular MINs Stability Problems using the approaches and solutions provided by the Stable Matching Problem. Specifically we have used Stable Marriage Problem as an example of Stable Matching. Two algorithms are proposed:-the first algorithm generates the MINs Preferences List in O(n^2) time and second algorithm produces a set of most Optimal Pairs of the Switching Elements (SEs), derived from the MINs Preferences List in O(n) time. Consequences include new algorithms for finding a Stable Matching between the SEs, an understanding of the difference between MINs Stability and Unstability problems, Algorithms used for generating the Preference Lists for the MINs, methods, and procedures used for deriving the Optimal Pairs from the MINs Preference Lists, and solving ties between them.