Suchergebnisse - "High-performance algorithm engineering"

High-Performance Algorithm Engineering for Computational Phylogenetics von Moret, Bernard M. E., Bader, David A., Warnow, Tandy

“… A phylogeny is the evolutionary history of a group of organisms; systematists (and other biologists) attempt to reconstruct this history from various forms of …”
Volltext

Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs von Bader, David A., Cong, Guojing

“… Minimum spanning tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and …”
Volltext

A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs) von Bader, David A., Cong, Guojing

“… The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel …”
Volltext

Designing irregular parallel algorithms with mutual exclusion and lock-free protocols von Cong, Guojing, Bader, David A.

“… Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or …”
Volltext

The Euler tour technique and parallel rooted spanning tree von Guojin Cong, Bader, D.A.

“… Many parallel algorithms for graph problems start with finding a spanning tree and rooting the tree to define some structural relationship on the vertices …”
Volltext

Toward new software for computational phylogenetics von Moret, B.M.E., Li-San Wang, Warnow, T.

“… Systematists study how a group of genes or organisms evolved. These biologists now have set their sights on the Tree of Life challenge: to reconstruct the …”
Volltext

Improving simulation performance with GPUs von Shi, Jian

“… Simulations are indispensable for engineering. They make it possible that one can perform faster and cheaper virtual experiments than physical ones on virtual …”
Volltext