Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/33098
DC FieldValueLanguage
dc.contributor.authorDiavastos, Andreas-
dc.contributor.authorTrancoso, Pedro-
dc.contributor.authorLuján, Mikel-
dc.contributor.authorWatson, Ian-
dc.date.accessioned2024-10-15T07:14:54Z-
dc.date.available2024-10-15T07:14:54Z-
dc.date.issued2011-
dc.identifier.citationFirst Workshop on Data-Flow Execution Models for Extreme Scale Computing, 2011en_US
dc.identifier.isbn9781467307093-
dc.identifier.urihttps://hdl.handle.net/20.500.14279/33098-
dc.description.abstractMulti-core processors have renewed interest in programming models which can efficiently exploit general purpose parallelism. Data-Flow is one such model which has demonstrated significant potential in the past. However, it is generally associated with functional styles of programming which do not deal well with shared mutable state. There have been a number of attempts to introduce state into Data-Flow models and functional languages but none have proved able to maintain the simplicity and efficiency of pure Data-Flow parallelism. Transactional memory is a concurrency control mechanism that simplifies sharing data when developing parallel applications while at the same time promises to deliver affordable performance. In this paper we report our experience of integrating Transactional Memory and Data-Flow. The ability of the Data-Flow model to expose large amounts of parallelism is maintained while Transactional Memory provides simplified sharing of mutable data in those circumstances where it is important to the expression of the program. The isolation property of transactions ensures that the exploitation of Data-Flow parallelism is not compromised. In this study we extend the TFlux platform, a Data-Driven Multi-threading implementation, to support transactions. We achieve this by proposing new pragmas that allow the programmer to specify transactions. In addition we extend the runtime functionality by integrating a software transactional memory library with TFlux. To test the proposed system, we ported two applications that require transactional memory: Random Counter and Labyrinth an implementation of Lee's parallel routing algorithm. Our results show good opportunities for scaling when using the integration of the two models. © 2011 IEEE.en_US
dc.formatpdfen_US
dc.language.isoenen_US
dc.subjectComplexity theoryen_US
dc.subjectRadiation detectorsen_US
dc.subjectRuntimeen_US
dc.subjectParallel processingen_US
dc.subjectInstruction setsen_US
dc.subjectMonitoringen_US
dc.titleIntegrating transactions into the data-driven multi-threading model using the tflux platformen_US
dc.typeConference Papersen_US
dc.collaborationUniversity of Cyprusen_US
dc.collaborationThe University of Manchesteren_US
dc.countryCyprusen_US
dc.countryUnited Kingdomen_US
dc.subject.fieldEngineering and Technologyen_US
dc.relation.conferenceFirst Workshop on Data-Flow Execution Models for Extreme Scale Computingen_US
dc.identifier.doi10.1109/DFM.2011.14en_US
dc.identifier.scopus2-s2.0-84860540557-
dc.identifier.urlhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84860540557&partnerID=MN8TOARS-
cut.common.academicyear2011-2012en_US
dc.identifier.external76560528-
item.grantfulltextnone-
item.openairetypeconferenceObject-
item.openairecristypehttp://purl.org/coar/resource_type/c_c94f-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.languageiso639-1en-
crisitem.author.deptDepartment of Electrical Engineering, Computer Engineering and Informatics-
crisitem.author.facultyFaculty of Engineering and Technology-
crisitem.author.orcid0000-0002-7139-4444-
crisitem.author.parentorgFaculty of Engineering and Technology-
Appears in Collections:Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation
CORE Recommender
Show simple item record

Page view(s)

5
checked on Oct 20, 2024

Google ScholarTM

Check

Altmetric


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