Issue 
A&A
Volume 622, February 2019



Article Number  A79  
Number of page(s)  13  
Section  Interstellar and circumstellar matter  
DOI  https://doi.org/10.1051/00046361/201834354  
Published online  31 January 2019 
SOC program for dust continuum radiative transfer
Department of Physics,
PO Box 64,
00014,
University of Helsinki,
Finland
email: mika.juvela@helsinki.fi
Received:
1
October
2018
Accepted:
14
December
2018
Context. Thermal dust emission carries information on physical conditions and dust properties in many astronomical sources. Because observations represent a sum of emission along the line of sight, their interpretation often requires radiative transfer (RT) modelling.
Aims. We describe a new RT program, SOC, for computations of dust emission, and examine its performance in simulations of interstellar clouds with external and internal heating.
Methods. SOC implements the Monte Carlo RT method as a parallel program for sharedmemory computers. It can be used to study dust extinction, scattering, and emission. We tested SOC with realistic cloud models and examined the convergence and noise of the dusttemperature estimates and of the resulting surfacebrightness maps.
Results. SOC has been demonstrated to produce accurate estimates for dust scattering and for thermal dust emission. It performs well with both CPUs and GPUs, the latter providing a speedup of processing time by up to an order of magnitude. In the test cases, accelerated lambda iterations (ALIs) improved the convergence rates but was also sensitive to Monte Carlo noise. Runtime refinement of the hierarchicalgrid models did not help in reducing the run times required for a given accuracy of solution. The use of a reference field, without ALI, works more robustly, and also allows the run time to be optimised if the number of photon packages is increased only as the iterations progress.
Conclusions. The use of GPUs in RT computations should be investigated further.
Key words: radiative transfer / ISM: clouds / submillimeter: ISM / dust, extinction / stars: formation
© ESO 2019
1 Introduction
Most knowledge of astronomical sources is based on radiation that is produced and processed by inhomogeneous objects viewed from a single viewpoint. This also applies to interstellar medium, the line emission from gas, and the continuum emission from interstellar dust. Radiative transfer (RT) defines the relationships between the physical conditions in a radiation source and the observable radiation. Therefore, RT modelling is needed to determine the source properties or, more generally, the range of properties consistent with observations.
Many RT programs exists for the modelling of dust continuum data (e.g. Bianchi et al. 1996; Dullemond & Turolla 2000; Gordon et al. 2001; Bjorkman & Wood 2001; Juvela & Padoan 2003; Steinacker et al. 2003; Wolf 2003; Harries et al. 2004; Ercolano et al. 2005; Juvela 2005; Pinte et al. 2006; Jonsson 2006; Chakrabarti & Whitney 2009; Robitaille 2011; Lunttila & Juvela 2012; Natale et al. 2014; Baes & Camps 2015) and benchmarking projects have quantified the consistency between the different methods and implementations (Ivezic et al. 1997; Pascucci et al. 2004; Gordon et al. 2017). Part of these codes can also be used in studies of polarised scattered or emitted radiation (Whitney et al. 2003; Pelkonen et al. 2007; Bethell et al. 2007; Reissl et al. 2016; Peest et al. 2017).
Radiative transfer is computationally demanding because each source location is in principle coupled with all the other positions (Steinacker et al. 2013), the coupling changing with wavelength. Emission calculations may need iterations where temperature estimates and estimates of the radiation field are updated alternatingly. Most codes for dust emission and scattering modelling are based on the Monte Carlo method, the simulation of large numbers of photon packages that represent the actual radiation field. In “immediate reemission” codes (Bjorkman & Wood 2001), every interaction with the medium leads to a reevaluation of the dust emission from the corresponding model cell. In other Monte Carlo codes the information about the absorbed energy is stored during the simulation step, after which the temperatures of all cells are updated. Models with high dust temperatures and high optical depths may require a significant number of iterations.
In the case of large 3D models, the run times become long and some parallelisation of the computations may be necessary (Robitaille 2011; Verstocken et al. 2017). The Monte Carlo method allows for straightforward parallelisation of the radiationfield simulations at the level of individual photon packages or between frequencies (if the basic simulation scheme allows this) or even based on the decomposition of the computational domain (Harries 2015). However, naive parallelisation – where each computing unit performs independent simulations with different random numbers – may also be the most efficient.
The parallelisation between nodes is typically handled with a Message Passing Interface (MPI^{1}) and within a node (on a single sharedmemory computer), for example, with OpenMP^{2}, lowerlevel threads, or other languagespecific (or vendorspecific) tools. Further speedup could be obtained with graphics processing units (GPUs) that are theoretically capable of more floatingpoint operations per second than even highend CPUs. The use of GPUs has been hindered by the more complex programming model and the limited device memory. However, the massive parallelism provided by GPUs is well suited for RT calculations and some applications to astronomical RT already exist (Heymann & Siebenmorgen 2012; Malik et al. 2017). These use the CUDA parallel programming platform, which is proprietary to NVIDIA and cannot be used with GPUs of other manufacturers. Furthermore, CUDA programs are written explicitly for GPUs and cannot be run on CPUs. Programming GPUs is becoming more approachable as directivebased programming models are becoming available. The support for GPUs (and “accelerators” such as Intel Xeon Phi, AMD Radeon Instinct, etc.) is maturing in OpenMP. This enables heterogeneous computing, that is, the same program running on both GPUs and CPUs. However, in this paper we describe the continuum RT program SOC, which is written using OpenCL libraries^{3}. OpenCL is an open standard for heterogeneous computing. Thus, SOC can in principle be run unaltered on CPUs, GPUs, and even other accelerators. OpenCL is supported by many vendors and furthermore has fully open source implementations, making it more futureproof against the current rapid changes and evolution of the GPU computing frameworks.
SOC has been compared to other continuum RT programs in Gordon et al. (2017). In this paper we describe in more detail some of the implementation details and examine the efficiency of SOC and some of the implemented methods in the modelling of dust emission from interstellar clouds. In a future paper, SOC will be used to produce synthetic surfacebrightness maps for a series of MHD model clouds and, based on these, to construct synthetic source catalogues with the pipeline used for the original Planck Galactic Cold Cores Catalogue (PGCC; Planck Collaboration XXVIII 2016). One of these MHD models is already used in the tests in the present paper.
The contents of the paper are the following. In Sect. 2, we discuss the implementation of the SOC programme. In the results section, Sect. 3, we describe tests on the SOC performance. These include, in particular, problems that require iterations to reach final dust temperature estimates (Sects. 3.3 and 3.4). The findings are discussed in Sect. 4 and the final conclusions are listed in Sect. 5. In Appendix A, we further discuss the calculation of emission from stochastically heated grains.
2 Methods
In this section, we present some details of the SOC implementation and the model clouds used in the subsequent tests.
2.1 SOC radiative transfer program
SOC is a Monte Carlo RT program for the calculation of dust emission and scattering. It has been used in some publications (Gordon et al. 2017; Juvela et al. 2018a,b) but here we provide a more comprehensive description of some of the implementation details.
2.1.1 Basic program
SOC uses OpenCL libraries, enabling the program to be run on both CPUs and GPUs. This has affected some of the design decisions. The program is run on a host, which calls specific routines referred to as kernels that are executed on a device. The host is the normal computer (CPU) while the device can be a CPU (using the same resources as the host), a GPU, or another accelerator. Thus, the memory available on the device may be more limited than usual. SOC has separate kernels to carry out the simulation of photon packages at a single frequency in order to solve the dust temperatures based on the computed absorbed energy (nonstochastically heated grains only), and, based on that solution, to produce surfacebrightness maps at given frequencies.
In Gordon et al. (2017), we used an earlier version that employed modified Cartesian grids. Current SOC uses cloud models defined on hierarchical grids. The root grid is a regular Cartesian grid with cubic cells. Refinement is based on octrees where each cell can be recursively divided into eight subcells of equal size. In the following we refer to such a set of eight cells as an octet and the number of hierarchy levels as n_{L}. The root grid is the level L = 1 and a grid consisting only of the root grid has n_{L} = 1. The cells of the model cloud form a vector that starts with the cells of the root grid, followed by all cells of the first hierarchy level, an so forth. The links from parent cells to the first cell in the suboctet are stored in the same structure, encoding the index of the first child cell as a negative value in place of the density value in the parent cell. Because each octet is stored as a consecutive element of the density vector, smaller auxiliary arrays are sufficient to store the reverse links from the first cell of an octet to its parent cell. Neighbouring cells could be located faster by using explicit neighbour lists (Saftly et al. 2013). However, to reduce memory requirements, an important consideration especially on GPUs, we are currently not using that technique. Therefore, each time a photon package is moved to a new cell, a partial traversal of the hierarchy is required, up to a common parent cell and then down to the new leaf node that corresponds to the next cell along the path of the photon package.
The SOC program is based on the usual Monte Carlo simulation where the radiation field is simulated using a predetermined number of photon packages, each standing for a large number of real photons. SOC concentrates on the RT problem and does not have builtin descriptions of specific dust models, radiation sources, or cloud models (density distributions). These inputs are read from files that are specified in the SOC initialisation file. They include the cloud hierarchy with the density values, the dust cross sections for absorption and scattering, and scattering functions tabulated as functions of frequency and scattering angle.
The simulation is done using a fixed frequency grid. Therefore, at each step of the calculations, the kernel only needs data related to a single frequency. These include the densities and, for the current frequency, the optical depth and a counter for the number of absorbed photons. The density vector (one floatingpoint number per cell) includes basic information about the grid geometry. The information about parent cells is less than one eighth of this (link for first cell of each octet, excluding the root level). The host sets up the data for the current frequency and these are transferred to the device. After the kernel has completed the simulation of the radiation field, the information of the number of absorptions in each cell can be returned to the host. The host loops over simulated frequencies, calls the kernel to do the simulations, and gathers information of absorption events.
For stochastically heated grains, the information about absorbed energy is converted to dust emission using an external program such as DustEM (Compiègne et al. 2011) or the program we used in Lunttila & Juvela (2012) and in Camps et al. (2015). On the host side this requires the storage of large arrays that for modern computers would not set serious limits on the size of the computed models. However, in SOC these are stored as memorymapped files. Memorymapped files reside on disk but can be used in the program transparently as in normal arrays. The operating system is responsible for reading and writing the data, as needed, without the data ever being in the main memory all at the same time. Thus, the main limitation remains the device memory and the amount of data per single frequency.
If grainsare assumed to be in equilibrium with the radiation field, the emission is calculated by SOC itself, again using a separate kernel. The integral of the absorbed energy over frequency can be gathered directly during the simulations, without the need for large multifrequency arrays. The absorption information remains on the device, and only the computed dust emission is returned to the host. As the final step, the host calls a mapping kernel to make surfacebrightness maps for the desired frequencies and directions.
SOC can also produce images of scattered light; however, these are usually made with separate runs that employ methods such as forced first scattering, peeloff, and potentially additional weighting schemes (Juvela 2005; Baes et al. 2016). Apart from the use of different spatial discretisation, SOC results for scattering problems have already been discussed in Gordon et al. (2017). We concentrate in this paper on the dust emission and especially the methods described in the following section.
2.1.2 Additional methods
SOC implements some features beyond the basic Monte Carlo scheme. These include forced first scattering and accelerated lambda iterations (ALI). ALI (also called accelerated Monte Carlo or AMC) is computed using a diagonal operator that solves explicitly for the cycle of photons that are absorbed within the emitting cell (see Juvela 2005). The use of ALI incurs an additional cost of storing on the device one additional floating point number per cell, which is needed to keep track of the photon escape probabilities for each cell. SOC includes optional weighting for the scattering direction (Juvela 2005) and the step length between scattering events. The latter is similar in nature to the method described in Baes et al. (2016) but, to avoid explicit integration to the model boundary, the probability distribution of the simulated free path is based on the sum of two exponential functions of optical depth, with userselected parameters. The weighting is applied only on the first step of each photon package.
SOC can use a reference field to reduce the noise, especially in calculations that involve several iterations (Bernes 1979; Juvela 2005). In this method, each simulation step only estimates a correction to the average radiation field determined by the previous iterations. This requires that the absorptions caused by the reference field also be stored, adding storage requirements by one number per cell and frequency. For grains at an equilibrium temperature, this reduces to a single number per cell (the total absorbed energy). In an ideal case, the overall noise would then decrease as n_{I}^{−1∕2}, as the function of the number of iterations – assuming that the number of photon packages per iteration, n_{P}, is constant. However, because the temperatures also change during the iterations, the noise is likely to decrease more slowly, especially during the first iterations.
Iterations are needed if the model includes high optical depths and dust is heated to such high temperatures that its emission no longer freely escapes the model volume. In the context of interstellar clouds, this means dust near embedded radiation sources, possibly in a very small fraction of the whole model volume. In these cases, the reference field can be used for further optimisation. After the first iteration, the reference field already contains the information of all constant sources, such as the embedded point sources or the background radiation, and they can be omitted from the subsequent iterations. Furthermore, it is possible to divide the cells into two categories. Passive cellsare those whose emission (resulting from their temperature change during the iterations) is too low to affect thetemperature of other cells. Active cells are correspondingly those whose temperature does change with iterations, affecting the temperature of other cells. Once the former are included in the reference field (if their emission is indeed significant at all), on subsequent iterations only emission from the active cells needs to be simulated. In SOC, the host can examine the changes of emission between iterations and can thus omit the creation of photon packages for cells for which the emission has not changed. However, in practice the same is accomplished by weightedsampling where the number of photon packages emitted from each cell is determined by the cell luminosity.
Finally, SOC offers the option to change the spatial resolution also during iterations. One could start with a lowresolution model, doing fast iterations, and only later refine to the final resolution needed. This could result in savings in the run times, depending on the optical depths and the intensity of the dust reemission. On the other hand, a lower spatial resolution means optical depths for individual cells, which tends to slow the convergence of temperature values down, especially when ALI is not used. The runtime refinement is briefly tested in Sect. 3.4
The present SOC does not carry out the RT simulation with polarised radiation but can nevertheless be used to calculate synthetic maps of polarised dust emission. SOC can determine for each cell the intensity and the anisotropy of the radiation field. Other scripts are used to calculate the resulting polarisationreduction factors, for example, according to the radiative torques theory, thus also including the information about the magnetic field orientation. The procedure is essentially identical to the computations presented in Pelkonen et al. (2009). The information of the polarisation reduction and of the magnetic field geometry are read into SOC, which then produces synthetic maps of the Stokes parameters. The calculations ignore the effects on the total intensity that result from the cross sections being dependent on the angle between the magnetic field and the direction of the radiation propagation. This is usually not a severe approximation (especially when compared to the many other sources of uncertainty). However, based on SOC, another program is now in preparation where all calculations are done using the full Stokes vectors, taking into account the degree to which the grains in each cell are aligned with the magnetic field (Pelkonen, in prep.).
2.2 Test model clouds
The first tests were performed with spherically symmetric density distributions that were sampled onto hierarchical grids (see Sect. 3.1).
Most tests employed a snapshots from the MHD simulations described in Padoan et al. (2016a), which has already been used for synthetic line observations of molecular clouds (Padoan et al. 2016b) and for studies of the starformation rate (Padoan et al. 2017). These simulations of supernovadriven turbulence were run with the Ramses code (Teyssier 2002) using a 250pc box with periodic boundary conditions. The runs started with zero velocity, a uniform density n(H) = 5 cm^{−3}, and a uniform magnetic field of 4.6 μG. The selfgravity was turned on after 45 Myr and the simulations were then run for another 11 Myr. In the hierarchical grid, the largest cell size is 0.25 pc but in highdensity regions the grid is refined down to 7.6 × 10^{−3} pc. In this paper, we use a (10 pc)^{3} subvolume selected from the full (250 pc)^{3} model cloud. Table 1 lists the number of cells on each level of this (10 pc)^{3} model with maximum refinement n_{L} = 7. The largest number of cells is found on the level n_{L} = 4. Figure 1 shows examples of surfacebrightness maps computed for models with n_{L} = 1–4.
The RT problem is solved with SOC, assuming an external radiation field according to Mathis et al. (1983; solar neighbourhood values) and dust properties given by Compiègne et al. (2011). We use a fixedfrequency grid that has 52 frequencies placed logarithmically between 10^{11} and 3 × 10^{15} Hz (between 0.1 and 3000 μm). Tests are made assuming that the grains remain in temperature equilibrium with the radiation field.
Even with external illumination only, the radiation field intensity does not have significant largescale gradients in the MHD cloud models. This is caused by the inhomogeneity of the models which leads to a relatively uniform intensity in the lowdensity medium. Strong temperature variations are seen but mainly at smaller scales, in connection with individual highcolumndensity structures. Apart from the background radiation, the other potential radiation sources are internal sources (modelled as blackbody point sources) and the reemission from the heated dust itself.
Number of cells on each hierarchy level of the (10 pc)^{3} model clouds with n_{L} = 7.
3 Results
To examine the performance of SOC in simulations of external and internal radiation sources and of dust emission, we start with tests with simple spherically symmetric model clouds (Sect. 3.1). In Sect. 3.2, we continue with more realistic models based on a MHD simulation. Finally, the more demanding iterative computations with internally heated and optically thick clouds are discussed in Sect. 3.3.
To make the results more concrete, we quote timings for a laptop that has a sixcore CPU and a dedicated GPU^{4}. The performance is measured in terms of the wallclock time, the actual time that has elapsed, for example, between the beginning and the end of a run.
3.1 Tests with spherical model clouds
First tests were conducted with small, spherically symmetric models resampled onto a hierarchical grid. The root grid is 17^{3} cells and is refined to n_{L} = 2–5 levels with some 5000 cells per level. Thus, about one eighth of the cells is refined and the total number of cells is only ~ 10 000–20 000, depending on n_{L}. A 10 000 K blackbody point source with a luminosity of L = 1 L_{⊙} is located at the centre, in a root grid cell with zero density. Otherwise the density profile is Gaussian with a density contrast of approximately 200 between the centre and the edges. The maximum column density is N(H_{2}) ~ 1.3 × 10^{23} cm^{−2} but dependsslightly on the discretisation used. We characterise the noise of the calculations by using the random mean squared (rms) noise of the resulting100 μm maps.
Figure 2 shows how the results change as a function of the number of simulated photons packages and the model refinement. The results show the expected dependence of the noise on the number of photon packages, irrespective of the depth or the grid hierarchy. This applies to the simulations of the point source, the diffuse background, and the emission from the medium itself. Each map has a pixel size that corresponds to the smallest cell size of that particular model. With larger L, the maps become more oversampled (especially towards the map edges), which has some effect on the computed rms values. The actual noise per 3D cell measured by the dust temperature is in refined regions proportional to 2^{L} because the number of photon packages hitting a cell decreases by a factor of four for each additional level of the grid hierarchy.
Figure 2b compares results to the map obtained with the highest refinement and the highest number of photon packages. The differences are completely dominated by the difference in discretisation. The dependence on the number of photon packages is visible only when comparing runs with the same gridding.
The last column in Fig. 2 shows the wallclock run times, including initialisations and the writing of the surfacebrightness maps for all frequencies. The map size in pixels depends on the discretisation but the effects for the overall run times are not significant. On the test computer, the speedup provided by the GPU varies from ~ 50% (for small number of packages, when the initialisation overheads are significant) close to a factor of ten. The behaviour is qualitatively similar for lower columndensity models where there are fewer multiple scatterings and the cost associated to the creation of a photon package is larger relative to the tracking of the photon paths. The speedup of GPU relative to CPU increases with the number of photon packages, except for the pointsource simulations. Possible reasons for this are discussed in Sect. 4.2.
Fig. 1 Examples of 100μm surfacebrightness maps computed for 3D model clouds with a maximum refinement to n_{L} = 1–4 hierarchy levels. In calculations involving internal heating (as in these examples), point source is placed in an empty root grid cell at the centre of the model volume. 

