Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jonny Hancox

dblp:192/7451 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2019
0009-0003-5799-5299ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 67% Processor architecture and microarchitecture · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence alignment
pairwise sequence alignment
0.312018
Generic accelerated sequence alignment in SeqAn using vectorization and multi-threading · Bioinform. 2018
Bioinformatics and computational biology
sequence alignment
0.312018
Generic accelerated sequence alignment in SeqAn using vectorization and multi-threading · Bioinform. 2018
Processor architecture and microarchitecture
multithreading
0.312018
Generic accelerated sequence alignment in SeqAn using vectorization and multi-threading · Bioinform. 2018
Parallel and multicore computing
parallel programming models
0.312018
Generic accelerated sequence alignment in SeqAn using vectorization and multi-threading · Bioinform. 2018
Parallel and multicore computing › data parallelism
SIMD vectorization
0.312018
Generic accelerated sequence alignment in SeqAn using vectorization and multi-threading · Bioinform. 2018

Methods — techniques the papers use, named apart from their topics

work stealing · 0.7dynamic programming · 0.7SIMD · 0.7
YearPublicationVenuePosition
2019 An algorithm for computing short-range forces in molecular dynamics simulations with non-uniform particle densities
abstract
We present projection sorting, an algorithmic approach to determining pairwise short-range forces between particles in molecular dynamics simulations. We show it can be more effective than the standard approaches when particle density is non-uniform. We implement tuned versions of the algorithm in the context of a biophysical simulation of chromosome condensation, for the modern Intel Broadwell and Knights Landing architectures, across multiple nodes. We demonstrate up to 5 × overall speedup and good scaling to large problem sizes and processor counts.
Timothy R. Law, Jonny Hancox, Steven A. Wright 0001, Stephen A. Jarvis
J. Parallel Distributed Comput.2
2018 Generic accelerated sequence alignment in SeqAn using vectorization and multi-threading
abstract
Motivation: Pairwise sequence alignment is undoubtedly a central tool in many bioinformatics analyses. In this paper, we present a generically accelerated module for pairwise sequence alignments applicable for a broad range of applications. In our module, we unified the standard dynamic programming kernel used for pairwise sequence alignments and extended it with a generalized inter-sequence vectorization layout, such that many alignments can be computed simultaneously by exploiting SIMD (single instruction multiple data) instructions of modern processors. We then extended the module by adding two layers of thread-level parallelization, where we (a) distribute many independent alignments on multiple threads and (b) inherently parallelize a single alignment computation using a work stealing approach producing a dynamic wavefront progressing along the minor diagonal. Results: We evaluated our alignment vectorization and parallelization on different processors, including the newest Intel® Xeon® (Skylake) and Intel® Xeon PhiTM (KNL) processors, and use cases. The instruction set AVX512-BW (Byte and Word), available on Skylake processors, can genuinely improve the performance of vectorized alignments. We could run single alignments 1600 times faster on the Xeon PhiTM and 1400 times faster on the Xeon® than executing them with our previous sequential alignment module. Availability and implementation: The module is programmed in C++ using the SeqAn (Reinert et al., 2017) library and distributed with version 2.4 under the BSD license. We support SSE4, AVX2, AVX512 instructions and included UME: SIMD, a SIMD-instruction wrapper library, to extend our module for further instruction sets. We thoroughly test all alignment components with all major C++ compilers on various platforms. Supplementary information: Supplementary data are available at Bioinformatics online.
René Rahn, Stefan Budach, Pascal Costanza, Marcel Ehrhardt, Jonny Hancox, Knut Reinert
Bioinform.5
2016 Optimisation of a Molecular Dynamics Simulation of Chromosome Condensation
abstract
We present optimisations applied to a bespoke bio-physical molecular dynamics simulation designed to investigate chromosome condensation. Our primary focus is on domain-specific algorithmic improvements to determining short-range interaction forces between particles, as certain qualities of the simulation render traditional methods less effective. We implement tuned versions of the code for both traditional CPU architectures and the modern many-core architecture found in the Intel Xeon Phi coprocessor and compare their effectiveness. We achieve speed-ups starting at a factor of 10 over the original code, facilitating more detailed and larger-scale experiments.
Timothy R. Law, Jonny Hancox, Tammy M. K. Cheng, Raphael A. G. Chaleil, Steven A. Wright 0001, Paul A. Bates, Stephen A. Jarvis
SBAC-PAD2