mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Investigating Memory Characteristics of Corner Detection Algorithms using Multi-core Architectures
Mälardalen University, School of Innovation, Design and Engineering.
Mälardalen University, School of Innovation, Design and Engineering.
2017 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

In this thesis, we have evaluated the memory characteristics and parallel behaviour of the SUSAN (Smallest Univalue Segment Assimilating Nucleus) and Harris corner detection algorithms. Our purpose is understanding how the memory affects the predictability of these algorithms and furthermore how we can use multi-core machines to improve the execution time of such algorithms. By investigating the execution pattern of the SUSAN and Harris corner detection algorithms, we were able of breaking down the algorithms into parallelizable parts and non-parallelizable parts. We implemented a fork-join model on the parallelizable parts of these two algorithms and we were able to achieve a 7.9--8 times speedup on the two corner detection algorithms using an 8-core P4080 machine. For the sake of a wider study, we also executed these parallel adaptations on 4 different Intel platforms which generated similar results. The parallelized algorithms are also subjects for further improvement. We therefore investigated the memory characteristics of L1 data and instruction cache misses, cycles waiting for L2 cache miss loads, and TLB store misses. In these measurements, we found a strong correlation between L1 data cache replacement and the execution time. To encounter this memory issue, we implemented loop tiling techniques which were adjusted according to the L1 cache size of our test systems. Our tests of the tiling techniques exhibit a less fluctuating memory behaviour, which however comes at the cost of an increase in the execution time.

Place, publisher, year, edition, pages
2017. , 27 p.
Keyword [en]
Corner Detection, Memory Characteristics, Harris, SUSAN
National Category
Computer Science
Identifiers
URN: urn:nbn:se:mdh:diva-35842OAI: oai:DiVA.org:mdh-35842DiVA: diva2:1111777
Subject / course
Computer Science
Presentation
2017-06-02, Lambda, Västerås, 13:44 (English)
Supervisors
Examiners
Available from: 2017-06-21 Created: 2017-06-19 Last updated: 2017-06-21Bibliographically approved

Open Access in DiVA

fulltext(1564 kB)30 downloads
File information
File name FULLTEXT01.pdfFile size 1564 kBChecksum SHA-512
ecb100a47c5a04734710fe93f0142caee533a1198583cacfaa18ac66db22a467ec777df76faaff9ac39ade00ae2766206dbd93b709f1f21b4f5c946b273218cf
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Sääf, AndréSamuelsson, Alvin
By organisation
School of Innovation, Design and Engineering
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 30 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: 148 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf