SHORTEST PATH SEARCHING DEVICE

• Main Authors: MIYAOKA SHINICHIROU, MURAMATSU AKIRA, FUNABASHI SEIJIYU
• Format: Patent
• Language: English
• Published: 17.01.1985
• Edition: 4
• Subjects: CALCULATING; COMPUTING; COUNTING; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES; ELECTRIC COMMUNICATION TECHNIQUE; ELECTRIC DIGITAL DATA PROCESSING; ELECTRICITY; PHYSICS; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION

PURPOSE:To execute at a superhigh speed by an on-line an optimizing calculation, etc. of a large scale network by providing a fan-out calculating device which has divided a fan-out processing into plural processing stages, and a distance smallest point searching device, etc. CONSTITUTION:A fan-out calculating device 200 is constituted by placing in the shape of a pipeline a processor cell P for dividing a fan-out processing into plural processing stages, and executing a processing of each stage. Also, a distance smallest point searching device 300 supplies a node whose distance is the smallest to the device 200 by executing a parallel sort, and inputs a new active node outputted from the device 200. A host computer 102 synchronizes the device 200 and the device 300, and also executes loading of a data onto a storage device 400, an output of a result of calculation, etc. In this way, a parallel calculating system can be executed by providing the device 200 and 300, etc., by which a calculation for searching the shortest path of a large scale network can be executed at a superhigh speed by an on-line.