Open with DEXTER 
Fig. 2 Noise and run times as a function of the number of photon packages for a small spherically symmetric test model. Results are shown for simulations of a point source (panels a–c), a diffuse background (panels d–f), and the dust emission from the model volume (panels g–i). First column: rms noise of the 100 μm map as thedifference of two identical runs (solid lines) and from the comparison to a run with the same volume discretisation (same n_{L}) but the highest number of photon packages (dashed lines). Shading is used to indicate the expected n_{P}^{−1∕2} convergence as a function of the number of photon packages. Second column: rms difference to a corresponding run with the highest number of photon packages and the finest spatial discretisation (n_{L} = 5). The wallclock run times for CPU (solid lines) and GPU (dashed lines) computations are shown in the last column. In each frame, the colours correspond to different values of n_{L}, as indicated in frame c. 

Open with DEXTER 
3.2 Tests with 3D model clouds
The following tests involve a 3D model based on MHD simulations (see Sect. 2.2). We analyse maps that are computed towards the three cardinal directions. The map pixel size corresponds to the smallest model cells. The 10 pc × 10 pc projected area is thus covered by maps with 1310 × 1310 pixels. The average column density is N(H_{2}) ~ 2.4 × 10^{21} cm^{−2} (A_{V} = 2.3 mag) and the maximum column density ranges from 1.78 × 10^{23} cm^{−2} (A_{V} = 172 mag) to 2.46 × 10^{23} cm^{−2} (A_{V} = 238 mag), depending on the view direction. The values of visual extinction A_{V} given in parentheses correspond to the dust model used in the simulations.
The model volume is centred on a site that will give birth to a highmass star. However, in these tests we run the models either without internal heating or using a radiation source that is located in the starforming core but has an ad hoc luminosity that is made so high that the dust temperatures converge only after several iterations.
We start by checking how the noise behaves as a function of the number of photon packages or the run time. Compared to Sect. 3.1, the grid is now fixed but the model size is closer to that of potential real applications. Figure 3 shows the results for a single iteration. The noise decreases mostly approximately according to the relation. In the case of a point source, the convergence is slightly faster because with lower package numbers some cells at the model boundaries may not be hit at all. These cells get assigned an ad hoc constant temperature and, in spite of their low number, have an impact on overall noise values.
Plots contain two relations for dust reemission. In the default method, the same number of photon packages is sent per cell (with random locations and directions within each cell). For uniform sampling, SOC also requires the number of photon packages (per frequency) to be a multiple of the number of cells. Therefore, results for runs with a smaller number of requested photon packages end up at the same location in the plot as the actual number of photons packages just above n_{P} ~ 10^{6}. The other relations (open symbols) correspond to simulations where the number of emitted photon packages is weighted according to the emission. These runs include, as constant contributions, the heating from previous simulations of the external radiation field and the point source. Hot dust (temperature above 100 K) is found only near the central source. The convergence is slower than because, in the case of emission weighting, the maximum number of photon packages sent from any single cell was limited to 10 000 with a userdefined parameter. Such a cap may sometimes be necessary to ensure proper sampling also for the emission from cooler dust, which could be important locally in regions far from the hottest dust. On the other hand, an increase in n_{P} will not improve the accuracy with which one simulates the emission from cells that have already reached the cap value.
Apart from constant overheads at small photon numbers, the run times are generally directly proportional to n_{P}. The speedup provided by the GPU is approximately a factor of four in the pointsource and background radiation simulations and slightly higher for the standard dust reemission calculation. The situation is very different when emission weighting is used. Compared to the unweighted case, the run times are shorter on CPU while on GPU they are longer. This is discussed further in Sect. 4.2.
Without photon splitting or similar techniques, each additional level of the hierarchy should decrease the probability of photon hits by a factor of four. Therefore, the noise should increase proportionally to 2^{L}, where L is the grid level (larger L standing for smaller cells). Figure 4 shows the actual rms error of dust temperatures as a function of the hierarchy level. The 2^{L} dependence holds for the background radiation. In the pointsource simulation, the noise is constant or even decreases at the highest levels because those cells are on average closer to the source. For the simulated dust reemission, the noise values are lower but increase rapidly on the highest refinement levels. This is partly an artefact of the model setup where the cells on low grid levels are heated mainly by sources other than the dust reemission and therefore in this test have a low noise. The emissionweighting leads to lower noise values that also are more uniform between cells of different size.
Run times should be proportional to the number of cells (assuming that the sampling of the radiation field is kept uniform) but, in our case, deeper grid hierarchies are associated with some overhead in the tracking of the photon packages. Figure 5 shows the run times as a function of the number of cells in models that are refined down to n_{L} = 1–7. The number of photon packages is kept at 1.8 × 10^{7} so that plot shows only the effect of discretisation. In the plot, the run times increase slower than the number of cells because cells at higher hierarchy levels are hit by progressively fewer photon packages. To ensure a certain signaltonoise ratio (S/N) even for the refined regions, the number of photon packages should be proportional to 2^{nL} (Fig. 4). An increase in the overhead is visible for deeper hierarchies with n_{L} = 5–7 although the run times are still almost proportional to the number of cells. As indicated by Table 1, even though the tracing of the photon paths through cells at high refinement levels were significantly slower, the effect on the total run times is limited because of the small fractional number of those cells. Some GPU runs appear to deviate from the general trends. Emissionweighted simulations of dust reemission slow down for deeper hierarchies (see Fig. 3 and discussion above) and for n_{L} = 5–7 are similar to the CPU run times. Furthermore, pointsource simulations suffer from coarse discretisation (n_{L} ≤ 4), possibly because of the locking overheads for global (multiple threads doing frequent updates to the same cells close to the point source).
Fig. 3 Test with highresolution model in the case of only a point source (panel a) or only background radiation (panel b), or including both as constant radiation field components to examine the noise in the simulation of dust reemission. The rms errors as a function of the number of photon packages are shown with black symbols. The circles, squares, and triangles correspond to maps calculated toward three orthogonal directions. The shading shows the expected N^{−1∕2} convergence.The lines and righthand yaxis indicate the run times for CPU (blue) and GPU (red). Panel c: open symbols and dashed lines correspond to an alternative run with emission weighting. 

