New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling
For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications. In general, an array can be distributed to multiple processing systems by using regular or irregular distributions. Some dat...
Main Authors: | Qinghai Li, Chang Wu Yu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-07-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/12/7/142 |
Similar Items
-
One-sided interval edge-colorings of bipartite graphs
by: Renman, Jonatan
Published: (2020) -
Anti-Ramsey theory on complete bipartite graphs
by: Stephan Cho, et al.
Published: (2020-09-01) -
On Maximum Weight of a Bipartite Graph of Given Order and Size
by: Horňák Mirko, et al.
Published: (2013-03-01) -
Biclique: an R package for maximal biclique enumeration in bipartite graphs
by: Yuping Lu, et al.
Published: (2020-02-01) -
Cyclability in bipartite graphs
by: Denise Amar, et al.
Published: (2009-01-01)