萤火虫
发表于 2025-3-26 23:05:50
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
发表于 2025-3-27 02:18:24
http://reply.papertrans.cn/32/3166/316542/316542_32.png
连系
发表于 2025-3-27 05:45:33
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.
联想记忆
发表于 2025-3-27 09:57:54
http://reply.papertrans.cn/32/3166/316542/316542_34.png
grenade
发表于 2025-3-27 15:44:30
,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.
停止偿付
发表于 2025-3-27 20:21:50
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
发表于 2025-3-27 22:46:27
http://reply.papertrans.cn/32/3166/316542/316542_37.png
deactivate
发表于 2025-3-28 05:11:02
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
发表于 2025-3-28 07:08:17
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
发表于 2025-3-28 13:22:48
http://reply.papertrans.cn/32/3166/316542/316542_40.png