Open with DEXTER 
Fig. 4 Error of the computed dust temperatures as a function of the grid hierarchy in a model with n_{L} = 7. From top to bottom panels: curves correspond to simulations of a point source (red curve), heating by background radiation (black curve), and simulations of dust emission when the contribution of the previous radiation sources is kept constant (blue curves). The solid and dashed lines correspond to the default and the emissionweighted simulations, respectively. The shaded regions are used to illustrate the expected 2^{level} dependence of the noise. All calculations were done with 1.8 × 10^{7} photon packages per frequency. 

Open with DEXTER 
3.3 Iterative solution of dust temperature
Above we were only concerned with the simulations of the radiation field. For optically thick models and especially in the case of internal radiation sources, the question of the convergence of the temperature values becomes equally important. Calculations could be sped up by reducing the number of iterations required for a converged solution or by reducing the time per iteration.
We first examine the performance of the ALI method as a function of the model discretisation. We are using ALI with a diagonal operator that only separates the absorptionemission cycles within individual cells. The effects should depend on the discretisation. Higher spatial resolution means that the optical depth of individual cells is smaller and therefore we can expect less benefit fromthe use of ALI.
We use the same density field as in Sect. 3.2 and a single internal radiation source. The original model described a (10 pc)^{3} volume where the effects of an even very luminous source would remain local. Therefore, in this test the linear size of the cloud was decreased by a factor of 20, the densities were increased by a factor of 100, and the luminosity of the radiation source was set so that the temperature of the closest cells is hundreds of degrees. These ensure that dust reemission is important over a larger volume and that the dust temperatures converge only after many iterations. The setup is only used to test the RT methods and is not supposed to be a physically accurate description of a starforming core.
Figure 6 shows the convergence of temperature values for the n_{L} = 4 model for runs with n_{P} ~ 18 × 10^{6}. The convergence is measured based on the average dust temperatures on only the highest level of refinement (i.e. cells close to the point source), comparing these to a nonALI run with the same n_{P} and 40 iterations. Based on the rate of convergence in Fig. 6, the error of that reference should be two orders of magnitude smaller than on the final iterations shown in the figure.
The average temperature is initially increasing by ~ 10 K per iteration. After 20 iterations, this rate has decreased by a factor of one hundred. ALI leads to a faster convergence and the rate of convergence is about the same for all cells, irrespective of their location with respect to the point source. In run times, the overhead of ALI is some 5%, which is more than compensated for by the faster convergence. The rms errors are similar with and without ALI.
Figure 6 shows further how, depending on the requirements on accuracy (bias and random errors), the run times could be significantly shortened simply by reducing the number of photon packages. The rms errors are naturally higher but this does not affect the initial rate of convergence measured using ⟨ΔT⟩. However, with low photon numbers, the convergence stops earlier and also the bias of the final temperature estimates is larger. When n_{P} is reduced by a factor of 64, the final bias is Δ⟨T⟩ ~ 1 K. The bias is even more significant in the resulting surfacebrightness maps, analogous to the way LOS temperature variation biases observational dust temperature estimates (Shetty et al. 2009; Juvela & Ysard 2012); see Fig. 6.
In Fig. 6b the convergence of the ALI runs saturates at a level ⟨ΔT⟩ ~ 0.1 K. Qualitatively, this could be expected based on the above results with lower photon number. However, we measure convergence with respect to a reference solution that is calculated with 40 iterations but without ALI. Like the lowphotonnumber runs, the reference solution will have a systematic error that is larger than suggested by the extrapolation of the initial linear trend in Fig. 6b. The fact that the ⟨ΔT⟩ curve of the ALI run flattens relative to that reference solution suggests that ALI may be more sensitive to Monte Carlo noise.
The emission maps and error maps for the final iteration of Fig. 6 are shown in Appendix B.
Fig. 5 Dependence of run times on the maximum refinement. The colours correspond to simulations of the radiation from a point source (red), external background (black), and dust reemission (blue). For dust emission, the dashed lines and open symbols correspond to a run using emission weighting. The CPU run times are plotted with circles and the GPU run times with squares. The shading indicates the trend for run times proportional to the number of cells. 

