{'fraction_non_alphanumeric': 0.02040816326530612, 'fraction_numerical': 0.0055658627087198514, 'mean_word_length': 4.864130434782608, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Solving equations of motion on a virtual tree machine

The dynamic equations of motion for rigid links connected at hinges to form a tree are amenable to a parallel solution. Such a solution can potentially provide a real-time simulation of the dynamic behavior of a broad class of objects used in animation and robotics even when the number of links is large. However, the design of a parallel algorithm poses problems not encountered in the sequential, one-processor case, such as assignment of links to processes, allocation of processes to physical processors, synchronization of processes, and the reduction of communication losses. The computation time using a parallel algorithm and an unlimited number of processors is shown to grow with the height of the tree rather than with its number of links. Increased communication costs degrade performance by a factor at most equal to the fanout. The facility used to investigate these problems is a Virtual Tree Machine (VTM) multi-computer implemented on a network of autonomous VAX-11/780 computers and SUN-2 workstations...