Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/8966
DC FieldValueLanguage
dc.contributor.authorPopović, Miroslaven
dc.contributor.authorCetic N.en
dc.date.accessioned2019-09-30T09:12:30Z-
dc.date.available2019-09-30T09:12:30Z-
dc.date.issued2013-05-01en
dc.identifier.issn19366612en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/8966-
dc.description.abstractTask trees are important class of parallel programs that are found in a broad range of applications, from critical infrastructures such as electricity, oil, and gas distribution networks, to modern large-scale computer games. Erlang is a modern parallel programming language offering efficient fine-grain parallelism, based on its ultra light processes, and direct executable portability on various multicores. The goal of the work presented in this paper was to develop the novel Task Tree Executor (TTE) for Erlang enabled multicores. After introducing TTE task trees we present the novel Erlang based TTE. Then, we construct DAG model for TTE binary trees and derive formulas for parallelism and lower bound of speedup. Finally, we validate the proposed theory by experiments. © 2013 American Scientific Publishers All rights reserved.en
dc.relation.ispartofAdvanced Science Lettersen
dc.titleTask tree executor for Erlang enabled multicoresen
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.1166/asl.2013.4456en
dc.identifier.scopus2-s2.0-84876884116en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84876884116en
dc.relation.lastpage1386en
dc.relation.firstpage1382en
dc.relation.issue5en
dc.relation.volume19en
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

Page view(s)

35
Last Week
1
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.