Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
DRAM BASED PARAMETER DATABASE OPTIMIZATION
KTH, School of Information and Communication Technology (ICT).
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This thesis suggests an improved parameter database implementation for one of Ericsson products. The parameter database is used during the initialization of the system as well as during the later operation.

The database size is constantly growing because the parameter database is intended to be used with different hardware configurations. When a new technology platform is released, multiple revisions with additional features and functionalities are later created, resulting in introduction of new parameters or changes to their values. Ericsson provides support for old and new products.

The entire parameter database is currently stored in DRAM memory as a hash map. Therefore an optimal parameter database implementation should have low memory footprint. The search speed and initialization speed for the target system are also important to allow high system availability and low downtime, since a reboot is a common fix for many problems. As many optimizations have to consider memory size – speed tradeoff, it has been decided to give preference to reducing memory footprint.

This research seeks to:

  • Analyze data-structures suitable for parameter database implementation (Hash map, Sparsehash, Judy hash, Binary search tree, Treap, Skip List, AssocVector presorted using std::map, Burst trie).
  • Propose the best data-structure in terms of used memory area and speed.
  • If possible, further optimize it for database size in memory and access speed.
  • Create a prototype implementation.
  • Test the performance of the new implementation.

The results indicate that a more compact database implementation can be achieved using alternative data structures such as Presorted AssocVector an Sparsehash, however some search speed and build speed is lost when using these data structures instead of the original Gnu Hash Map implementation.

Place, publisher, year, edition, pages
2012. , 51 p.
Series
Trita-ICT-EX, 2012:166
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-100332OAI: oai:DiVA.org:kth-100332DiVA: diva2:543210
Educational program
Master of Science - System-on-Chip Design
Uppsok
Technology
Examiners
Available from: 2012-08-07 Created: 2012-08-07 Last updated: 2012-08-07Bibliographically approved

Open Access in DiVA

fulltext(441 kB)136 downloads
File information
File name FULLTEXT01.pdfFile size 441 kBChecksum SHA-512
e117ce9c19f8e00707a3dd19242634628b154dd7d7ab138d749a5663ef5239bbb1fb80e87a7e9ab7835a1b5743648fc6705f35db21781314f4bfed3f17373388
Type fulltextMimetype application/pdf

By organisation
School of Information and Communication Technology (ICT)
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 136 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

urn-nbn

Altmetric score

urn-nbn
Total: 86 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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