Sverker Holmgren

Sverker Holmgren

Auto-generated profile, based on publicly available information

Sverker Holmgren

Uppsala University

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2006 in Mediterranean Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
SHSverker Holmgren
Sverker Holmgren
SSStefano Serra-Capizzano
Stefano Serra-Capizzano
PSPer Sundqvist
Per Sundqvist

2 December 2005 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
HBHenrik Brandén
Henrik Brandén
SHSverker Holmgren
Sverker Holmgren
PSPer Sundqvist
Per Sundqvist

28 February 2010 in Computational Biology and Chemistry
Verified
Journal Article
Closed access
KMKateryna Mishchenko
Kateryna Mishchenko
LRLars Rönnegård
Lars Rönnegård
SHSverker Holmgren
Sverker Holmgren
VMVolodymyr Mishchenko
Volodymyr Mishchenko


1 April 2002 in Parallel Algorithms and Applications
Verified
Journal Article
Closed access
MNMarkus Nordén
Markus Nordén
JRJarmo Rantakokko
Jarmo Rantakokko
DWDan Wallin
Dan Wallin
SHSverker Holmgren
Sverker Holmgren
The performance of shared-memory (OpenMP) implementa- tions of three dierent PDE solver kernels representing finite dierence methods, finite volume methods, and spectral methods has been investi- gated. The experiments have been performed on a self-optimizing NUMA system, the Sun Orange prototype, using dierent data placement and thread scheduling strategies. The results show that correct data place- ment is very important for the performance for all solvers. However, the Orange system has a unique capababilty of automatically changing the data distribution at run time through both migration and replication of data. For reasonable large PDE problems, we find that the time to do this is negligible compared to the total solve time. Also, the performance after the migration and replication process has reached steady-state is the same as what is achieved if data is optimally placed at the begin- ning of the execution using hand tuning. This shows that, for the ap- plication studied, the self-optimizing features are successful, and shared memory code without explicit data distribution directives yields good performance.

27 September 2012 in arXiv
Verified
Preprint
Open access
PDF file
CNCarl Nettelblad
Carl Nettelblad
BMBehrang Mahjani
Behrang Mahjani
SHSverker Holmgren
Sverker Holmgren
We present a new computational scheme that enables efficient and reliable Quantitative Trait Loci (QTL) scans for experimental populations. Using a standard brute-force exhaustive search effectively prohibits accurate QTL scans involving more than two loci to be performed in practice, at least if permutation testing is used to determine significance. Some more elaborate global optimization approaches, e.g. DIRECT, have earlier been adopted to QTL search problems. Dramatic speedups have been reported for high-dimensional scans. However, since a heuristic termination criterion must be used in these types of algorithms the accuracy of the optimization process cannot be guaranteed. Indeed, earlier results show that a small bias in the significance thresholds is sometimes introduced. Our new optimization scheme, PruneDIRECT, is based on an analysis leading to a computable (Lipschitz) bound on the slope of a transformed objective function. The bound is derived for both infinite size and finite size populations. Introducing a Lipschitz bound in DIRECT leads to an algorithm related to classical Lipschitz optimization. Regions in the search space can be permanently excluded (pruned) during the optimization process. Heuristic termination criteria can thus be avoided. Hence, PruneDIRECT has a well-defined error bound and can in practice be guaranteed to be equivalent to a corresponding exhaustive search. We present simulation results that show that for simultaneous mapping of three QTL using permutation testing, PruneDIRECT is typically more than 50 times faster than exhaustive search. The speedup is higher for stronger QTL. This could be used to quickly detect strong candidate eQTL networks.