BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20241120T082410Z
LOCATION:HG E 3
DTSTART;TZID=Europe/Stockholm:20240604T143000
DTEND;TZID=Europe/Stockholm:20240604T150000
UID:submissions.pasc-conference.org_PASC24_sess182_pap125@linklings.com
SUMMARY:Efficient Parallel Strategies For Conjugate Heat Transfer Problems
DESCRIPTION:Paper\n\nGuillaume Houzeaux, Simon Santoso, Marta Garcia-Gasul
 la, Cristóbal Samaniego, and Hadrien Calmet (Barcelona Supercomputing Cent
 er)\n\nTemperature boundary conditions in thermal fluids have conventional
 ly been approached as Robin-type boundary conditions. However, with the em
 ergence of supercomputing capabilities, there is the opportunity to explor
 e the solution of heat transfer in the surrounding domains and establish a
  strong coupling with the temperature equation in the fluid, giving rise t
 o what is known as Conjugate Heat Transfer problems. This paper introduces
  two strategies based on volume and surface algebraic couplings, solved us
 ing either a block Gauss-Seidel method or a block Jacobi method. The volum
 e coupling implies solving the heat transfer problem in the fluid and soli
 d monolithically and coupling it to the Navier-Stokes equations solved in 
 the fluid. On the other hand, in the case of surface coupling, the Boussin
 esq system is solved within the fluid and then coupled to the solid throug
 h their shared interface. A comparative analysis of these approaches is pr
 esented, considering both algorithmic and computational performances withi
 n the framework of a multi-code coupling strategy. In the parallel executi
 on of such problems, a decision involves determining how to distribute the
  cores among the various coupled codes. We propose a method that involves 
 overloading computational nodes, allowing different codes to utilize the e
 ntire available resources. To enhance efficiency, the overload approach is
  implemented with a barrier, utilizing the DLB library, to mitigate the bu
 sy wait induced by MPI subroutines during data exchange. The solution to a
  practical example demonstrates a nearly twofold speedup achieved by the p
 roposed method compared to a classical approach when employing volume coup
 ling.\n\nDomain: Engineering\n\nSession Chair: Cristina Silvano (Politecni
 co di Milano)
END:VEVENT
END:VCALENDAR