DOCSLIB.ORG

UC Berkeley UC Berkeley Electronic Theses and Dissertations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
UC Berkeley UC Berkeley Electronic Theses and Dissertations UC Berkeley UC Berkeley Electronic Theses and Dissertations Title Bounds on the Energy Consumption of Computational Kernels Permalink https://escholarship.org/uc/item/4v32d7hh Author Gearhart, Andrew Scott Publication Date 2014 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California Bounds on the Energy Consumption of Computational Kernels by Andrew Scott Gearhart A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science and the Designated Emphasis in Computational Science and Engineering in the Graduate Division of the University of California, Berkeley Committee in charge: Professor James W. Demmel, Chair Professor Katherine A. Yelick Professor Tarek I. Zohdi Fall 2014 Bounds on the Energy Consumption of Computational Kernels Copyright 2014 by Andrew Scott Gearhart 1 Abstract Bounds on the Energy Consumption of Computational Kernels by Andrew Scott Gearhart Doctor of Philosophy in Computer Science and the Designated Emphasis in Computational Science and Engineering University of California, Berkeley Professor James W. Demmel, Chair As computing devices evolve with successive technology generations, many machines target either the mobile or high-performance computing/datacenter environments. In both of these form factors, energy consumption often represents the limiting factor on hardware and software effi- ciency. On mobile devices, limitations in battery technology may reduce possible hardware ca- pability due to a tight energy budget. On the other hand, large machines such as datacenters and supercomputers have budgets directly related to energy consumption and small improvements in energy efficiency can significantly reduce operating costs. Such challenges have influenced re- search upon the impact of applications, operating and runtime systems upon energy consumption. Until recently, little consideration was given to the potential energy efficiency of algorithms them- selves. A dominant idea within the high-performance computing (HPC) community is that applications can be decomposed into a set of key computational problems, called kernels. Via automatic perfor- mance tuning and new algorithms for many kernels, researchers have successfully demonstrated performance improvements on a wide variety of machines. Motivated by the large and increas- ingly growing dominant cost (in time and energy) of moving data, algorithmic improvements have been attained by proving lower bounds on the data movement required to solve a computational problem, and then developing communication-optimal algorithms that attain these bounds. This thesis extends previous research on communication bounds and computational kernels by presenting bounds on the energy consumption of a large class of algorithms. These bounds apply to sequential, distributed parallel and heterogeneous machine models and we detail methods to further extend these models to larger classes of machines. We argue that the energy consumption of computational kernels is usually predictable and can be modeled via linear models with a handful of terms. Thus, these energy models (and the accompanying bounds) may apply to many HPC applications when used in composition. 2 Given energy bounds, we analyze the implications of such results under additional constraints, such as an upper bound on runtime, and also suggest directions for future research that may aid future development of a hardware/software co-tuning process. Further, we present a new model of energy efficiency, Cityscape, that allows hardware designers to quickly target areas for improve- ment in hardware attributes. We believe that combining our bounds with other models of energy consumption may provide a useful method for such co-tuning; i.e. to enable algorithm and hard- ware architects to develop provably energy-optimal algorithms on customized hardware platforms. i Now this is not the end. It is not even the beginning of the end. But it is, perhaps, the end of the beginning. - Sir Winston Churchill, 1942 ii Contents Contents ii List of Figures v List of Tables vii 1 Introduction 1 1.1 Communication Now Dominates Performance Costs . 1 1.2 Energy Efficiency at the Algorithm Level . 2 1.3 Thesis Goals and Contributions . 2 1.4 Thesis Organization . 3 2 Energy Consumption and Computing 5 2.1 Power vs. Energy . 6 2.2 Phase-based Execution of Applications . 7 2.3 Key Consumers of Energy on Desktops and Server Nodes . 9 Energy Consumption in CMOS Logic . 10 Other Hardware Components . 14 2.4 Network Energy Consumption on Distributed Parallel Machines . 15 3 Machine Models for Runtime and Energy 17 3.1 Problems, Algorithms, and Implementations . 17 3.2 Machine Models . 18 Sequential Machine Model (S) . 19 Distributed Parallel Machine Model 1 (DP1) . 21 Model Compositions and Distributed Parallel Model 2 (DP2) . 21 Heterogeneous Machine Model (H) . 23 3.3 Problems of Particular Focus . 25 Matrix-vector multiplication . 26 Matrix-matrix Multiplication . 29 O(n2) n-body problem . 35 3.4 Model Validation . 37 iii Performance Counter Measurement . 37 Measuring Power and Energy . 40 Sequential Model (S) . 40 Fitting the Model via Least Squares . 42 Distributed Parallel Models . 53 Heterogeneous Model . 53 3.5 Parameter Estimation for Machines and Implementations and Related Work . 58 4 Bounds on Communication, Runtime and Energy for Specific Algorithms 61 4.1 Communication Lower Bounds for Sequential and Distributed Parallel Machines . 61 Lower Bounds on the DP Models that Include Link Contention . 64 4.2 Energy Lower Bounds for Specific Algorithms . 69 O(n3) Classical Matrix Multiplication . 69 Strassen and Strassen-like Matrix Multiplication . 72 Matrix-vector multiplication . 74 O(n2) n-body problem . 75 4.3 Bounds on Heterogeneous Machines . 78 Input/Output Dominated Lower Bounds . 80 Loomis-Whitney Dominated Lower Bound . 82 4.4 Optimal Heterogeneous Algorithms . 84 Heterogeneous Matrix-Vector Multiplication . 84 Heterogeneous O(n3) Matrix-Matrix Multiplication . 86 5 Bounds on Communication, Runtime and Energy for Programs that Access Arrays 90 5.1 Bounds on Programs that Reference Arrays . 90 Sequential Model . 95 Distributed Parallel Model 1 . 95 Distributed Parallel Model 2 . 96 Heterogeneous Model . 97 Example: Energy Lower Bound for Matrix-matrix Multiplication . 98 5.2 Perfect Strong Scaling in the Distributed Machine Model . 99 6 Applications of Bounds on Specific Machine Models 105 6.1 Overview . 105 6.2 Example Machines for Analysis . 108 6.3 Classical O(n3) Matrix-matrix Multiplication . 111 6.4 O(n2) n-body problem . 117 6.5 Programs that access arrays with subsets of the iteration variables . 122 7 Implications for Hardware Designs 130 7.1 Introduction . 130 7.2 Cityscape Model of Energy Efficiency . 132 iv 7.3 Financial cost/Job (Cjob) ...............................136 7.4 Further Directions . 141 8 Conclusions 147 Bibliography 150 v List of Figures 2.1 Tradeoff between minimizing energy or power . 6 2.2 Typical Scientific Code Power Trace . 8 2.3 Power phases of matmul benchmark on Sandy Bridge-EP . 8 2.4 Power phases of heterogeneous matmul on Sandy Bridge-EP and Nvidia K20 . 9 2.5 CMOS inverter with n-type (nMOS) and p-type (pMOS) transistors indicated . 11 2.6 Input/Output wattage curves for a Dell DH350E-S0 power supply for 2U servers [1] . 15 3.1 Relationship between hardware, algorithm and implementation . 18 3.2 Serial (S) and Distributed Parallel (DP) machine models . 19 3.3 Composition of Sequential (S) and Distributed Parallel (DP) Machine Models . 22 3.4 Heterogeneous machine model . 24 3.5 Compressed Sparse Row (CSR) storage format . 28 3.6 Two-dimensional block cyclic distribution of a matrix on a 2-by-2 processor grid . 31 3.7 Processor grids for 3D and 2.5D matrix-matrix multiplication [126] . 32 3.8 Breadth-First or Depth-First traversals of recursion tree [98] . 35 3.9 Data layouts for 1D, 1.5D and 2D n-body algorithms . 36 3.10 O(n2) n-body algorithm with and without a cutoff distance . 37 3.11 Counting cache misses during array copy on Sandy Bridge-EP . 39 3.12 Inaccurate floating point operation counts on Sandy Bridge-EP . 39 3.13 Typical wall power sample windows for several sparse matrix-vector multiplication problems . 41 3.14 Sandy Bridge-EP: Flop/Word ratios for double-precision sparse matrix-vector multi- plication (DSPMV) . 45 3.15 Sandy Bridge-EP: Modeled (no row scaling) double-precision matrix-matrix multipli- cation (DGEMM) . 49 3.16 Sandy Bridge-EP: Modeled (no row scaling) double-precision dense matrix-vector multiplication (DGEMV) . 50 3.17 Sandy Bridge-EP: Modeled (no row scaling) double-precision sparse matrix-vector multiplication (DSPMV) . 51 3.18 Heterogeneous machine for validation . 53 3.19 Runtime impact of scaling either Host or GPU SGEMM size . 54 3.20 Runtime impact of scaling either Host or GPU SGEMV size . 56 vi 4.1 Communication bounds for Strassen’s algorithm on d-dimensional tori. The lower plot is log-log, while the upper is linear on the y-axis. Horizontal lines in the lower plot correspond to perfect strong scaling. 67 4.2 Example of heterogeneous matrix-vector data partitioning with 4 processors . 85 4.3 Heterogeneous matrix-matrix computation example execution on 4 processors . 89 5.1 Relationship between the per-processor and contention communication lower bounds, with labels on each region indicating lower bound dominance. F and M are constants. 93 6.1 Energy costs as node count and memory are scaled . 106 6.2 Effect of constraints on energy efficiency . 107 6.3 2.5D O(n3) Matrix-matrix Multiplication: Effect of replicating memory on energy efficiency . 117 6.4 CA O(n2) n-body: Effect of replicating memory on energy efficiency . 123 6.5 3-Body Problem: Effect of replicating memory on energy efficiency . 129 7.1 Example Cityscape Model for O(n3) Matrix-matrix multiplication . 135 7.2 Cjob with various parameter sets for Algorithm 11 . 142 7.3 Sequential Machine with 3 levels of fast memory . 143 vii List of Tables 3.1 Computational motifs as described in [9] .
Load more

