V. Petkov: Scattering Theory for Hyperbolic Operators. Amsterdam: North Holland 1989 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Hyper-Systolic Routing for SIMD Systems - Hoferichter, Lippert, al. (1997) (Correct)
....to perform a complete permutation of data between the processors, with p being the number of processors. The routing procedure is based on the hyper systolic algorithm[3, 4, 5, 6] In the hypersystolic communication mode, the physical machine is mapped on a 1 dimensional systolic ring structure[7], along which the data is communicated among next neighbors in the ring or between neighbors at a distance of k processors, connected by a second set of fast communication lines (hyper connections) In this manner one can avoid redundant communication operations that occur in many systolic ....
N. Petkov: Systolic Parallel Processing, (Amsterdam: North-Holland, 1992).
Hyper-Systolic Parallel Computing - Th Lippert (1998) (1 citation) (Correct)
....in footnote 1, our method can be of considerable practical importance. In section 2, we present the generic form of the computational problem to solve, in section 3, we review the standard systolic concept. In order to provide a graphical illustration, we will deal with systolic automata models [10, 15]. A suitable generalization of the latter which gives us the means to graphically represent the hyper systolic parallel computing structure is worked out in section 4. In section 5, we discuss implementation issues concerning the hyper systolic method on parallel machines and we compare ....
....which particle # i is subject to in the presence of all the other particles. 3 Standard Systolic Computation We first review the systolic realization of Eq. 1 from which our further considerations start. We use the concept of systolic automata models to illustrate parallel computing structures [10, 15]. A systolic automaton consists of cells with data transfer and processing units, see Fig. 1, that are arranged in a regular grid. The cells are coupled to each other in a uniform next neighbour wiring pattern as depicted in Fig. 2. The processing elements (pe) are drawn as open triangles. They ....
[Article contains additional citation context not shown here]
N. Petkov: Systolic Parallel Processing, (Amsterdam: NorthHolland, 1992).
Hyper-Systolic Processing On The Quadrics: Improving.. - Palazzari, Lippert.. Self-citation (Processing) (Correct)
No context found.
N. Petkov: Systolic Parallel Processing, (Amsterdam: North-Holland, 1992).
Orientation Competition in Cortical Filters - An.. - Petkov, Kruizinga.. (1993) Self-citation (Petkov) (Correct)
....a similar plot, however, obtained for a different value of the receptive field size parameter j. Finally, if a triangle with edges of unequal lengths is taken, there will be a change in the strengths and relative positions of the maxima which can easily be compensated for by dynamic programming [30]. We used the above developed method for the recognition of simple geometric objects such as convex polygons. Representations such as the one shown in Fig.8 were computed for images of reference convex 0 5 10 15 20 25 30 0 200 400 600 800 1000 1200 1400 1600 1800 Figure 8: Lower dimension space ....
N. Petkov: Systolic Parallel Processing, Ch.9, (Amsterdam: North Holland, 1993)
Wave Equations With Point Interactions In Finite Energy.. - Bertini, Noja, Posilicano (Correct)
No context found.
V. Petkov: Scattering Theory for Hyperbolic Operators. Amsterdam: North Holland 1989
FFT for the APE Parallel Computer - Lippert, Schilling, Toschi.. (1998) (Correct)
No context found.
N. Petkov: Systolic Parallel Processing, (Amsterdam: North-Holland, 1992).
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