Applied and Interdisciplinary Mathematics Seminar

University of Michigan

Winter 2003
Friday, March 14, 3:10-4:00pm, B844 East Hall

From Random walk to Exhaustive Search with a Cray SV1ex

Dave Strenski

Cray Research


Abstract

This talk will focus on the special numerical and computational methods used in an algorithm for doing a least squares fit of genomic data. By taking advantage of special hardware features of the Cray SV1ex vector computer the algorithm evolved from a random walk for a global minimum, to a bootstrapping exhaustive search of the domain. The talk will also touch on a quick overview of the current state of high performance computing and some of the features of Cray's newest machine, the Cray X1.