All these limits lead us to the ideal of using more powerful parallel systems, which of course require parallel algorithms . Efficient parallel algorithms were developed. In this work we have studied performance of the Count Distribution algorithm on a scalable cluster of heterogeneous computers. We have studied the possible reasons for this fall of performance and as result developed an additional adaptive load-balancing mechanism. The mechanism uses partial data redistribution on every phase of the computation.
Modern network enable low latency, hight bandwidth communication.
This performance has not been realized by current applications, because of the hight processing overheads imposed by existing network protocols. The question is related to some physical and chemical processes, such as the shapes of a front burning out or the shapes of a drug during drug release in a fluid environment. Both cases are discussed in the plane and in the 3D space. The solution uses methods of convex theory including the theory of mixed volumes and optimization techniques. A vast and interesting family of natural semantics for belief revision is defined.