Abstract
Early suggested parallel “ring” algorithm for solving of the spatially one-dimensional initial-boundary-value problem (IBVP) for a parabolic equation using an explicit difference method is shortly described. Asymptotical behaviour of the communication complexity of this parallel algorithm is studied. Communication complexity is determined as a ratio between the number of interchanges and the number of arithmetical operations. It is proved that the coefficient of the communication complexity for spatially m-dimensional IBVP tends in general to \(\frac{3}{4}\).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