Open with DEXTER 
Fig. 6 Convergence of dust temperature values as a function of iterations and the run time on CPU. Temperatures are from the cells on the finest level of refinement of a model with n_{L} = 4. Panel a: average temperature for basic runs (solid lines) and for ALI runs (dashed lines and open symbols). The black line is the average for all cells on the level L = 4 and the red curve is for 5% of the cells with the highest temperatures. The blue and cyan curves correspond to the average of all L = 4 cells in runs with a reduced number of photon packages n_{P}. Panel b: errors relative to a run with 40 iterations and without ALI. Panel c: rms errors for L = 4 cells calculated as the standard deviation between two independent runs. 

Open with DEXTER 
3.4 Faster iterative solutions
When the convergence of temperature values requires many iterations, the calculations can be sped up in at least three ways. These include the use of subiterations, the use of a reference field, and runtime model refinement.
The idea behind subiterations is that temperature updates are sometimes restricted to an “active” subset of cells whose temperatures and temperature changes are most relevant for the final solution. This results in savings in the simulation step, because emission is resimulated only from a fraction of all cells, and in the temperature updates, which are similarly restricted to a subset of cells. Some overhead is caused by the necessity to use a reference field to store the contribution of other cells to the total radiation field. We do not test this method here because emission weighting provides similar savings in the simulation step. Because our tests do not include stochastically heated grains, the contribution of temperature updates to the total run times is at the level of only 1%. For stochastically heated dust, the run times could be dominated by the calculation of the temperature distributions (see Appendix A) and a simpler version of subiterations can be implemented simply by skipping the temperature updates for weakly emitting cells.
The useof a reference field enables speedup because, for a given final noise level of the solution, the number of photon packages per iteration can be lower. In the case of a hierarchical grid, the most refined regions tend to have both the highest noise and the slowest convergence. Therefore, some care must be taken to ensure that the solution has truly converged in those regions.
Figure 7 shows results for the n_{L} = 4 model when using a reference field. This can be compared to the previous plots of the rms noise in Fig. 4 and the convergence in Fig. 6. The setup is identical (including background and a point source and constant radiation sources) butthe number of photon packages per iteration has been decreased by a factor of 16. Examples of the corresponding surfacebrightness maps can be found in Appendix B.
The runtimes are significantly shorter than in Fig. 6 but only by a factor of approximately six rather than a factor of 16 between the number of photon packages. This is caused by the nonlinearity seen in Fig. 2i, the lower efficiency of simulations with low photon numbers that should disappear for sufficiently large photon numbers. The convergence rate in Fig. 7b should depend only on the use of ALI. Using ALI results in smaller ΔT errors but the difference is smaller than in Fig. 6b, probably because the larger noise on the first iteration decreases the efficiency of ALI corrections. The effect of a reference field is seen in Fig. 7b where it decreases that final rms error by a factor of approximately three. The combination of ALI and a reference field increases the run time per iteration by close to 30% while the reference field alone is not associated with any overheads.
Fig. 7 Results for the n_{L} = 4 model when using a reference field. All statistics refer to the average dust temperature of the cells on the highest L = 4 level of the grid hierarchy. Panel a: temperature error relative to the solution obtained with the same setup after 20 iterations. Panel b: rms temperature difference between two independent runs, the red curves showing these separately for 5% of the cells with the highest temperatures. Circles stand for the basic calculations (no ALI and no reference field), squares to a reference field runs, and triangles to the combination of the reference field and ALI techniques. Values are plotted against the run time and the upper xaxis shows the corresponding number of iterations in the basic run. 

Open with DEXTER 
Fig. 8 Convergence of dust temperature values for models of different refinement. The colour scale shows the difference of the average dust temperature at the highest level of refinement (L = n_{L}) compared to the solution after 20 iterations. The number of hierarchy levels (n_{L}) is on the yaxis. Calculations are done without ALI and without a reference field. The contours are drawn at log_{10} a for a = −1.5, −1.0, −0.5, 0.0, and 0.5. 

