Give a reusable implementation of a dissemination barrier in Java. Create a table that summarizes the total number of operations in the static tree, combining tree, and dissemination barriers....

Give a reusable implementation of a dissemination barrier in Java.

Create a table that summarizes the total number of operations in the static tree, combining tree, and dissemination barriers. Exercise 18.12. Can you devise a “distributed” termination detection algorithm for the executor pool in which threads do not repeatedly update or test a central location for termination, but rather use only local uncontended variables? Variables may be unbounded, but state changes should take constant time (so you cannot parallelize the shared counter).