Seminars archive
Upcoming Seminars   Seminar: Algebra Title to be announced Renee Bell, University of Pennsylvania   Seminar: Combinatorics On the ErdosGyarfas distinct distances problem with local constraints Cosmin Pohoata, The California Institute of Technology   Seminar: Algebra Title to be announced Eva Bayer Fluckinger, EPFL   Seminar: Algebra Joint AthensAtlanta Number Theory Seminar Larry Rolen and Bianca Viray, Vanderbilt and University of Washington   Seminar: Algebra Title to be announced Anne Qu\'eguinerMathieu, Paris   Seminar: Algebra Title to be announced Natalie Paquette, Caltech  Past Seminars   Seminar: Algebra and Number Theory A characterization of cusp forms by means of the growth of their Fourier coefficients Winfried Kohnen, Heidelberg University   Seminar: Scientific Computing Seminar Gossipbased distributed matrix computations Hana Strakova, University of Vienna and GA Tech Venue: Mathematics and Science Center, Room W306 Show abstract Truly distributed matrix computations with randomized communication schedules, such as gossipbased algorithms, can offer many
attractive properties. Due to their randomized communication restricted only to direct neighbors they are
very flexible with respect to the underlying hardware infrastructure. They can operate on arbitrary topologies and they can be made
resilient against dynamic changes in the network, against message loss or node failures, and against asynchrony between compute nodes. Moreover, their overall cost can be reduced by accuracycommunication
tradeoffs. Such properties are attractive especially for looselycoupled distributed systems with unreliable communication
links, such as sensor or P2P networks. However, due to the growth in the number of nodes for future extremescale HPC systems and the anticipated decrease in reliability, some properties of gossipbased distributed algorithms may become important also for future HPC systems.
We are investigating distributed algorithms for various prototypical matrix computation problems which utilize gossipbased aggregation algorithms for performing reduction operations in a distributed manner. Questions addressed relate to the (communication) cost paid for the increased flexibility and robustness, to convergence properties, to numerical accuracy achieved, as
well as to the benefits of accuracycommunication cost tradeoffs.   Seminar SIAM Student Chapter: Numerical Analysis and Scientific Computing Introduction to GPU Computing: Basics of OpenCL Veronica Mejia Bustamante, Emory University   Seminar: Combinatorics Induced and noninduced Ramsey numbers of $k$partite, $k$uniform hypergraphs Steve La Fleur, Emory University   Colloquium An information theoretic approach to Sobolev and isoperimetric inequalities Professor Deane Yang, NYUPoly   Defense: Dissertation Scalable Efficient Methods for Incompressible Fluiddynamics in Engineering Problems Umberto Villa, Emory University   Seminar: Combinatorics On Folkmantype problems Andrzej Dudek, Western Michigan University   Defense: Dissertation Iterative Methods and Partitioning Techniques for Large Sparse Problems in Network Analysis Verena Kuhlemann, Emory University   Seminar: Numerical Analysis and Scientific Computing Modern Krylov Subspace Methods (and applications to Parabolic Control Problems) Daniel B. Szyld, Temple University   Defense: Dissertation Rotationally Symmetric Planes in Comparison Geometry Eric Choi, Emory University 
