Albert-Jan N. Yzelman

In partitioning matrices, replicating separators instead of incurring communication on separators can trade memory for data movement. This classic trade-off has become known as 2.5D methods-- however, goes back as far as 1999 in classic computations and (at least) to 2011 as a general concept in sparse matrix partitioning. We now release a pre-print that studies replication applied to scheduling general computations.
After more than eleven years, I have moved on from Huawei. Follow me on LinkedIn for more details and for what's next!
A summary of our recent papers on scheduling and applications was presented at the 19th workshop on Scheduling for Large-Scale Systems. The slides are available.

E-mail:	albert-jan@<last name>.net
ORCID:	0000-0001-8842-3689

Select