Abstract
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square into rectangles. In the most general case, the problem has proved NP-complete. Therefore, restrictions of this problem allowing for polynomial solutions should be studied. So far, the only well-studied restriction has been a column-based geometrical partitioning problem obtained from the general problem by imposing the additional restriction that rectangles of the partitioning make up columns. This problem has a solution of the complexity O(p3) . This paper studies another restriction - a grid-based partitioning problem obtained from the general problem by imposing the additional restriction that the heterogeneous processors owing the rectangles of the partitioning form a two-dimensional grid. An algorithm of the complexity O(p3/2) solving this problem is proposed, proved and experimentally validated.
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.
