| 摘要 |
PROBLEM TO BE SOLVED: To gather data directly at a root computer in correct order by a communication system which uses binary tree algorithm even when the rank of the root computer is not 0. SOLUTION: When data that respective computers have are transferred to a computer (root computer) whose identification number is not 0 and stored in the order of their identification numbers, the identification number of the computer to which the data that the respective computers have are transferred is converted into 0 and the identification numbers of other computers are so converted that when the data are transferred to the computer having the identification number 0 from the respective computers, the transferred data are stored in the order of the identification numbers. For example, when there are 10 computers and a computer 9 is a root computer, left subtrees of a binary tree are 6, 7, 8, and 9, right subtrees are 2, 3, 4, and 5, and the remaining parts are 0 and 1; and the left subtrees are changed to 9, 8, 6, and 7 so that the left part 9 is the leftmost, and the identification numbers are converted into 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 in order from the left.
|
