Show simple item record

dc.contributor.supervisorThulasiraman, Parimala (Computer Science) Thulasiram, Ruppa (Computer Science)en_US
dc.contributor.authorAlbalawi, Eid
dc.date.accessioned2014-02-26T21:40:37Z
dc.date.available2014-02-26T21:40:37Z
dc.date.issued2013-07en_US
dc.identifier.citationAlbalwi, E., Thulasiraman, P., & Thulasiram, R. (2013, July). Task Level Parallelization of All Pair Shortest Path Algorithm in OpenMP 3.0. In 2nd International Conference on Advances in Computer Science and Engineering (CSE 2013). Atlantis Press.en_US
dc.identifier.urihttp://hdl.handle.net/1993/23321
dc.description.abstractOpenMP is a standard parallel programming language used to develop parallel applications on shared memory machines. OpenMP is very suitable for designing parallel algorithms for regular applications where the amount of work is known apriori and therefore distribution of work among the threads can be done at compile time. In irregular applications, the load changes dynamically at runtime and distribution of work among the threads can only be done at runtime. In the literature, it has been shown that OpenMP produces unsatisfactory performance for irregular applications. In 2008, the OpenMP 3.0 version introduced new directives and features such as the ''task'' directive to handle irregular computations. Not much work has gone into studying irregular algorithms in OpenMP 3.0. In this thesis, I provide some insight into the usefulness of OpenMP 3.0en_US
dc.language.isoengen_US
dc.publisheratlantis pressen_US
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectOpenMP 3.0en_US
dc.titleTask Level Parallelization of Irregular Computations using OpenMP 3.0en_US
dc.typeinfo:eu-repo/semantics/masterThesis
dc.typemaster thesisen_US
dc.degree.disciplineComputer Scienceen_US
dc.contributor.examiningcommitteeGraham, Peter (Computer Science) Okhmatovski, Vladimir (Electrical and Computer Engr)en_US
dc.degree.levelMaster of Science (M.Sc.)en_US
dc.description.noteMay 2014en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record