@@ -488,6 +488,81 @@ <h2 id="year2025" class="year">2025 <span class="count-stat"></span></h2>
488488 </div>
489489 </div>
490490
491+ </div>
492+ </li>
493+ <li><div class="bibtex-entry-container">
494+ <div>
495+ <div class="col-md-3 col-sm-12 bibtex-ref-meta hidden">
496+ <div class="row">
497+ <div class="col-md-12 ref-label label label-default">
498+ ArrarásEtAl2025
499+ </div>
500+ </div>
501+ </div>
502+
503+ <div class="bibtex-ref-entry">
504+ <span id="ArrarásEtAl2025">A. Arrarás, F. J. Gaspar, I. Jimenez-Ciga, and L. Portero, “Space-time parallel solvers for reaction-diffusion problems forming Turing patterns,” <i>Applied Numerical Mathematics</i>, Jul. 2025, doi: 10.1016/j.apnum.2025.07.012. [Online]. Available at: <a href="http://dx.doi.org/10.1016/j.apnum.2025.07.012" target="_blank">http://dx.doi.org/10.1016/j.apnum.2025.07.012</a></span>
505+ </div>
506+
507+
508+ <div class="row mt-4">
509+ <div class="btn-group btn-group-xs btn-group-justified" role="group">
510+ <div class="btn-group btn-group-xs" role="group">
511+
512+ <button class="button" data-toggle="modal" data-target="#modalArrarásEtAl2025Bibtex" aria-expanded="false"
513+ aria-controls="modalArrarásEtAl2025Bibtex">
514+ BibTeX
515+ </button>
516+
517+ </div>
518+ <div class="btn-group btn-group-xs" role="group">
519+
520+ <button class="button" disabled="disabled" data-toggle="modal" data-target="#modalArrarásEtAl2025Abstract"
521+ aria-expanded="false" aria-controls="modalArrarásEtAl2025Abstract">
522+ Abstract
523+ </button>
524+
525+ </div>
526+ </div>
527+ </div>
528+ </div>
529+
530+ <div class="modal" id="modalArrarásEtAl2025Bibtex" tabindex="-1" role="dialog"
531+ aria-labelledby="modalArrarásEtAl2025BibtexTitle" aria-hidden="true">
532+ <div class="modal-background">
533+ <div class="modal-card">
534+ <div class="modal-content">
535+ <header class="modal-card-head">
536+ <div class="modal-card-head-content">
537+ <div>
538+ <p class="modal-card-title" id="modalArrarásEtAl2025BibtexTitle">
539+ BibTeX entry <code>ArrarásEtAl2025</code>
540+ </p>
541+ </div>
542+ <button type="button" class="delete" data-dismiss="modal" aria-label="Close"><span
543+ aria-hidden="true">×</span></button>
544+ </div>
545+ </header>
546+ <section class="modal-card-body">
547+ <pre class="abstract">@article{ArrarásEtAl2025,
548+ author = {Arrarás, Andrés and Gaspar, Francisco J. and Jimenez-Ciga, Iñigo and Portero, Laura},
549+ doi = {10.1016/j.apnum.2025.07.012},
550+ issn = {0168-9274},
551+ journal = {Applied Numerical Mathematics},
552+ month = jul,
553+ publisher = {Elsevier BV},
554+ title = {Space-time parallel solvers for reaction-diffusion problems forming Turing patterns},
555+ url = {http://dx.doi.org/10.1016/j.apnum.2025.07.012},
556+ year = {2025}
557+ }
558+ </pre>
559+ </section>
560+ </div>
561+ </div>
562+ </div>
563+ </div>
564+
565+
491566</div>
492567</li>
493568<li><div class="bibtex-entry-container">
@@ -1213,10 +1288,10 @@ <h2 id="year2025" class="year">2025 <span class="count-stat"></span></h2>
12131288 <section class="modal-card-body">
12141289 <pre class="abstract">@techreport{FalgoutSchroder2025,
12151290 author = {Falgout, Robert D. and Schroder, Jacob B.},
1216- title = {Parallel Time Integration – An Approaching Paradigm Shift for Scientific Computing},
12171291 institution = {Lawrence Livermore National Laboratory},
1218- year = {2025},
1219- url = {https://github.com/XBraid/xbraid/wiki/papers/pint-proof-2023.pdf}
1292+ title = {Parallel Time Integration – An Approaching Paradigm Shift for Scientific Computing},
1293+ url = {https://github.com/XBraid/xbraid/wiki/papers/pint-proof-2023.pdf},
1294+ year = {2025}
12201295}
12211296</pre>
12221297 </section>
@@ -2834,6 +2909,101 @@ <h2 id="year2025" class="year">2025 <span class="count-stat"></span></h2>
28342909 </div>
28352910
28362911
2912+ </div>
2913+ </li>
2914+ <li><div class="bibtex-entry-container">
2915+ <div>
2916+ <div class="col-md-3 col-sm-12 bibtex-ref-meta hidden">
2917+ <div class="row">
2918+ <div class="col-md-12 ref-label label label-default">
2919+ RoseEtAl2025
2920+ </div>
2921+ </div>
2922+ </div>
2923+
2924+ <div class="bibtex-ref-entry">
2925+ <span id="RoseEtAl2025">M. Rose, S. Homes, L. Ramsperger, J. Gracia, C. Niethammer, and J. Vrabec, “Cyclic Data Streaming on GPUs for Short Range Stencils Applied to Molecular Dynamics,” arXiv:2507.11289v1 [cs.DC], 2025 [Online]. Available at: <a href="http://arxiv.org/abs/2507.11289v1" target="_blank">http://arxiv.org/abs/2507.11289v1</a></span>
2926+ </div>
2927+
2928+
2929+ <div class="row mt-4">
2930+ <div class="btn-group btn-group-xs btn-group-justified" role="group">
2931+ <div class="btn-group btn-group-xs" role="group">
2932+
2933+ <button class="button" data-toggle="modal" data-target="#modalRoseEtAl2025Bibtex" aria-expanded="false"
2934+ aria-controls="modalRoseEtAl2025Bibtex">
2935+ BibTeX
2936+ </button>
2937+
2938+ </div>
2939+ <div class="btn-group btn-group-xs" role="group">
2940+
2941+ <button class="button" data-toggle="modal" data-target="#modalRoseEtAl2025Abstract" aria-expanded="false"
2942+ aria-controls="modalRoseEtAl2025Abstract">
2943+ Abstract
2944+ </button>
2945+
2946+ </div>
2947+ </div>
2948+ </div>
2949+ </div>
2950+
2951+ <div class="modal" id="modalRoseEtAl2025Bibtex" tabindex="-1" role="dialog"
2952+ aria-labelledby="modalRoseEtAl2025BibtexTitle" aria-hidden="true">
2953+ <div class="modal-background">
2954+ <div class="modal-card">
2955+ <div class="modal-content">
2956+ <header class="modal-card-head">
2957+ <div class="modal-card-head-content">
2958+ <div>
2959+ <p class="modal-card-title" id="modalRoseEtAl2025BibtexTitle">
2960+ BibTeX entry <code>RoseEtAl2025</code>
2961+ </p>
2962+ </div>
2963+ <button type="button" class="delete" data-dismiss="modal" aria-label="Close"><span
2964+ aria-hidden="true">×</span></button>
2965+ </div>
2966+ </header>
2967+ <section class="modal-card-body">
2968+ <pre class="abstract">@unpublished{RoseEtAl2025,
2969+ author = {Rose, Martin and Homes, Simon and Ramsperger, Lukas and Gracia, Jose and Niethammer, Christoph and Vrabec, Jadran},
2970+ howpublished = {arXiv:2507.11289v1 [cs.DC]},
2971+ title = {Cyclic Data Streaming on GPUs for Short Range Stencils Applied to Molecular Dynamics},
2972+ url = {http://arxiv.org/abs/2507.11289v1},
2973+ year = {2025}
2974+ }
2975+ </pre>
2976+ </section>
2977+ </div>
2978+ </div>
2979+ </div>
2980+ </div>
2981+
2982+
2983+ <div class="modal" id="modalRoseEtAl2025Abstract" tabindex="-1" role="dialog"
2984+ aria-labelledby="modalRoseEtAl2025AbstractTitle" aria-hidden="true">
2985+ <div class="modal-background">
2986+ <div class="modal-card">
2987+ <div class="modal-content">
2988+ <header class="modal-card-head">
2989+ <div class="modal-card-head-content">
2990+ <div>
2991+ <p class="modal-card-title" id="modalRoseEtAl2025AbstractTitle">
2992+ Abstract for BibTeX entry <code>RoseEtAl2025</code>
2993+ </p>
2994+ </div>
2995+ <button type="button" class="delete" data-dismiss="modal" aria-label="Close"><span
2996+ aria-hidden="true">×</span></button>
2997+ </div>
2998+ </header>
2999+ <section class="modal-card-body">
3000+ In the quest for highest performance in scientific computing, we present a novel framework that relies on high-bandwidth communication between GPUs in a compute cluster. The framework offers linear scaling of performance for explicit algorithms that is only limited by the size of the dataset and the number of GPUs. Slices of the dataset propagate in a ring of processes (GPUs) from one GPU, where they are processed, to the next, which results in a parallel-in-time parallelization. The user of the framework has to write GPU kernels that implement the algorithm and provide slices of the dataset. Knowledge about the underlying parallelization strategy is not required because the communication between processes is carried out by the framework. As a case study, molecular dynamics simulation based on the Lennard-Jones potential is implemented to measure the performance for a homogeneous fluid. Single node performance and strong scaling behavior of this framework is compared to LAMMPS, which is outperformed in the strong scaling case.
3001+ </section>
3002+ </div>
3003+ </div>
3004+ </div>
3005+ </div>
3006+
28373007</div>
28383008</li>
28393009<li><div class="bibtex-entry-container">
@@ -3558,6 +3728,101 @@ <h2 id="year2025" class="year">2025 <span class="count-stat"></span></h2>
35583728 </div>
35593729 </div>
35603730
3731+ </div>
3732+ </li>
3733+ <li><div class="bibtex-entry-container">
3734+ <div>
3735+ <div class="col-md-3 col-sm-12 bibtex-ref-meta hidden">
3736+ <div class="row">
3737+ <div class="col-md-12 ref-label label label-default">
3738+ ZhongEtAl2025
3739+ </div>
3740+ </div>
3741+ </div>
3742+
3743+ <div class="bibtex-ref-entry">
3744+ <span id="ZhongEtAl2025">S.-Z. Zhong and Y.-L. Zhao, “A direct PinT algorithm for higher-order nonlinear equations,” arXiv:2507.05743v1 [math.NA], 2025 [Online]. Available at: <a href="http://arxiv.org/abs/2507.05743v1" target="_blank">http://arxiv.org/abs/2507.05743v1</a></span>
3745+ </div>
3746+
3747+
3748+ <div class="row mt-4">
3749+ <div class="btn-group btn-group-xs btn-group-justified" role="group">
3750+ <div class="btn-group btn-group-xs" role="group">
3751+
3752+ <button class="button" data-toggle="modal" data-target="#modalZhongEtAl2025Bibtex" aria-expanded="false"
3753+ aria-controls="modalZhongEtAl2025Bibtex">
3754+ BibTeX
3755+ </button>
3756+
3757+ </div>
3758+ <div class="btn-group btn-group-xs" role="group">
3759+
3760+ <button class="button" data-toggle="modal" data-target="#modalZhongEtAl2025Abstract" aria-expanded="false"
3761+ aria-controls="modalZhongEtAl2025Abstract">
3762+ Abstract
3763+ </button>
3764+
3765+ </div>
3766+ </div>
3767+ </div>
3768+ </div>
3769+
3770+ <div class="modal" id="modalZhongEtAl2025Bibtex" tabindex="-1" role="dialog"
3771+ aria-labelledby="modalZhongEtAl2025BibtexTitle" aria-hidden="true">
3772+ <div class="modal-background">
3773+ <div class="modal-card">
3774+ <div class="modal-content">
3775+ <header class="modal-card-head">
3776+ <div class="modal-card-head-content">
3777+ <div>
3778+ <p class="modal-card-title" id="modalZhongEtAl2025BibtexTitle">
3779+ BibTeX entry <code>ZhongEtAl2025</code>
3780+ </p>
3781+ </div>
3782+ <button type="button" class="delete" data-dismiss="modal" aria-label="Close"><span
3783+ aria-hidden="true">×</span></button>
3784+ </div>
3785+ </header>
3786+ <section class="modal-card-body">
3787+ <pre class="abstract">@unpublished{ZhongEtAl2025,
3788+ author = {Zhong, Shun-Zhi and Zhao, Yong-Liang},
3789+ howpublished = {arXiv:2507.05743v1 [math.NA]},
3790+ title = {A direct PinT algorithm for higher-order nonlinear equations},
3791+ url = {http://arxiv.org/abs/2507.05743v1},
3792+ year = {2025}
3793+ }
3794+ </pre>
3795+ </section>
3796+ </div>
3797+ </div>
3798+ </div>
3799+ </div>
3800+
3801+
3802+ <div class="modal" id="modalZhongEtAl2025Abstract" tabindex="-1" role="dialog"
3803+ aria-labelledby="modalZhongEtAl2025AbstractTitle" aria-hidden="true">
3804+ <div class="modal-background">
3805+ <div class="modal-card">
3806+ <div class="modal-content">
3807+ <header class="modal-card-head">
3808+ <div class="modal-card-head-content">
3809+ <div>
3810+ <p class="modal-card-title" id="modalZhongEtAl2025AbstractTitle">
3811+ Abstract for BibTeX entry <code>ZhongEtAl2025</code>
3812+ </p>
3813+ </div>
3814+ <button type="button" class="delete" data-dismiss="modal" aria-label="Close"><span
3815+ aria-hidden="true">×</span></button>
3816+ </div>
3817+ </header>
3818+ <section class="modal-card-body">
3819+ This paper mainly studies a direct time-parallel algorithm for solving time-dependent differential equations of order 1 to 3. Different from the traditional time-stepping approach, we directly solve the all-at-once system from higher-order evolution equations by diagonalization the time discretization matrix B. Based on the connection between the characteristic equation and Chebyshev polynomials, we give explicit formulas for the eigenvector matrix V of B and its inverse V^-1 , and prove that cond_2\left( V \right) =\mathcalO \left( n^3 \right), where n is the number of time steps. A fast algorithm B designed by exploring the structure of the spectral decomposition of B. Numerical experiments were performed to validate the acceleration performance of the fast spectral decomposition algorithm. The results show that the proposed fast algorithm achieves significant computational speedup.
3820+ </section>
3821+ </div>
3822+ </div>
3823+ </div>
3824+ </div>
3825+
35613826</div>
35623827</li></ol>
35633828<div class="row">
0 commit comments