Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/9118
Full metadata record
DC FieldValueLanguage
dc.rights.licenseopenAccess-
dc.contributor.authorIvanović, Miloš-
dc.contributor.authorStojanović, Boban-
dc.contributor.authorSimic, Visnja-
dc.contributor.authorKaplarević-Mališić, Ana-
dc.contributor.authorRanković, Vladimir-
dc.contributor.authorFurtula, Boris-
dc.contributor.authorMijailovich S.-
dc.date.accessioned2020-09-19T17:30:25Z-
dc.date.available2020-09-19T17:30:25Z-
dc.date.issued2016-
dc.identifier.issn1820-6530-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/9118-
dc.description.abstractOne of the main activities within the Group for Scientific Computing at the Faculty of Science are methods for efficiently utilizing real parallel architectures, typically clusters of SMP nodes, shared-memory systems, and GPUs. Focus is on design, development and implementation of parallel algorithms and data structures for fundamental scientific and engineering problems. Message Passing Interface (MPI) is an important paradigm that still poses interesting design and implementation problems, especially combined with other programming models, like CUDA. In addition to standard HPC (High Performance Computing) technology stack, the Group also utilize computing stacks like Hadoop and Spark. In this paper we present a short review of the recent research of the Group, focused on large-scale applications in various research fields with references to original articles. The first part considers multi-scale muscle modeling in mixed MPI-CUDA environment. In our approach, finite element macro model is coupled with the microscopic Huxley kinetics model. The original approach in scheduling tasks within multi-scale simulation ensures good load balance, leading to speed-up of over two orders of magnitude and high scalability. The second part considers application of HPC in graph science for the task of establishing the basic structural features of the minimum-ABC index trees. In order to analyze large amounts of data (all trees of certain order) we utilize grid computing services like storage and computing in order to reduce analysis time up to three orders of magnitude. The last part presents WoBinGO framework for solving optimization problems on HPC resources. It overcomes the shortcomings of earlier static pilot-job frameworks by providing elastic resource provisioning using adaptive allocation of jobs with limited lifetime. The obtained results show that despite WoBinGO's adaptive and frugal allocation of computing resources, it provides significant speed-up when dealing with problems with computationally expensive evaluations, as found in hydro-informatics and market risk management.-
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/-
dc.sourceJournal of the Serbian Society for Computational Mechanics-
dc.titleHigh performance computing in multi-scale modeling, graph science and meta-heuristic optimization-
dc.typearticle-
dc.identifier.doi10.5937/jsscm1601050I-
dc.identifier.scopus2-s2.0-85010300579-
Appears in Collections:Faculty of Economics, Kragujevac
Faculty of Science, Kragujevac

Page views(s)

901

Downloads(s)

47

Files in This Item:
File Description SizeFormat 
10.5937-jsscm1601050I.pdfwobingo635.44 kBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons