METHOD FOR BALANCING OF DISTRIBUTED TREE FILE STRUCTURE IN PARALLEL COMPUTATION SYSTEM

摘要

PURPOSE: To balance the tree file structure of a distributed type in a parallel operation dystem. CONSTITUTION: In respective nodes to which a key index data identifier is distributed, the copies of 'NEWROOT' and 'OLDROOT' which are at least two lists at a ROOT data structure are prepared, the point of time when the excessive key index data identifier is provided in a first node is decided and the excessive key index data identifier is moved to a second node. In order to pay attention to the movement of the key index data identifier, the boundary value of the first and second nodes in the 'NEWROOT' and the copies of the 'NEWROOT' in the first and second nodes are updated, and when one of the nodes fails, records are present in both nodes of both updated and non- updated ROOT data structures and data are restored.