World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM

    Parallel implementations in computer algebra often require careful designs tailored towards irregular data structures and patterns of computation that are largely unpredictable. In this context, we re-visit the BSP Göttfert algorithm of [1] whose communication patterns suffer from greatly varying degrees within the intermediary univariate polynomial outputs, leading to unpredictable communication load imbalance. We show that this problem can be rectified through the use of two-phase broadcast. We demonstrate the effects of our improvement using analysis within the BSP model. We conduct a series of experimental comparative runs for factoring input polynomials with degrees ranging from 8000 to 400000, over a number of processors reaching up to 16. Our communication balancing results in an improvement in most of the test cases, more so whenever stark deviation in intermediary polynomial degrees is observed.