Titlebook: Euro-Par 2019: Parallel Processing; 25th International C Ramin Yahyapour Conference proceedings 2019 Springer Nature Switzerland AG 2019 ar

螢火蟲(chóng)

Load-Balancing for Parallel Delaunay Triangulationssets, we achieve nearly perfectly balanced partitions and small border triangulations. This almost cuts running time in half compared to non-data-sensitive division schemes on inputs exhibiting an exploitable underlying structure.

white-matter

連系

PLB-HAC: Dynamic Load-Balancing for Heterogeneous Accelerator Clustersances. We evaluated the algorithm using data clustering, matrix multiplication, and bioinformatics applications and compared with existing load-balancing algorithms. PLB-HAC obtained the highest performance gains with more heterogeneous clusters and larger problems sizes, where a more refined load-distribution is required.

聯(lián)想記憶

grenade

,Ortsbewegliche Nahf?rdermittel,ns..In this paper, we combine compression and checkpointing for the first time to compute a realistic seismic inversion. The combination of checkpointing and compression allows larger adjoint computations compared to using only compression, and reduces the recomputation overhead significantly compared to using only checkpointing.

停止償付

https://doi.org/10.1007/978-3-662-67102-3on time of the DAG (also called makespan). We show that the problem is NP-complete for graphs of depth at least three but polynomial for graphs of depth at most two. In addition, we provide polynomial-time algorithms for some usual classes of graphs (trees, series-parallel graphs).

BLUSH

deactivate

Combining Checkpointing and Data Compression to Accelerate Adjoint-Based Optimization Problemsns..In this paper, we combine compression and checkpointing for the first time to compute a realistic seismic inversion. The combination of checkpointing and compression allows larger adjoint computations compared to using only compression, and reduces the recomputation overhead significantly compared to using only checkpointing.

capsule

Scheduling on Two Unbounded Resources with Communication Costson time of the DAG (also called makespan). We show that the problem is NP-complete for graphs of depth at least three but polynomial for graphs of depth at most two. In addition, we provide polynomial-time algorithms for some usual classes of graphs (trees, series-parallel graphs).

myocardium