http://worldcat.org/entity/work/id/1881905586

Efficient algorithms for dilated mappings of binary trees

The problem is addressed of finding a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a mode on the a desendent of the image of that node in the second binary tree. There are two natural measures of the cost of this mapping, namely the dilation cost i.e. the maximum distance in the target binary tree between the images of vertices that are adjacent in the original tree. The other measure, expansion cost, is defined as the number of extra nodes/edges to be added to the target binary tree in order ensure a 1-1 mapping. An efficient algorithm is described to find a mapping of one binary tree onto another. It is possible to minimize one cost of mapping at the expense of the other. This problem arises when designing pipelined Arithmetic Logic Units for special purpose computers. The pipeline is composed of ALU chips connected in the form of a binary tree. The operands to the pipeline can be supplied to the leaf nodes of the binary tree which then process and and pass the results up to their parents. The final result is available at the root. As each new application may require a distinct nesting of operations, it is useful to be able to find a good mapping of a new binary tree over existing ALU tree. Another problem arises if every distinct required binary tree is known beforehand. Here it is useful to hardwire the pipeline in the form of a minimal supertree that contains all required binary trees. Keywords: Assignment, Dilation, Embedding, Mapping problem, Parallel processing, Pipeline.

Open All Close All