Change search
ReferencesLink to record
Permanent link

Direct link
Automated Reasoning Support for Invasive Interactive Parallelization
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

To parallelize a sequential source code, a parallelization strategy must be defined that transforms the sequential source code into an equivalent parallel version. Since parallelizing compilers can sometimes transform sequential loops and other well-structured codes into parallel ones automatically, we are interested in finding a solution to parallelize semi-automatically codes that compilers are not able to parallelize automatically, mostly because of weakness of classical data and control dependence analysis, in order to simplify the process of transforming the codes for programmers.Invasive Interactive Parallelization (IIP) hypothesizes that by using anintelligent system that guides the user through an interactive process one can boost parallelization in the above direction. The intelligent system's guidance relies on a classical code analysis and pre-defined parallelizing transformation sequences. To support its main hypothesis, IIP suggests to encode parallelizing transformation sequences in terms of IIP parallelization strategies that dictate default ways to parallelize various code patterns by using facts which have been obtained both from classical source code analysis and directly from the user.In this project, we investigate how automated reasoning can supportthe IIP method in order to parallelize a sequential code with an acceptable performance but faster than manual parallelization. We have looked at two special problem areas: Divide and conquer algorithms and loops in the source codes. Our focus is on parallelizing four sequential legacy C programs such as: Quick sort, Merge sort, Jacobi method and Matrix multipliation and summation for both OpenMP and MPI environment by developing an interactive parallelizing assistance tool that provides users with the assistanceneeded for parallelizing a sequential source code.

Place, publisher, year, edition, pages
2012. , 165 p.
Keyword [en]
Multi-processors, Dependence Analysis, Code parallelization, Semi-automatic parallelization, IIP, ISC, OpenMP, MPI, Artificial Intelligence, Reasoning, Decision Tree, Divide and Conquer (D&C) algorithms
National Category
Other Engineering and Technologies not elsewhere specified
URN: urn:nbn:se:liu:diva-84830ISRN: LIU-IDA/LITH-EX-A--12/050--SEOAI: diva2:562292
Subject / course
Master's programme in Computer Science
2012-09-21, Donald Knuth, SE-581 83 LINKÖPING, Linköping, 13:00 (English)
Available from: 2012-11-01 Created: 2012-10-23 Last updated: 2014-10-08Bibliographically approved

Open Access in DiVA

thesis_12050(2539 kB)204 downloads
File information
File name FULLTEXT01.pdfFile size 2539 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Moshir Moghaddam, Kianosh
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Other Engineering and Technologies not elsewhere specified

Search outside of DiVA

GoogleGoogle Scholar
Total: 204 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 114 hits
ReferencesLink to record
Permanent link

Direct link