Open with DEXTER 
3.5 Runtime grid refinement
Before discussing tests with runtime model refinement, Fig. 8 shows how dust temperature errors depend on the number iterations and the number of hierarchy levels (n_{L}). Neither ALI nor a reference field is being used and the discretisation is constant throughout the calculations, which each correspond to one row in the plot. The plot only measures the errors related to the convergence of temperature values. The errors are calculated for cells at the highest level (L = n_{L}), in relation to the result obtained with the same n_{L} after 20 iterations. Discretisation errors are therefore excluded from the plot. The figure quantifies how an approximate solution of a lower resolution model can be found with fewer iterations. For example, an error of ΔT = 0.1 K (log_{10} ΔT = − 1) for n_{L} = 1 is reached in eight iterations while ~20 iterations are needed for n_{L} = 4. The fullresolution model would need at least 30 iterations. For the idea of runtime grid refinement, this means that the initial iterations with lowresolution models are not only faster (time per iteration) but their number also should remain small compared to the total number of iterations.
Figure 9 shows the results for a run with runtime refinement of the model. Calculations start with the root grid only (n_{L} = 1). One level is added on iterations 5, 9, and 15, thereafter the remaining run proceeds with the full n_{L} = 4 model. When the grid is refined, also the number of photon packages is quadrupled so that the final iterations have the same 18 million photon packages per frequency as in previous tests (e.g. Fig. 4).
The initial iterations are very fast. However, Fig. 9 shows that runtime refinement does not have a significant effect on the final convergence. After the final refinement, the error ΔT is half of the value of the basic run that corresponds to the same run time. However, subsequent convergence remains almost identical to the case where the n_{L} = 4 grid was used on all iterations.
Fig. 9 Convergence of temperatures for basic runs with the n_{L} = 4 model (dashed lines) and with runtime refinement of the spatial grid from n_{L} = 1 to n_{L} = 4 (solid lines). The results are shown for the average of all L = 4 cells (black lines) and for the average of 5% of the warmest L = 4 cells (red lines). Convergence ΔT is measured as the difference from a run with 40 iterations and the same n_{P}. In the case of runtime refinement, the open symbols correspond to initial iterations with n_{L} < 4; they are drawn at ΔT = 100 K, and only indicate the run times of those steps. 

Open with DEXTER 
3.6 Variable number of photon packages
Apart from the number of cells, the number of photon packages is the main factor determining the run times. Therefore, we investigated if a good solution can be found faster if the number of packages was increased during the iterations. An acceptable solution clearly requires both convergence and low random errors. Figure 6 already suggested that these are not independent and systematic error measured by ΔT also depends on the random Monte Carlo noise.
In Fig. 10 we examine runs with 22 iterations where the final number of photon packages n_{P} is again 18 million. However, this time the initial number of photon packages is smaller by a factor of 200 and photon numbers are increased so that log n_{P} grows linearly over the iterations.
For the basic method and the reference field method the rate of convergence is similar but the final rms error of the reference field method is two times lower. In principle, if n_{P} were constant, the reference field method could result in an rms noise that is smaller by a factor of . The advantage ishere smaller because initial iterations employ a smaller number of photon packages. More importantly, the reference field is less efficient because the dust temperatures change significantly over the iterations.
Unlike for example in Fig. 6, the use of ALI not only increases the rms errors but also results in a slower convergence. This is probably a result of large Monte Carlo noise on the initial iterations that also renders the ALI updates noisy and thus ineffective. The combination of ALI and a reference field performs somewhat better but the convergence measured against the run time is still worse than without ALI. For reference, Fig. 6 also shows the result for the combination of ALI and a reference field when all iterations use 18 million photon packages. There the convergence per iteration is much faster. When measured against the actual run time, the convergence in ΔT is initially similar and later inferior to the variable n_{P} runs.
4 Discussion
In this paper, we describe the implementation of the RT programme SOC and quantify its performance in the modelling of dust emission from interstellar clouds. Unlike most benchmark papers, we also examine the actual run times and especially the relative performanceof CPUs and GPUs.
4.1 Radiative transfer methods
SOC is based on Monte Carlo simulations and the tests show that it behaves according to expectations. The Monte Carlo noise is inversely proportional to the square root of the number of photon packages. Similarly, the noise is dependent on the level of the grid refinement, each additional hierarchy level approximately decreasing the number of photon package hits by a factor of four and increasing the rms noise by a factor of two. The experiments with photon package splitting schemes are mentioned only briefly in this paper because their success was found to be limited. They do decrease somewhat the noise at higher refinement levels and might be indispensable for deeper hierarchies. However, in our tests photon package splitting did not lead to significant savings in the actual computational cost. These methods require further investigation. The penetration of external radiation into highdensityregions is decreased by backscattering and therefore photon splitting might need to be combined with directional weighting to increase the probability of photon packages reaching the highest column density regions.
In addition to the pure radiation field simulations, we studied the convergence of the dust temperatures in optically thick models with internal heating sources. The ALI and reference field methods were tested, also in relation to the other run parameters like the number of photon packages per iteration and the discretisation of the model volume.
ALI improves the temperature convergence but is relevant only when both optical depths and dust temperatures are high. In the context of interstellar clouds, benefits are noticeable only near embedded heating sources, potentially in a very small fraction of the wholemodel volume (although in relative terms a larger fraction of grid cells). To reduce memory requirements (one additional number per cell) and run times, the use of ALI could be restricted to selected cells. This would only be a small complication in the RT implementation. However, in our tests where ALI was included for all cells, the run time overhead was not very significant, only some tens of percent.
The most straightforward way to speed up calculations is to use fewer photon packages. This of course increases the noise of the solution, but when the solution also requires a number of iterations, it gives room for further optimisations. Significant savings are possible if initial iterations are performed quickly, with a low number of photon packages n_{P}. Parameter n_{P} can be increased with iterations to ensure that random errors remain comparable to the convergence errors. This turned out to work less reliably in connection with ALI, which provided clear acceleration only when the random errors were kept low. The final rms error of the solution also tended to be larger when ALI was used (Figs. 7 and 10).
The most robust way to speed up computations was to gradually increase n_{P}, without ALI but using the reference field method (Fig. 10). Without a reference field, the final accuracy will be limited by the number of photon packages per iteration (clearly demonstrated by Fig. 6). This determines the rms errors but may also impact the convergence. With a reference field, the rms errors decrease as iterations progress, making it also easier to track the convergence. The fastest convergence in terms of the run time was reached when the number of photon packages n_{P} was increased with iterations. Changes in n_{P} must of course be taken into account also in the reference field updates. Initial iterations are therefore given a smaller weight, which is also useful because the reference field is still far from the final solution.
ALI methods are very likely still necessary for models more optically thick than the ones tested in this paper. The critical quantity is the optical depth of individual cells, especially if the ALI scheme does not explicitly consider longer distance interactions. In general, hierarchical grids enable finer discretisation of dense regions, which reduces the optical depth of individual cells and thus reduces the benefits of using ALI. In this paper, only the diagonal part of the Λ operator was separated. The next step, explicit treatment of the radiative couplings between a cell and its six Cartesian neighbours, may already be excluded by the associated storage overhead. The implementation in connection with a hierarchical grid would also be significantly more complicated.
Finally, we also tested runs where the spatial discretisation was refined during the iterations. A large cell size used on the first iterations could increase the speed with which information traverses an optically thick model, especially if ALI is used to accelerate the convergence within the individual cells. In practice, the results were not very encouraging (Fig. 9). Iterations with low n_{L} are indeed very fast but changes in the gridding cause large temperature jumps and the final convergence is not improved. In the tested model, the temperature field contains significant structure even at very small scales. A change in discretisation significantly changes the RT problem itself (cf. Fig. 2), also changing the optical depths between the radiation sources and the cells. Our implementation of the regridding procedure could be improved. We assigned the temperatureof a parent cell to all its children while 3Dinterpolated values should work better. In smooth models with small density and radiation field gradients, the convergence would naturally be less disturbed by changes in the grid.
We tested SOC using calculations with a single dust population and assuming that the grains are at an equilibrium temperature. SOC will be developed further to allow the modelling of multiple dust components. This requires only small kernel modifications but implies an increase in the memoryusage. If the scattering function was constant, one could store for each cell (instead of one number, the density)both the absorption and scattering cross sections. However, to model the scattering accurately, the abundance of each dust population is needed separately for each cell. This makes it possible to make runtime Monte Carlo sampling from the ensemble of scattering functions. However, this will also at least double the memory usage.
Full RT modelling of dust emission requires both the evaluation of the radiation field and the estimation of the resulting dust emission. When grains are assumed to remain at an equilibrium temperature, the latter problem is not significant for the overall computational cost. However, to model midinfrared emission from stochastically heated grains, the run times may become dominated by this task, which includes the computation of temperatureprobabilitydensity distributions for each cell, grain population, and grain size. SOC delegates this to an external program. However, in Appendix A we discuss how also these calculations can be sped up by using GPU computing. The use of GPUs in this context has already been discussed, for example in Siebenmorgen & Heymann (2012).
Fig. 10 Convergence and rms errors of temperatures in runs where the number of photon packages n_{P} is increased by a factor of 200 over the iterations. The final iterations use 18 million photon packages per frequency. Results are shown for different combinations of ALI and reference field methods, as indicated in panel a. For reference, the red curves show the results for the constant n_{P} of 18 million photon packages per iteration. Markers are drawn for every second iteration. 

