dc.creatorLöhner, Rainald
dc.creatorPerazzo, Franco
dc.date2017-11
dc.date2017
dc.date2020-05-04T12:51:07Z
dc.date.accessioned2023-07-14T19:35:55Z
dc.date.available2023-07-14T19:35:55Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/94727
dc.identifierhttps://cimec.org.ar/ojs/index.php/mc/article/view/5276
dc.identifierissn:2591-3522
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7435937
dc.descriptionA number of near-optimal techniques were implemented to reduce computing times for the Discrete Element Method (DEM) code named DESOL. Among these, the following showed the largest improvements: multilevel bins, periodic rebuild, trimming and Symmetric Multiprocessor (SMP) parallelization. These improvements have led to Central Processing Unit (CPU) reduction of the order of 1:3-1:5 on scalar machines, while also showing excellent scalability up to the point of memory saturation, which on current Intel Xeon processors occurs at approximately 8 cores for double precision and 16 cores for single precision.
dc.descriptionPublicado en: <i>Mecánica Computacional</i> vol. XXXV, no. 10.
dc.descriptionFacultad de Ingeniería
dc.formatapplication/pdf
dc.format455-466
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectIngeniería
dc.subjectDiscrete Element Method
dc.subjectSpatial Search Algorithms
dc.subjectBins
dc.subjectContact Algorithm
dc.titleImprovements in speed and scalability of a DEM code
dc.typeObjeto de conferencia
dc.typeObjeto de conferencia


Este ítem pertenece a la siguiente institución