| N. Francez. Distributed termination. ACM Trans. Progr. Languages and Systems, 2:42--55, 1980. |
....occurs anymore (insertion or deletion of keys) then eventually no action applies. The algorithm blocks waiting to detect new perturbations. Standard techniques can be used to superimpose a distributed termination detection algorithm to this scheme, so as to enforce global termination [Fra80] if wanted. Observe that no extra assumption is made on the original shape of the tree besides the one mentioned above. In particular, we do not assume that the tree was actually yielded by a sequence of insertions and deletions from a balanced tree. Our scheme just takes any search tree at any ....
N. Francez. Distributed termination. ACM Trans. Progr. Languages and Systems, 2:42--55, 1980.
....occurs any longer (insertion or deletion of keys) then eventually no action applies. The algorithm blocks waiting to detect new perturbations. Standard techniques can be used to superimpose a distributed termination detection algorithm to this scheme, so as to enforce global termination [Fra80] if wanted. Observe that no extra assumption is made on the original shape of the tree excepted the one mentioned above. In particular, we do not assume that the tree was actually yielded by a sequence of insertions and deletions from a balanced tree. Our scheme just takes any search tree at ....
N. Francez. Distributed termination. ACM Trans. Progr. Languages and Systems, 2:42--55, 1980.
No context found.
N. Francez. Distributed termination. ACM Trans. Progr. Languages and Systems, 2:42--55, 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC