Fast mapping on Myrinet networks
E.A. Hendriks · 2004
This work presents an alternate method for discovering new switches and comparing switches when mapping a Myrinet network. Existing methods for mapping Myrinet networks rely on timeouts and are prone to false negatives due to network deadlock. Our algorithm increases the mapper's speed by providing a fast negative answer without relying on a timeout. In addition, the mapper's reliability is increased because it allows the mapper to detect if network deadlock has occurred. Mapping time on our 1024 port network has been reduced from approximately 7 minutes to 15 seconds.