liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Genetic Algorithm for Integrated SoftwarePipelining
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]

The purpose of the thesis was to study the feasibility of using geneticalgorithm (GA) to do the integrated software pipelining (ISP). Different from phasedcode generation, ISP is a technique which integrates instruction selection, instructionscheduling, and register allocation together when doing code generation. ISP is able toprovide a lager solution space than phased way does, which means that ISP haspotential to generate more optimized code than phased code generation. However,integrated compiling costs more than phased compiling. GA is stochastic beam searchalgorithm which can accelerate the solution searching and find an optimized result.An experiment was designed for verifying feasibility of implementing GA for ISP(GASP). The implemented algorithm analyzed data dependency graphs of loop bodies,created genes for the graphs and evolved, generated schedules, calculated andevaluated fitness, and obtained optimized codes. The fitness calculation wasimplemented by calculating the maximum value between the smallest possibleresource initiation interval and the smallest possible recurrence initiation interval. Theexperiment was conducted by generating codes from data dependency graphsprovided in FFMPEG and comparing the performance between GASP and integerlinear programming (ILP). The results showed that out of eleven cases that ILP hadgenerated code, GASP performed close to ILP in seven cases. In all twelve cases thatILP did not have result, GASP did generate optimized code. To conclude, the studyindicated that GA was feasible of being implemented for ISP. The generated codesfrom GASP performed similar with the codes from ILP. And for the dependencygraphs that ILP could not solve in a limited time, GASP could also generate optimizedresults.

Place, publisher, year, edition, pages
2012. , 34 p.
Keyword [en]
Code generation, compilers, instruction scheduling, modulo scheduling, genetic programming.
National Category
Computer Science
URN: urn:nbn:se:liu:diva-76088ISRN: LIU-IDA/LITH-EX-A--12/012-SEOAI: diva2:512192
Subject / course
Computer and information science at the Institute of Technology
2012-03-09, 16:00 (English)
Available from: 2012-04-23 Created: 2012-03-26 Last updated: 2012-04-23Bibliographically approved

Open Access in DiVA

fulltext(878 kB)192 downloads
File information
File name FULLTEXT03.pdfFile size 878 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 192 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: 101 hits
ReferencesLink to record
Permanent link

Direct link