Open with DEXTER 
4.2 Implementation and CPU versus GPU comparisons
The current SOC version is implemented in Python, which is convenient for rapid development, but as an interpreted language is not expected to be fast. In practice, this is not a problem because most calculations are performed by the OpenCL kernels that are compiled at run time. In CPU runs with 3D models (n_{L} = 2), some 93% of the total run time was used by the kernel for the RT simulation, less than 1% by the dust temperature calculations, and some 2.5% by the kernel for the map calculations. The remaining part includes the execution of the Python host code, the compilation of the OpenCL kernels, the data transfer between the host and the device, and the reading and writing of data files. In CPU runs these amount to little more than 3% of the total run time, but in short GPU runs, because of the much faster kernel execution, they can reach 30%. However, this would not disappear entirely even if the host code were compiled. Indeed, comparisons with previous SOC versions, where the main program was written in C++, suggested at most ~ 10% overhead due to the use of Python.
Experience has shown that SOC is usually (but not always) slightly faster than CRT (Juvela 2005), when both are run using CPUs and the same nonhierarchical grids. In CRT the critical parts have been parallelised using OpenMP. However, comparisons are not trivial because of slight differences in the implementations (e.g. how randomness is reduced in the case of different radiation sources or how the run times scale with the model size). Such tests would be useful, but only when conducted systematically over a large number of test cases and comparing the actual noise properties of the results.
Theoretical peak performance of modern GPUs is very high, which could translate to much shorter run times and smaller energy consumption (Huang et al. 2009; Said et al. 2016). In the test system the theoretical ratio was over a factor of 20 in favour of the GPU. In practice the theoretical speedup is never reached, mainly because of datatransfer overheads. This was true also in the SOC tests where the GPU was typically faster only by a factor of 2–10.
The relative performance of GPUs tends to improve with increasing problem sizes, with increasing numbers of cells or, as in Fig. 2, with increasing numbers of photon packages. However, there were also exceptions. In the case of pointsource simulations (Fig. 2c), this could be caused by the increasing overheads in GPU atomic operations when many threads are simultaneously updating a small number of cells close to the source. The same explanation may also apply to the problems seen when using emission weighting on GPUs. Although emission weighting results in lower noise for a given n_{P}, on GPU it increased (at n_{P} ~ 10^{6}) the run times by up to a factor of a few (Fig. 3c). Also in this case, most updates concern a small number of cells, those with the highest dust temperatures. The effect is accentuated by high optical depths that result in frequent scatterings and thus even more frequent updates. These effects will be smaller for models with multiple point sources, a larger number of cells, and lower optical depths. The problem could be alleviated by interleaving the creation and tracking of photon packages so that all threads do not create new photon packages in the same cells and at exactly the same time. New OpenCL versions with native support for atomic operations should further decrease the overheads. In Fig. 3c, the problem disappears for large n_{P} but this is only a side effect from the limit on the maximum number of photon packages emitted from any single cell.
In contrast with the GPU results, calculations were faster on a CPU when emission weighting was used. This could be the result of improved cache utilisation, similar to the (factor of ~ 2) effect observed in Lunttila & Juvela (2012). In OpenCL, the threads belonging to the same work group perform computations in lockstep. This means that all threads create and perform initial tracking of photon packages at the same time and within a small volume around the embedded radiation source. With a smaller number of threads and larger cache memories, the net effect can be positive on CPUs. The data for the most frequently accessed cells may remain in cache during a whole run, but it is difficult to say if this alone explains the observed speed up by a factor of approximately five (Fig. 3c). The above examples at least demonstrate that, although the same program can be run on both CPUs and GPUs, best performance may require different algorithm optimisations on different platforms.
5 Conclusions
The ability of SOC to produce correct results in dust RT problems has already been tested in Gordon et al. (2017). In this paper, we concentrate on the performance of SOC and investigate methods that could speed up the computations in problems where the final dust temperatures are obtained only after several iterations. We draw the following conclusions from our tests.
SOC performs well in comparison to for example the CRT program (Juvela 2005) and modern GPUs provide a speedup of a factor of between two and ten compared to a multicore CPU. Further reduction of run times should be possible by finetuning the algorithms.
The noise of the temperature solution behaves as expected: it is inversely proportional to the square root of photon packages and increases by a factor of two for each additional level of the spatial grid hierarchy. The tested photon splitting scheme did not significantly reduce the noise of high hierarchy levels relative to the run time.
In the test cases, ALI provided moderate acceleration for the convergence of dust temperature values. The run time overhead varied from case to case but was on the order of 10%, small compared to the potential benefits from the faster convergence.
The use of a reference field without ALI was found to be the most robust alternative. The desired accuracy could be reached in the least amount of time by doing the initial iterations with fewer photon packages.
SOC will be developed further to accommodate multiple dust populations; already in Appendix A we discuss tests on the use of GPUs to speed up the calculations of stochastically heated grain emission.
Acknowledgements
We acknowledge the support of the Academy of Finland Grant No. 285769.
Appendix A Calculations with stochastically heated grains
SOC concentrates on solving the RT problem and only solves grain temperatures for grains in equilibrium with the radiation field. For stochastically heated grains, these computations are delegated to an external program, such as the one that in Camps et al. (2015) was used in connection with the CRT code. Here we present some results from tests on implementing similar routines with Python and OpenCL. We refer to the old code as the C program and the new one as the OpenCL program.
Tests were made using a single dust component and a 3D model cloud that consisted of 8000 cells, sufficient to get accurate runtime measurements. The dust corresponds to astronomical silicates as defined in the DustEM package Compiègne et al. (2011). The grain size distribution extends from 4 nm to 2 μm and is discretised into 25 logarithmic size bins. All grains were treated in the tests as stochastically heated while in real applications the largest grains could be handled using the equilibrium temperature approximation. The calculations employed a logarithmic discretisation of enthalpies that in temperature extend from 4 to 150 K for the largest grains and from 4 to 2500 K for the smallest. The model cloud was illuminated by the standard interstellar radiation field (Mathis et al. 1983). The column density of the cloud varied from N(H_{2}) ~ 3 × 10^{19} cm^{−2} to N(H_{2}) = 1 × 10^{22} cm^{−2}. This ensured a wide range of radiation field intensities, especially for the shorter wavelengths that are relevant for midinfrared dust emission. RT simulations used a logarithmic grid of 128 frequencies between the Lyman limit and 2 mm.
We used as the reference the C program and its routine that solves the dust temperatures under the “thermal continuous” cooling approximation as described in Draine & Li (2001). The calculation reduces to a linear set of equations where the unknowns are the fraction of dust in each enthalpy bin. The C program precalculates weights for the integration of the absorbed energy over frequency as well as the cooling rates that in the thermal continuous approximation only extend downwards to the next enthalpy bin. When the dust emission is solved cellbycell, the program gets a vector of radiation field intensities (in practice number of absorbed photons). In the transition matrix R, the upward transitions (R_{j,i}, i < j) are obtained by taking a vector product of the intensity with the integration weights. The precalculated cooling rates occupy the elements R_{i−1,i} above the main diagonal. The diagonal elements R_{i,i} are determined from detailed balance and are equal to the sum of the other column elements multiplied by minus one. The matrix elements R_{j,i} = 0, i > j are zeros, which means that the linear equations can be solved efficiently with forward substitutions. The C program is parallelised with OpenMP, further optimisations including the use of SSE instructions.
In the OpenCL program we tested first the use of an iterative solver. Iterative solvers are attractive because one is typically dealing with large 3D models where the neighbouring cells are subjected to a very similar radiation field. By using the solution of the preceding cell as the starting values for the next one, it is likely that the number of iterations can be kept small. We tested only basic GaussSeidel iterations with Jacobi (diagonal) preconditioning. By using the solution of the first cell to start the iterations for each of the other cells, less than ten iterations and a maximum of ~ 50 were needed to reach an accuracy that in the final surfacebrightness maps translated to rms errors of a couple of per cent (over a spectral range spanning more than 10 orders of magnitude in absolute intensity). On the CPU, using the same number of CPU cores, the run time was nearly identical to that of the C program. On a GPU, the OpenCL version was faster by a factor of approximately five. In the case of the thermal continuous approximation, the explicit solution is already very fast. Therefore, in a general case (R_{j,i}≠0 for j < i), iterative solvers should be a good option.
We could not exactly reproduce the results of the C program even with more iterations. This may be due to the use of singleprecision floating point numbers. The use of double precision would slow down the GPU computations, depending on the hardware. Furthermore, although GaussSeidel iterations provided a sufficient (but still a lowprecision) solution in just a few iterations, the convergence is not guaranteed. The rate matrix is not diagonally dominant and the spectral radius of the iteration matrix was either very close to or even larger than one. The iterations should thus eventually diverge, which was indeed observed if continued further beyond one hundred iterations. However, when the problem is similar for a very large number of cells, one could calculate better preconditioners with a small cost per cell.
We also implemented an explicit forwardsubstitution algorithm similar to that of the C program. This is the natural option in the case of the thermal continuous approximation. The routine worked reliably but only when part of the operations were performed in double precision. The use of double precision resulted in some 25% increase in the GPU run times but had no effect on CPUs. The results were identical to the C program, almost down to the machine precision. Because the algorithm is faster, the run times were shorter than for the iterative solver. Compared to the C program, the OpenCL routine was 5.6 times faster when run on a CPU and 21 times faster when run on a GPU. The speedup on the CPU suggests that the parallelisation of the C program was not optimal but the results also depend on other factors, such as the memory and diskaccess patterns. On the laptop, the OpenCL program ran about four times faster on the GPU than on the sixcore CPU.
The actual wallclock run time on the laptop GPU was some 0.5 ms per cell, which includes the calculations of the dust temperaturedistributions and the resulting dust emission at 128 frequencies. Assuming that modelling involved four dust populations, this would translate to a rate of 500 cells per second and a run time of some half an hour for a model of 10^{6} cells. The time required for the RT simulations is of the same order of magnitude, the exact balance depending on the chosen frequency, enthalpy, and grain size discretisations. The costs of RT and dust temperature calculations both also scale approximately linearly with the number of cells. It is therefore already feasible to directly solve the emission of stochastically heated grains even for relatively large 3D models. Table lookup methods are still relevant because they also reduce the number of frequencies at which the radiation field needs to be estimated (Juvela & Padoan 2003; Baes et al. 2011). Nevertheless, GPUs can speed up the construction of large lookup tables and thus also improve the accuracy of those methods.
Appendix B Examples of surfacebrightness maps
In Sect. 3 we examined the accuracy of SOC results mainly in terms of dust temperature. Here we present examples of surfacebrightness maps that correspond to the tests in Figs. 6 and 7, the final result after 20 iterations. Surfacebrightness errors are shown by plotting the difference of two independent runs.
Figure B.1 shows the maps that correspond to Fig. 6, the runs without ALI where the number of photon
Fig. B.1 Surfacebrightness maps at 100 μm for the final iteration of the nonALI runs of Fig. 6. The three rows correspond, respectively, to the default n_{P} value of 1.8 × 10^{7} and to n_{P} values smaller by a factor of 8 or 64. Left panels: 100 μm surface brightness I_{ν}(100 μm). Right panels: difference ΔI_{ν}(100 μm) between two identical runs. All maps are in units of 10^{8} Jy sr^{−1}. 

