uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Forecasting Lock Contention Before Adopting Another Lock Algorithm
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2015 (English)Report (Other academic)
Place, publisher, year, edition, pages
2015.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-270716OAI: oai:DiVA.org:uu-270716DiVA: diva2:890385
Available from: 2016-01-03 Created: 2016-01-03 Last updated: 2016-02-22Bibliographically approved
In thesis
1. Performance Modeling of Multi-core Systems: Caches and Locks
Open this publication in new window or tab >>Performance Modeling of Multi-core Systems: Caches and Locks
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Performance is an important aspect of computer systems since it directly affects user experience. One way to analyze and predict performance is via performance modeling. In recent years, multi-core systems have made processors more powerful while keeping power consumption relatively low. However the complicated design of these systems makes it difficult to analyze performance. This thesis presents performance modeling techniques for cache performance and synchronization cost on multi-core systems.

A cache can be designed in many ways with different configuration parameters including cache size, associativity and replacement policy. Understanding cache performance under different configurations is useful to explore the design choices. We propose a general modeling framework for estimating the cache miss ratio under different cache configurations, based on the reuse distance distribution. On multi-core systems, each core usually has a private cache. Keeping shared data in private caches coherent has an extra cost. We propose three models to estimate this cost, based on information that can be gathered when running the program on a single core.

Locks are widely used as a synchronization primitive in multi-threaded programs on multi-core systems. While they are often necessary for protecting shared data, they also introduce lock contention, which causes performance issues. We present a model to predict how much contention a lock has on multi-core systems, based on information obtainable from profiling a run on a single core. If lock contention is shown to be a performance bottleneck, one of the ways to mitigate it is to use another lock implementation. However, it is costly to investigate if adopting another lock implementation would reduce lock contention since it requires reimplementation and measurement. We present a model for forecasting lock contention with another lock implementation without replacing the current lock implementation.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2016. 55 p.
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1336
Keyword
performance modeling, performance analysis, multi-core, cache, lock
National Category
Computer Science
Identifiers
urn:nbn:se:uu:diva-271124 (URN)978-91-554-9451-3 (ISBN)
Public defence
2016-03-07, 2446, ITC, Lägerhyddsvägen 2, Uppsala, 13:15 (English)
Opponent
Supervisors
Available from: 2016-02-19 Created: 2016-01-05 Last updated: 2016-03-09Bibliographically approved

Open Access in DiVA

fulltext(421 kB)71 downloads
File information
File name FULLTEXT01.pdfFile size 421 kBChecksum SHA-512
8de9abab0b3824fe87305dbb2a290a2de0fd9adc6abb963a4d8e382cad5fe4844b41dc9c2bd7731cb7b2e59a77f96a609a141aa2517d4caf57051fc8b2c4ed2b
Type fulltextMimetype application/pdf

Authority records BETA

Pan, XiaoyueKlaftenegger, DavidJonsson, Bengt

Search in DiVA

By author/editor
Pan, XiaoyueKlaftenegger, DavidJonsson, Bengt
By organisation
Computer SystemsComputing Science
Computer Science

Search outside of DiVA

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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