Name
Abstract | ||
|---|---|---|
De novo genome assembly is one of the most important and challenging computational problems in modern genomics; further, it shares algorithms and communication patterns important to other graph analytic and irregular applications. Unlike simulations, it has no floating point arithmetic and is dominated by small memory transactions within and between computing nodes. In this work, we focus on the highly scalable HipMer assembler and identify the dominant algorithms and communication patterns, also using microbenchmarks to capture the workload. We evaluate HipMer on a variety of platforms from the latest HPC systems to ethernet clusters. HipMer performs well on all single node systems, including the Xeon Phi manycore architecture. Given large enough problems, it also demonstrates excellent scaling across nodes in an HPC system, but requires a high speed network with low overhead and high injection rates. Our results shed light on the architectural features that are most important for achieving good parallel efficiency on this and related problems. |
Year | Venue | Field |
|---|---|---|
2017 | Euro-Par | Architecture,Computational problem,Floating point,Computer science,Workload,Xeon Phi,Parallel computing,Ethernet,Sequence assembly,Scalability,Distributed computing |
DocType | Citations | PageRank |
Conference | 2 | 0.37 |
References | Authors | |
8 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marquita Ellis | 1 | 3 | 2.76 |
| Evangelos Georganas | 2 | 82 | 8.53 |
| Rob Egan | 3 | 49 | 4.64 |
| Steven A. Hofmeyr | 4 | 2096 | 258.76 |
| Aydin Buluc | 5 | 1057 | 67.49 |
| Brandon G. Cook | 6 | 15 | 4.95 |
| leonid oliker | 7 | 1358 | 145.15 |
| Katherine A. Yelick | 8 | 3494 | 407.23 |