Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/11573
DC FieldValueLanguage
dc.contributor.authorVranic N.en
dc.contributor.authorMarinković, Vladimiren
dc.contributor.authorDjukic M.en
dc.contributor.authorPopovic M.en
dc.date.accessioned2020-03-03T14:44:57Z-
dc.date.available2020-03-03T14:44:57Z-
dc.date.issued2011-11-02en
dc.identifier.isbn9780769544182en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/11573-
dc.description.abstractMassive parallel computing (MPC) originally appeared in the arena of multi-core processors and graphic processing units with parallel computing architecture. Nevertheless, most embedded software is still written in C, therefore C code parallelization is being subject of many ongoing R&D efforts. The most prominent approaches to parallelization of C code include Intel Cilk Plus, OpenCL, vfAnalyst, etc. The objective of this paper is to contribute to the automatic parallelization of existing sequential C code, without any source code modifications/annotations, by proposing two appropriate algorithms for parallelization, Block algorithm, and Operation based algorithm. © 2011 IEEE.en
dc.relation.ispartofProceedings - 2011 2nd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2011en
dc.titleAn approach to parallelization of sequential C codeen
dc.typeConference Paperen
dc.identifier.doi10.1109/ECBS-EERC.2011.30en
dc.identifier.scopus2-s2.0-80055054541en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/80055054541en
dc.relation.lastpage146en
dc.relation.firstpage143en
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.deptDepartman za računarstvo i automatiku-
crisitem.author.parentorgFakultet tehničkih nauka-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

4
checked on Sep 14, 2022

Page view(s)

37
Last Week
11
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.