Open with DEXTER 
packages per iteration was 18 million or smaller by a factor of 8 or 64. The noise is small enough to be visible only in the difference maps that here only containerrors from the simulation of the reradiated dust emission. The error maps show a radial pattern because hot dust is found only close to the central point source. The relative contribution of reradiated dust emission is smaller in directions where more of the pointsource radiation escapes the central clump. This explains the general asymmetry of the pattern where the errors tend to be smaller on the upperlefthand side.
Figure B.2 shows the results when also the reference field technique is used. The upper frames correspond directly to the runs in Fig. 7.
Fig. B.2 As in Fig. B.1 but for the runs of Fig. 7 with a reference field. The number of photon packages is n_{P} = 1.1 × 10^{6} (upper panels) or four time smaller (lower panels). Maps are in units of 10^{8} Jy sr^{−1}. 

Open with DEXTER 
References
 Baes, M., & Camps, P. 2015, Astron. Comput., 12, 33 [NASA ADS] [CrossRef] [Google Scholar]
 Baes, M., Gordon, K. D., Lunttila, T., et al. 2016, A&A, 590, A55 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Baes, M., Verstappen, J., De Looze, I., et al. 2011, ApJS, 196, 22 [NASA ADS] [CrossRef] [Google Scholar]
 Bernes, C. 1979, A&A, 73, 67 [NASA ADS] [Google Scholar]
 Bethell, T. J., Chepurnov, A., Lazarian, A., & Kim, J. 2007, ApJ, 663, 1055 [NASA ADS] [CrossRef] [Google Scholar]
 Bianchi, S., Ferrara, A., & Giovanardi, C. 1996, ApJ, 465, 127 [NASA ADS] [CrossRef] [Google Scholar]
 Bjorkman, J. E., & Wood, K. 2001, ApJ, 554, 615 [NASA ADS] [CrossRef] [Google Scholar]
 Camps, P., Misselt, K., Bianchi, S., et al. 2015, A&A, 580, A87 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Chakrabarti, S., & Whitney, B. A. 2009, ApJ, 690, 1432 [NASA ADS] [CrossRef] [Google Scholar]
 Compiègne, M., Verstraete, L., Jones, A., et al. 2011, A&A, 525, A103 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Draine, B. T., & Li, A. 2001, ApJ, 551, 807 [NASA ADS] [CrossRef] [Google Scholar]
 Dullemond, C. P., & Turolla, R. 2000, A&A, 360, 1187 [NASA ADS] [Google Scholar]
 Ercolano, B., Barlow, M. J., & Storey, P. J. 2005, MNRAS, 362, 1038 [NASA ADS] [CrossRef] [Google Scholar]
 Gordon, K. D., Misselt, K. A., Witt, A. N., & Clayton, G. C. 2001, ApJ, 551, 269 [NASA ADS] [CrossRef] [Google Scholar]
 Gordon, K. D., Baes, M., Bianchi, S., et al. 2017, A&A, 603, A114 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Harries, T. J. 2015, MNRAS, 448, 3156 [NASA ADS] [CrossRef] [Google Scholar]
 Harries, T. J., Monnier, J. D., Symington, N. H., & Kurosawa, R. 2004, MNRAS, 350, 565 [NASA ADS] [CrossRef] [Google Scholar]
 Heymann, F., & Siebenmorgen, R. 2012, ApJ, 751, 27 [NASA ADS] [CrossRef] [Google Scholar]
 Huang, S., Xiao, S., & Feng, W. 2009, IEEE International Symposium on Parallel Distributed Processing, 1 [Google Scholar]
 Ivezic, Z., Groenewegen, M. A. T., Men’shchikov, A., & Szczerba, R. 1997, MNRAS, 291, 121 [NASA ADS] [CrossRef] [Google Scholar]
 Jonsson, P. 2006, MNRAS, 372, 2 [NASA ADS] [CrossRef] [Google Scholar]
 Juvela, M. 2005, A&A, 440, 531 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Juvela, M., & Padoan, P. 2003, A&A, 397, 201 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Juvela, M., & Ysard, N. 2012, A&A, 539, A71 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Juvela, M., Guillet, V., Liu, T., et al. 2018a, A&A, 620, A26 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Juvela, M., Malinen, J., Montillaud, J., et al. 2018b, A&A, 614, A83 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Lunttila, T., & Juvela, M. 2012, A&A, 544, A52 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Malik, M., Grosheintz, L., Mendonça, J. M., et al. 2017, AJ, 153, 56 [NASA ADS] [CrossRef] [Google Scholar]
 Mathis, J. S., Mezger, P. G., & Panagia, N. 1983, A&A, 128, 212 [NASA ADS] [Google Scholar]
 Natale, G., Popescu, C. C., Tuffs, R. J., & Semionov, D. 2014, MNRAS, 438, 3137 [NASA ADS] [CrossRef] [Google Scholar]
 Padoan, P., Pan, L., Haugbølle, T., & Nordlund, Å. 2016a, ApJ, 822, 11 [NASA ADS] [CrossRef] [Google Scholar]
 Padoan, P., Juvela, M., Pan, L., Haugbølle, T., & Nordlund, Å. 2016b, ApJ, 826, 140 [NASA ADS] [CrossRef] [Google Scholar]
 Padoan, P., Haugbølle, T., Nordlund, Å., & Frimann, S. 2017, ApJ, 840, 48 [NASA ADS] [CrossRef] [Google Scholar]
 Pascucci, I., Wolf, S., Steinacker, J., et al. 2004, A&A, 417, 793 [NASA ADS] [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
 Peest, C., Camps, P., Stalevski, M., Baes, M., & Siebenmorgen, R. 2017, A&A, 601, A92 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Pelkonen, V.M., Juvela, M., & Padoan, P. 2007, A&A, 461, 551 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Pelkonen, V.M., Juvela, M., & Padoan, P. 2009, A&A, 502, 833 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Pinte, C., Ménard, F., Duchêne, G., & Bastien, P. 2006, A&A, 459, 797 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Planck Collaboration XXVIII. 2016, A&A, 594, A28 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Reissl, S., Wolf, S., & Brauer, R. 2016, A&A, 593, A87 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Robitaille, T. P. 2011, A&A, 536, A79 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Saftly, W., Camps, P., Baes, M., et al. 2013, A&A, 554, A10 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Said, I., Fortin, P., Lamotte, J.L., Dolbeau, R., & Calandra, H. 2016, Proceedings of the 24th High Performance Computing Symposium (HPC 16), 25 [Google Scholar]
 Shetty, R., Kauffmann, J., Schnee, S., Goodman, A. A., & Ercolano, B. 2009, ApJ, 696, 2234 [NASA ADS] [CrossRef] [Google Scholar]
 Siebenmorgen,R., & Heymann, F. 2012, A&A, 543, A25 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Steinacker, J., Henning, T., Bacmann, A., & Semenov, D. 2003, A&A, 401, 405 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Steinacker, J., Baes, M., & Gordon, K. D. 2013, ARA&A, 51, 63 [NASA ADS] [CrossRef] [Google Scholar]
 Teyssier, R. 2002, A&A, 385, 337 [NASA ADS] [CrossRef] [EDP Sciences] [Google Scholar]
 Verstocken, S., Van De Putte, D., Camps, P., & Baes, M. 2017, Astron. Comput., 20, 16 [NASA ADS] [CrossRef] [Google Scholar]
 Whitney, B. A., Wood, K., Bjorkman, J. E., & Wolff, M. J. 2003, ApJ, 591, 1049 [NASA ADS] [CrossRef] [Google Scholar]
 Wolf, S. 2003, Comput. Phys. Commun., 150, 99 [NASA ADS] [CrossRef] [Google Scholar]
All Tables
Number of cells on each hierarchy level of the (10 pc)^{3} model clouds with n_{L} = 7.
All Figures
Fig. 1 Examples of 100μm surfacebrightness maps computed for 3D model clouds with a maximum refinement to n_{L} = 1–4 hierarchy levels. In calculations involving internal heating (as in these examples), point source is placed in an empty root grid cell at the centre of the model volume. 

Open with DEXTER  
In the text 
Fig. 2 Noise and run times as a function of the number of photon packages for a small spherically symmetric test model. Results are shown for simulations of a point source (panels a–c), a diffuse background (panels d–f), and the dust emission from the model volume (panels g–i). First column: rms noise of the 100 μm map as thedifference of two identical runs (solid lines) and from the comparison to a run with the same volume discretisation (same n_{L}) but the highest number of photon packages (dashed lines). Shading is used to indicate the expected n_{P}^{−1∕2} convergence as a function of the number of photon packages. Second column: rms difference to a corresponding run with the highest number of photon packages and the finest spatial discretisation (n_{L} = 5). The wallclock run times for CPU (solid lines) and GPU (dashed lines) computations are shown in the last column. In each frame, the colours correspond to different values of n_{L}, as indicated in frame c. 

Open with DEXTER  
In the text 
Fig. 3 Test with highresolution model in the case of only a point source (panel a) or only background radiation (panel b), or including both as constant radiation field components to examine the noise in the simulation of dust reemission. The rms errors as a function of the number of photon packages are shown with black symbols. The circles, squares, and triangles correspond to maps calculated toward three orthogonal directions. The shading shows the expected N^{−1∕2} convergence.The lines and righthand yaxis indicate the run times for CPU (blue) and GPU (red). Panel c: open symbols and dashed lines correspond to an alternative run with emission weighting. 

Open with DEXTER  
In the text 
Fig. 4 Error of the computed dust temperatures as a function of the grid hierarchy in a model with n_{L} = 7. From top to bottom panels: curves correspond to simulations of a point source (red curve), heating by background radiation (black curve), and simulations of dust emission when the contribution of the previous radiation sources is kept constant (blue curves). The solid and dashed lines correspond to the default and the emissionweighted simulations, respectively. The shaded regions are used to illustrate the expected 2^{level} dependence of the noise. All calculations were done with 1.8 × 10^{7} photon packages per frequency. 

Open with DEXTER  
In the text 
Fig. 5 Dependence of run times on the maximum refinement. The colours correspond to simulations of the radiation from a point source (red), external background (black), and dust reemission (blue). For dust emission, the dashed lines and open symbols correspond to a run using emission weighting. The CPU run times are plotted with circles and the GPU run times with squares. The shading indicates the trend for run times proportional to the number of cells. 

Open with DEXTER  
In the text 
Fig. 6 Convergence of dust temperature values as a function of iterations and the run time on CPU. Temperatures are from the cells on the finest level of refinement of a model with n_{L} = 4. Panel a: average temperature for basic runs (solid lines) and for ALI runs (dashed lines and open symbols). The black line is the average for all cells on the level L = 4 and the red curve is for 5% of the cells with the highest temperatures. The blue and cyan curves correspond to the average of all L = 4 cells in runs with a reduced number of photon packages n_{P}. Panel b: errors relative to a run with 40 iterations and without ALI. Panel c: rms errors for L = 4 cells calculated as the standard deviation between two independent runs. 

Open with DEXTER  
In the text 
Fig. 7 Results for the n_{L} = 4 model when using a reference field. All statistics refer to the average dust temperature of the cells on the highest L = 4 level of the grid hierarchy. Panel a: temperature error relative to the solution obtained with the same setup after 20 iterations. Panel b: rms temperature difference between two independent runs, the red curves showing these separately for 5% of the cells with the highest temperatures. Circles stand for the basic calculations (no ALI and no reference field), squares to a reference field runs, and triangles to the combination of the reference field and ALI techniques. Values are plotted against the run time and the upper xaxis shows the corresponding number of iterations in the basic run. 

Open with DEXTER  
In the text 
Fig. 8 Convergence of dust temperature values for models of different refinement. The colour scale shows the difference of the average dust temperature at the highest level of refinement (L = n_{L}) compared to the solution after 20 iterations. The number of hierarchy levels (n_{L}) is on the yaxis. Calculations are done without ALI and without a reference field. The contours are drawn at log_{10} a for a = −1.5, −1.0, −0.5, 0.0, and 0.5. 

Open with DEXTER  
In the text 
Fig. 9 Convergence of temperatures for basic runs with the n_{L} = 4 model (dashed lines) and with runtime refinement of the spatial grid from n_{L} = 1 to n_{L} = 4 (solid lines). The results are shown for the average of all L = 4 cells (black lines) and for the average of 5% of the warmest L = 4 cells (red lines). Convergence ΔT is measured as the difference from a run with 40 iterations and the same n_{P}. In the case of runtime refinement, the open symbols correspond to initial iterations with n_{L} < 4; they are drawn at ΔT = 100 K, and only indicate the run times of those steps. 

Open with DEXTER  
In the text 
Fig. 10 Convergence and rms errors of temperatures in runs where the number of photon packages n_{P} is increased by a factor of 200 over the iterations. The final iterations use 18 million photon packages per frequency. Results are shown for different combinations of ALI and reference field methods, as indicated in panel a. For reference, the red curves show the results for the constant n_{P} of 18 million photon packages per iteration. Markers are drawn for every second iteration. 

Open with DEXTER  
In the text 
Fig. B.1 Surfacebrightness maps at 100 μm for the final iteration of the nonALI runs of Fig. 6. The three rows correspond, respectively, to the default n_{P} value of 1.8 × 10^{7} and to n_{P} values smaller by a factor of 8 or 64. Left panels: 100 μm surface brightness I_{ν}(100 μm). Right panels: difference ΔI_{ν}(100 μm) between two identical runs. All maps are in units of 10^{8} Jy sr^{−1}. 

Open with DEXTER  
In the text 
Fig. B.2 As in Fig. B.1 but for the runs of Fig. 7 with a reference field. The number of photon packages is n_{P} = 1.1 × 10^{6} (upper panels) or four time smaller (lower panels). Maps are in units of 10^{8} Jy sr^{−1}. 

Open with DEXTER  
In the text 
Current usage metrics show cumulative count of Article Views (fulltext article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 4896 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.