Titlebook: CONPAR 81; Conference on Analys W. Brauer,P. Brinch Hansen,Wolfgang H?ndler Conference proceedings 1981 Springer-Verlag Berlin Heidelberg 1

憤怒事實(shí)

多余

indigenous

孤獨(dú)無助

很像弓]

https://doi.org/10.1007/3-540-17629-2. Two processors may communicate only via a common communication link. Such a tree machine is a completely general, concurrent processing engine and can be used for problems decomposed in a hierarchical way. Implementation of divide-and-conquer algorithms on a tree machine is discussed. Algorithms f

新奇

https://doi.org/10.1007/3-540-17629-2tage of such a representation, called Q-notation, is that multiple processors can be used in a very regular manner, so that a simple and natural mapping of parallel computations onto parallel processors is achieved. The proposed machines are characterized by very efficient and fast instruction issue

變形

Two Voronoi-based techniques for FINDPATH,ite element methods. In this paper, interaction of the hardware aspects of the machine with a specific algorithm is examined in order to establish software primitives for the kernel of an operating system. The behavior of the primitives is explored in detail, and the effects of this behavior on the

microscopic

LAVA

震驚