{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:49:39Z","timestamp":1648763379987},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:p> 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\u00f6ttfert 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. <\/jats:p>","DOI":"10.1142\/s0129626412500119","type":"journal-article","created":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T01:07:40Z","timestamp":1356656860000},"page":"1250011","source":"Crossref","is-referenced-by-count":0,"title":["COMMUNICATION BALANCING IN THE PARALLEL G\u00d6TTFERT ALGORITHM"],"prefix":"10.1142","volume":"22","author":[{"given":"FATIMA K.","family":"ABU SALEM","sequence":"first","affiliation":[{"name":"Computer Science Department, American University of Beirut, P.O. Box 11-0236, Riad El Solh Beirut 1107 2020, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LAMA B.","family":"TAMIM","sequence":"additional","affiliation":[{"name":"Computer Science Department, American University of Beirut, P.O. Box 11-0236, Riad El Solh Beirut 1107 2020, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,12,27]]},"reference":[{"key":"p_1","first-page":"217","volume":"3019","author":"Abu Salem F.","year":"2003","journal-title":"Proc. PPAM, LNCS"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-005-0154-y"},{"key":"p_3","first-page":"81","volume":"4","author":"Niederreiter H.","year":"1993","journal-title":"Communication and Computing"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.2307\/2153543"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0074"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626412500119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T15:42:34Z","timestamp":1565106154000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626412500119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":5,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,12,27]]},"published-print":{"date-parts":[[2012,12]]}},"alternative-id":["10.1142\/S0129626412500119"],"URL":"https:\/\/doi.org\/10.1142\/s0129626412500119","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}