Recommended publications
  • Arxiv:1510.00844V3 [Cs.DC] 16 Nov 2016 Splitting (As Opposed to Replicating) Input Submatrices Across Processor Layers
    EXPLOITING MULTIPLE LEVELS OF PARALLELISM IN SPARSE MATRIX-MATRIX MULTIPLICATION ARIFUL AZAD∗, GREY BALLARDy , AYDIN BULUC¸ z , JAMES DEMMELx , LAURA GRIGORI{, ODED SCHWARTZk, SIVAN TOLEDO∗∗, AND SAMUEL WILLIAMSyy Abstract. Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algorithms have been proposed and theoretically analyzed in the flat MPI model on Erd}os-R´enyi matrices, those algorithms had not been implemented in practice and their complexities had not been analyzed for the general case. In this work, we present the first implementation of the 3D SpGEMM formulation that exploits multiple (intra-node and inter-node) levels of parallelism, achieving significant speedups over the state-of-the-art publicly available codes at all levels of concurrencies. We extensively evaluate our implementation and identify bottlenecks that should be subject to further research. Key words. Parallel computing, numerical linear algebra, sparse matrix-matrix multiplication, 2.5D algorithms, 3D algorithms, multithreading, SpGEMM, 2D decomposition, graph algorithms. AMS subject classifications. 05C50, 05C85, 65F50, 68W10 1. Introduction. Multiplication of two sparse matrices (SpGEMM) is a key operation for high-performance graph computations in the language of linear alge- bra [31, 40]. Examples include graph contraction [25], betweenness centrality [13], Markov clustering [47], peer pressure clustering [43], triangle counting [4], and cycle detection [49]. SpGEMM is also used in scientific computing. For instance, it is often a performance bottleneck for Algebraic Multigrid (AMG), where it is used in the set- up phase for restricting and interpolating matrices [7].
    [Show full text]
  • Plenary Speakers
    FoCM95 Park City: Plenary speakers: WEEK 1 Marie-Francoise Roy, Universite de Rennes Shmuel Winograd, IBM Dima Y. Grigoriev, Pennsylvania State University Richard S. Varga, Kent State University Steve Smale, University of California, Berkeley John CannyUniversity of California, Berkeley Felipe Cucker, Universitat Pampeu Fabra, Spain Victor Pan, Herbert H. Lehman College, CUNY Michael Shub, IBM Roger Brockett, Harvard University WEEK 2 Henryk Wozniakowski, University of Warsaw David Donoho, University of California, Berkeley and Columbia University Yosef Yomdin, Weizmann Institute of Science, Israel Margaret H. Wright, AT&T Bell Laboratories N. Karmarker, AT&T Bell Laboratories Manuel Blum, University of California, Berkeley Roger Temam, Indiana University Arkadi Nemirovski, Israel Institute of Technology Hubertus Th.Jongen, Reinisch-Westf Tech Hochschule James M. Renegar, Cornell University WEEK 3 Herb Keller, California Institute of Technology Gene H. Golub, Stanford University Alexandre J. Chorin, University of California, Berkeley T. Y. Li, Michigan State University James Yorke, University of Maryland Lenore Blum, MSRI Eugene L. Allgower, Colorado State University Arieh Iserles, University of Cambridge, UK James W. Demmel, University of California, Berkeley W. Dahmen, Reinisch-Westf Tech Hochschule WEEK 4 Ronald A. DeVore, University of South Carolina, Columbia Ulrich Kulisch, University of Karlsruhe Victor A. V. Vassiliev, Institute for System Studies, Moscow Jacques Louis Lions, College de France Henryk Wozniakowski, University of
    [Show full text]
  • Grey Ballard [email protected] PO Box 7311 • Computer Science Department • Wake Forest University • Winston Salem, NC 27106
    Grey Ballard [email protected] www.wfu.edu/~ballard PO Box 7311 • Computer Science Department • Wake Forest University • Winston Salem, NC 27106 Professional Assistant Professor 2016 { present Wake Forest University Department of Computer Science, Winston Salem NC Harry S. Truman Postdoctoral Fellow 2013 { 2016 Sandia National Laboratories, Livermore CA Education Ph.D. in Computer Science Fall 2008 { Spring 2013 University of California Berkeley, with a Designated Emphasis in Computational Science and Engineering Advisor: James Demmel, Thesis: Avoiding Communication in Dense Linear Algebra M.A. in Mathematics Fall 2006 { Spring 2008 Wake Forest University, Advisor: John Baxley B.S. in Mathematics and Computer Science Fall 2002 { Spring 2006 Wake Forest University, summa cum laude with honors in mathematics and honors in computer science Honors and Awards WFU Award for Excellence in Research 2021 Awarded to early-career faculty member for significant research, creative activity, or scholarly activity NSF CAREER Award 2020-2024 National Science Foundation Faculty Early Career Development Program Dunn-Riley Faculty Fellowship 2020-2022 Wake Forest Faculty Fellowship Program ACM Senior Member 2021 Recognizes those ACM members with at least 10 years of professional experience who have demonstrated performance through technical leadership, and technical or professional contributions ICDM Best Paper Award 2015 Awarded by the program committee, with coauthors Tamara Kolda, Ali Pinar, and C. Seshadri ACM Doctoral Dissertation Award - Honorable Mention
    [Show full text]
  • David Samuel Bindel Research Interests Education Professional
    David Samuel Bindel Associate Professor of Computer Science http://www.cs.cornell.edu/~bindel/cv/cv.pdf Department of Computer Science [email protected] Cornell University www.cs.cornell.edu/~bindel Ithaca, NY 14853 Office: 607-255-5395 Research interests • Applied numerical linear algebra • Scientific computing • High-performance computing • Spectral network analysis methods • Optimization via surrogate models • Finite element analysis • Computational tools for electrical power grids • Simulation tools for micro-electro-mechanical systems (MEMS) Education May 1999 B.S. in Mathematics and in Computer Science, University of Maryland, College Park December 2006 Ph.D. in Computer Science, University of California, Berkeley Advisors: James Demmel (Computer Science Division and Department of Mathematics) Sanjay Govindjee (Department of Civil Engineering) Dissertation title: Structured and Parameter-Dependent Eigensolvers for Simulation-Based Design of Resonant MEMS Professional Experience Summer 2017-present. Associate Professor, Department of Computer Science, Cornell University Spring 2019. Visiting Scholar, Department of Statistics, University of Chicago Fall 2018. Faculty Research Participant, Argonne National Laboratory Summer 2009-Summer 2017. Assistant Professor, Department of Computer Science, Cornell University Fall 2006-Summer 2009. Courant Instructor of Mathematics, New York University Fall 1999-Summer 2006. Graduate Student Researcher, CS Division, UC Berkeley Fall 2005 and Spring 2001. Graduate Student Instructor, CS Division, UC Berkeley 1 Awards 2020 James and Mary Tien Excellence in Teaching Award Highest award for teaching in Cornell's College of Engineering. 2019 KDD Best Research Paper Award 2018 Cornell COE Research Excellence Award Awarded annually to two Cornell engineering professors at each level. 2018 ASPLOS Most Influential Paper Award 2018 Recognizes a historical ASPLOS paper that has had major influence on the field.
    [Show full text]
  • Nil Ib N O Ir Ali Mi S Na El Oo B Ilp Itl
    ecneicS retupmoC retupmoC ecneicS ecneicS - o t- o l t aA l aA DD DD 9 9 / / OOnn BBiilliinneeaarr TTeecchhnniiqquueess ffoorr 0202 0202 a p pa p r p a r K a K ii t t t aM t aM SSiimmiillaarriittyy SSeeaarrcchh aanndd BBoooolleeaann MMaattrriixx M ultiplication Multiplication MMaatttit iK Kaarprpppaa noi taci lpi t luM xi r taM naelooB dna hcraeS yt i ral imiS rof seuqinhceT raeni l iB nO noi taci lpi t luM xi r taM naelooB dna hcraeS yt i ral imiS rof seuqinhceT raeni l iB nO BBUUSSININESESS + + ECECOONNOOMMY Y NSI I NBS NBS 879 - 879 - 259 - 259 - 06 - 06 - 5198 - 5198 7 - 7 ( p ( r p i n r t i n t de ) de ) AARRT T+ + NSI I NBS NBS 879 - 879 - 259 - 259 - 06 - 06 - 6198 - 6198 4 - 4 ( ( dp f dp ) f ) DDESESIGIGNN + + NSI I NSS NSS 9971 - 9971 - 4394 4394 ( p ( r p i n r t i n t de ) de ) AARRCCHHITIETCECTUTURRE E NSI I NSS NSS 9971 - 9971 - 2494 2494 ( ( dp f dp ) f ) SSCCIEINENCCE E+ + TETCECHHNNOOLOLOGGY Y tirvn tlaA ot laA ot isrevinU yt isrevinU yt CCRROOSSSOOVEVRE R ceic fo o oohcS f l cS o oohcS i f l cS i ecne ecne DDOOCCTOTORRAAL L ecneicS retupmoC retupmoC ecneicS ecneicS DDISISSERERTATTAITOIONNS S DDOOCCTOTORRAAL L +hfbjia*GMFTSH9 +hfbjia*GMFTSH9 fi.otlaa.www . www a . a a l a t o l t . o fi . fi DDISISSERERTATTAITOIONNS S ot laA ytot laA isrevinU yt isrevinU 0202 0202 Aalto University publication series DOCTORAL DISSERTATIONS 9/2020 On Bilinear Techniques for Similarity Search and Boolean Matrix Multiplication Matti Karppa A doctoral dissertation completed for the degree of Doctor of Science (Technology) to be defended, with the permission of the Aalto University School of Science, at a public examination held at the lecture hall T2 of the school on 24 January 2020 at 12.
    [Show full text]
  • Prospectus for the Next LAPACK and Scalapack Libraries: Basic Algebra Libraries for Sustainable Technology with Interdisciplinary Collaboration (BALLISTIC)∗
    Prospectus for the Next LAPACK and ScaLAPACK Libraries: Basic ALgebra LIbraries for Sustainable Technology with Interdisciplinary Collaboration (BALLISTIC)∗ James Demmel University of California at Berkeley Jack Dongarra University of Tennessee, Oak Ridge National Laboratory, and University of Manchester Julie Langou Julien Langou Piotr Luszczek University of Tennessee University of Colorado Denver University of Tennessee Michael W. Mahoney ICSI and University of California at Berkeley July 13, 2020 Abstract: The convergence of several unprecedented changes, including formidable new system design constraints and revolutionary levels of heterogeneity, has made it clear that much of the essential software infrastructure of computational science and engineering is, or will soon be, obsolete. Math libraries have historically been in the vanguard of software that must be adapted first to such changes, both because these low-level workhorses are so critical to the accuracy and performance of so many different types of applica- tions, and because they have proved to be outstanding vehicles for finding and implementing solutions to the problems that novel architectures pose. Under the Basic ALgebra LIbraries for Sustainable Technology with Interdisciplinary Collaboration (BALLISTIC) project, the principal designers of the Linear Algebra PACK- age (LAPACK) and the Scalable Linear Algebra PACKage (ScaLAPACK), the combination of which is abbreviated Sca/LAPACK, aim to enhance and update these libraries for the ongoing revolution in processor architecture,
    [Show full text]
  • Download and Use Untrusted Code Without Fear
    2 KELEY COMPUTER SCIENC CONTENTS INTRODUCTION1 CITRIS AND2 MOTES 30 YEARS OF INNOVATION GENE MYERS4 Q&A 1973–20 0 3 6GRAPHICS INTELLIGENT SYSTEMS 1RESEARCH0 DEPARTMENT STATISTICS14 ROC-SOLID SYSTEMS16 USER INTERFACE DESIGN AND DEVELOPMENT20 INTERDISCIPLINARY THEOR22Y 30PROOF-CARRYING CODE 28 COMPLEXITY 30THEORY FACULTY32 THE COMPUTER SCIENCE DIVISION OF THE DEPARTMENT OF EECS AT UC BERKELEY WAS CREATED IN 1973. THIRTY YEARS OF INNOVATION IS A CELEBRATION OF THE ACHIEVEMENTS OF THE FACULTY, STAFF, STUDENTS AND ALUMNI DURING A PERIOD OF TRULY BREATHTAKING ADVANCES IN COMPUTER SCIENCE AND ENGINEERING. THE FIRST CHAIR OF COMPUTER research in theoretical computer science received a Turing Award in 1989 for this work. learning is bringing us ever closer to the dream SCIENCE AT BERKELEY was Richard Karp, at Berkeley. In the area of programming languages and of truly intelligent machines. who had just shown that the hardness of well- software engineering, Berkeley research has The impact of Berkeley research on the practi- Berkeley’s was the one of the first top comput- known algorithmic problems, such as finding been noted for its flair for combining theory cal end of computer science has been no less er science programs to invest seriously in com- the minimum cost tour for a travelling sales- and practice, as exemplified in these pages significant. The development of Reduced puter graphics, and our illustrious alumni in person, could be related to NP-completeness— by George Necula’s research on proof- Instruction Set computers by David Patterson that area have done us proud. We were not so a concept proposed earlier by former Berkeley carrying code.
    [Show full text]
  • Contents U U U
    Contents u u u ACM Awards Reception and Banquet, June 2018 .................................................. 2 Introduction ......................................................................................................................... 3 A.M. Turing Award .............................................................................................................. 4 ACM Prize in Computing ................................................................................................. 5 ACM Charles P. “Chuck” Thacker Breakthrough in Computing Award ............. 6 ACM – AAAI Allen Newell Award .................................................................................. 7 Software System Award ................................................................................................... 8 Grace Murray Hopper Award ......................................................................................... 9 Paris Kanellakis Theory and Practice Award ...........................................................10 Karl V. Karlstrom Outstanding Educator Award .....................................................11 Eugene L. Lawler Award for Humanitarian Contributions within Computer Science and Informatics ..........................................................12 Distinguished Service Award .......................................................................................13 ACM Athena Lecturer Award ........................................................................................14 Outstanding Contribution
    [Show full text]
  • Novel Frameworks for Mining Heterogeneous and Dynamic
    Novel Frameworks for Mining Heterogeneous and Dynamic Networks A dissertation submitted to the Graduate School of the University of Cincinnati in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Electrical and Computer Engineering and Computer Science of the College of Engineering by Chunsheng Fang B.E., Electrical Engineering & Information Science, June 2006 University of Science & Technology of China, Hefei, P.R.China Advisor and Committee Chair: Prof. Anca L. Ralescu November 3, 2011 Abstract Graphs serve as an important tool for discrete data representation. Recently, graph representations have made possible very powerful machine learning algorithms, such as manifold learning, kernel methods, semi-supervised learning. With the advent of large-scale real world networks, such as biological networks (disease network, drug target network, etc.), social networks (DBLP Co- authorship network, Facebook friendship, etc.), machine learning and data mining algorithms have found new application areas and have contributed to advance our understanding of proper- ties, and phenomena governing real world networks. When dealing with real world data represented as networks, two problems arise quite naturally: I) How to integrate and align the knowledge encoded in multiple and heterogeneous networks? For instance, how to find out the similar genes in co-disease and protein-protein inter- action networks? II) How to model and predict the evolution of a dynamic network? A real world exam- ple is, given N years snapshots of an evolving social network, how to build a model that can cap- ture the temporal evolution and make reliable prediction? In this dissertation, we present an innovative graph embedding framework, which identifies the key components of modeling the evolution in time of a dynamic graph.
    [Show full text]
  • 2006-07 Report from the Mathematical Sciences Research Institute April 2008
    Mathematical Sciences Research Institute Annual Report for 2006-2007 I. Overview of Activities……………………………………………………........ 3 New Developments………………………………………………….. 3 Scientific Program and Workshops………………………………….. 5 Program Highlights………………………………………………….. 11 MSRI Experiences…………………………………………………… 15 II. Programs……………………………………………………………………….. 24 Program Participant List……………………………………………. 25 Participant Summary………………………………………………… 29 Publication List……………………………………………………… 30 III. Postdoctoral Placement……………………………………………………....... 35 IV. Summer Graduate Workshops………………………………………………… 36 Graduate Student Summary…………………………………………. 39 V. Undergraduate Program………………………………………………………… 40 Undergraduate Student Summary……………………………………. 41 VI. External Financial Support…………………………………………………….. 42 VII. Committee Membership……………………………………………………….. 47 VIII. Appendix - Final Reports…………………………………………………......... 49 Programs………………………………………………………………. 49 Geometric Evolution Equations and Related Topics…………... 49 Computational Applications of Algebraic Topology…………... 63 Dynamical Systems…………………………………………….. 70 Workshops……………………………………………………………… 80 Connections for Women: Computational Applications of Algebraic Topology…………………………………………….. 80 MSRI Short Course: An Introduction to Multiscale Methods….. 88 Connections for Women: Geometric Analysis and Nonlinear Partial Differential Equations…………………………... 90 Recent Developments in Numerical Methods and Algorithms for Geometric Evolution Equations….………………… 91 Lectures on String(y) Topology………………………………... 94 Introductory Workshop:
    [Show full text]
  • Final Program
    Final Program The SIAM Conference on Control and Its Applications is sponsored by the SIAM Activity Group on Control and Systems Theory (SIAG/CST) The SIAM Activity Group on Control and Systems Theory fosters collaboration and interaction among mathematicians, engineers, and other scientists in those areas of research related to the theory of systems and their control. It seeks to promote the development of theory and methods related to modeling, control, estimation, and approximation of complex biological, physical, and engineering systems. The SIAG organizes a biennial conference, sponsors minisymposia at SIAM meetings and periodic conferences, and maintains a member directory and an electronic discussion group. Every two years, the activity group also awards the SIAG/Control and Systems Theory Prize to a young researcher for outstanding research contributions to mathematical control or systems theory and the SIAG/CST Best SICON Paper Prize to the author(s) of the two most outstanding papers published in the SIAM Journal on Control and Optimization (SICON). Society for Industrial and Applied Mathematics 3600 Market Street, 6th Floor Philadelphia, PA 19104-2688 USA Telephone: +1-215-382-9800 Fax: +1-215- 386-7999 SIAM 2013 Mobile App Conference E-mail: [email protected] Scan the QR code to the right with any QR reader and download the TripBuilder ® EventMobile app Conference Web: www.siam.org/meetings/ to your iPHONE, iPAD, iTOUCH, ANDROID or Membership and Customer Service: (800) 447-7426 (US & BLACKBERRY mobile device. You can also visit Canada) or +1-215-382-9800 (worldwide) www.tripbuilder.net/mobileweb/apps/siam2013 2 2013 SIAM Annual Meeting • SIAM Conference on Control & Its Applications General Information Table of Contents William M.
    [Show full text]
  • Association for Computing Machinery 2 Penn Plaza, Suite 701, New York
    ACM A N W N A N R N D N S Association for Computing Machinery 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA +1-212-869-7440 www.acm.org Contents N N N ACM Awards Reception and Banquet, June 2017 . .2 Introduction . .3 A.M. Turing Award . .4 ACM Prize in Computing . .5 ACM – AAAI Allen Newell Award . .6 Software System Award . .7 Grace Murray Hopper Award . .8 Paris Kanellakis Theory and Practice Award . .9 Karl V. Karlstrom Outstanding Educator Award . .10 ACM Policy Award . .11 Distinguished Service Award . .12 ACM Athena Lecturer Award . .13 Outstanding Contribution to ACM Award . .14 ACM Presidential Award . .15-17 Doctoral Dissertation Award . .18 ACM Student Research Competition . .19 ACM Fellows . .20 Eugene L. Lawler Award for Humanitarian Contributions within Computer Science and Informatics . .21 ACM Gordon Bell Prize . .21 ACM – IEEE CS Eckert-Mauchly Award . .22 ACM – IEEE CS Ken Kennedy Award . .22 ACM – IEEE CS George Michael HPC Memorial Fellowships . .23 SIAM – ACM Prize in Computational Science and Engineering . .23 ACM – CSTA Cutler-Bell Prize . .24 ACM India Doctoral Dissertation Award . .24 ACM China Doctoral Dissertation Award . .25 ACM China Rising Star Award . .25 IPSJ/ACM Award for Early Career Contributions to Global Research . .25 ACM Special Interest Group Awards . .26-27 2017 ACM Award Subcommittee Chairs . .28 ACM Award Nomination Submission Procedures . .29 2018 ACM Award Subcommittee Chairs and Members . .30-31 Past Recipients . .32-36 ACM Fellows . .37-43 In Memoriam, ACM Fellows . .44 1 ACM Awards Reception & Banquet ACM AWARDS N N N N N N The Westin St.
    [Show full text]