| L. M. Adams and H. F. Jordan, "Is SOR color-blind?," SIAM J. Sci. Stat. Comput., Vol. 7, No. 2, pp. 490-506, April 1986. |
....In the current implementation of VOTE, it is therefore up to the application program to announce the locality of consistent data. 3 Case Study Successive Overrelaxation This section presents two implementations of a successive overrelaxation algorithm based on the red black technique [1]. This kind of application is a typical representative for parallel numerical algorithms operating on dense data structures. The amount of data being shared is little and increases only with the number of computing nodes. Data sharing is performed only by a pair of processes, that is each process ....
L.M. Adams, H.F. Jordan, "Is SOR Color Blind?" In SIAM Sci. Stat. Computation, Vol. 7, No. 2, pp. 490--506, 1986.
....Elimination 18 loop over simulated time with two sets of linear equations solved by SOR iteration at each time step. One set is for stream function and one for vorticity at the points of a rectangular grid. The method used for the parallel SOR is a simplified version of a more general algorithm [26] which is guaranteed to have the same convergence properties as a rowwise sequential sweep of the grid. The simplified algorithm involves processes sweeping different rows of grid points with interprocess synchronization used to guarantee that updated information (and old information) is used to ....
L. M. Adams and H. F. Jordan, "Is SOR color-blind?," SIAM J. Sci. Stat. Comput., Vol. 7, No. 2, pp. 490-506, April 1986.
No context found.
A. Adams, H.F. Jordan " Is SOR Color-Blind? " SIAM J. Sci. Stat. Compt. Vol. 7, No. 2, p 490-506 (1986)
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