DOCSLIB.ORG

[Tape 2, Side A]

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
[Tape 2, Side A] An interview with Charles L. Lawson Conducted by Thomas Haigh On 6 and 7 November, 2004 San Clemente, California Interview conducted by the Society for Industrial and Applied Mathematics, as part of grant # DE-FG02-01ER25547 awarded by the US Department of Energy. Transcript and original tapes donated to the Computer History Museum by the Society for Industrial and Applied Mathematics © Computer History Museum Mountain View, California ABSTRACT Charles L. Lawson discusses his professional life and career with the Jet Propulsion Laboratory, with particular reference to his contributions to the field of mathematical software. Born in 1931, he trained as an optometrist at the University of California, Berkeley. However, after army service Lawson shifted his interests to mathematics, obtaining a M.Sc. (under Peter Henrici) and a Ph.D. (under Theodore Motzkin) from the University of California at Los Angeles. During his studies he worked at the Institute for Numerical Analysis at UCLA using the SWAC and then, following a summer internship, at NASA’s Jet Propulsion Laboratory (JPL). From 1960 to 1996, Lawson served as an applied mathematician at JPL, specializing in the production of mathematical software and often working as an internal consultant to assist engineers and scientists with the computational problems. Lawson discusses the work of his Applied Mathematics group in some detail, including the contributions of his colleagues Paul R. Peabody, Richard J. Hanson and Fred T. Krogh. He discusses in some detail the challenges involved in producing ephemeredes needed for spacecraft missions and the state of celestial mechanics during the 1960s. He also recounts the development of computing at JPL, including the organization of computing facilities, the main machines in use, and the challenges posed by the arrival of minicomputers and workstations. Lawson was responsible for mathematical library development within JPL, including the lab’s MATH77 Fortran library. Lawson, Hanson, Krogh, D.R. Kincaid and Jack Dongarra were responsible for the conception, design and implementation of the Basic Linear Algebra Subprograms (BLAS) which created a standard, machine- independent application interface to vector routines optimized for specific computer architectures. The BLAS made linear algebra software more efficient, portable and structured. BLAS development was conducted in conjunction with the LINPACK project undertaken by Argonne National Laboratory, and the two projects proved symbiotic. Outside JPL, Lawson was a well known member of the mathematical software community and discusses the general development of this field as well as his personal contributions. Individuals discussed include Cleve Moler, Brian Ford and Gene Golub. In 1968 Lawson became one of seven authors of the book Computer Approximations, one of the standard works on this topic throughout the 1970s. Lawson took part in the early Mathematical Software conferences organized by John Rice during the 1970s and was a charter member of the IFIP 2.5 Working Group on Mathematical Software. Lawson edited the ACM SIGNUM Newsletter from 1972 to 1976, and had previously edited the Scientific Applications Department of the Communications of the ACM. In collaboration with Hanson, Lawson wrote the book Solving Least Squares Problems, which appeared in 1974. Lawson, p. 3 HAIGH: Dr. Lawson has been kind enough to write some quite extensive notes on his life and career and involvement in the field of numerical analysis software in general. In this interview, I’ll frequently be referring to this. We will also try and avoid duplicating precisely the material that has already been documented there. The memoir should be included with the transcript itself. To begin with, I’d to like to ask you to say a little about your family background and early education. LAWSON: As I wrote up here, I was born in the small town of Weiser, Idaho, which is on the Snake River where Idaho and Oregon share a boundary. Population there is about 5,000. It’s been about the same from 1900 to the present. My mother was also born in that small town, and she was an optometrist. My father grew up on a farm in Wilder, Idaho, which is about 60 miles south of Weiser and went to the University of Idaho and then came to Weiser to teach in the high school -- mathematics and business subjects. I went through the schools through my junior year of high school in Weiser, and then for my last year of high school I lived with my aunt in Hollywood, California. I completed my senior year of high school there. I attended the University of California at Berkeley. HAIGH: I’ll cut you off there and ask some follow-ups on that earlier part of your life. Growing up in a small, relatively remote community, do you think there’s anything from that upbringing and experience that has affected the choices that you made later in your career? LAWSON: I guess it’s hard to say. Certainly, in a small community like that, people know each other and care for each other, so there’s a certain feeling of looking out for other people when growing up in a small community like that. Beyond that, I don’t know what I can say. HAIGH: You mentioned that your father taught mathematics as well as business. Do you think that exposed you to mathematical ideas early in your life? LAWSON: I think if there was any influence there, it’s probably more hereditary than practice. Actually, my parents were separated when I was in about the sixth grade, so I didn’t have very much contact with my father beyond that time until I reestablished contact with him when I was an adult. So I probably couldn’t attribute too much math practice, but maybe something in the genes. HAIGH: Did your interests in school as you were growing up focus on mathematics or science? LAWSON: I guess I wouldn’t say science particularly, but I always found mathematics easy and interesting in high school. In the first year of college, I was really impressed with calculus. That seemed like such a wonderful set of ideas and techniques. I did wonder if there was a possibility of a career in mathematics. Looking back on it, I guess I would have to say that I didn’t inquire widely enough to find out what might be possible. Actually, one person I talked to who had been my high school science teacher said, “No, there isn’t anything you can do in mathematics. It’s all been done. It’s all in tables.” So I really did not pursue mathematics. Well, I did take a sophomore year of mathematics, which was not required in the optometry curriculum, just because I was interested in it. But I didn’t pursue it beyond that at that time. Of course, there Lawson, p. 4 wasn’t much in the public press about computers at that time. It was 1948 when I entered the university, so I didn’t know much about that for another year or two. There’s a book that I mentioned in this write up that I read around 1949 that I think really did influence me to think that computers were going to be something important, and maybe I might get involved with them some day. [Edmund C. Berkeley, Giant Brains, or Machines That Think, J. Wiley & Sons, 1949]. HAIGH: You think you would have read that book as an undergraduate student? LAWSON: Yes, I think probably around the time I was a sophomore in college. HAIGH: Do you think it was something that students were reading widely in that period? LAWSON: I doubt it. I don’t know how I came across it, but I don’t remember it being a topic of discussion or anything like that. It’s just something that I somehow picked up and found very interesting. HAIGH: Why was it that you moved to California? LAWSON: In order to prepare better to attend the University of California. I must say that my mother had a rather strong influence on my development in many ways. She had more or less always said to me that it would be good if I prepared to go into optometry; that I could do other things if I wanted to, but unless I decided on something else I wanted to do, she thought I should do everything necessary to prepare for that direction. So as it turned out, I was probably the youngest person that every entered and completed the School of Optometry at the University of California Berkeley. Generally people would not have had all of the prerequisites as young as I had them, because we had had the catalog from the school of optometry from the time I was in junior high school. I’d been taking high school classes and my freshmen and sophomore college classes all with the idea being prepared to go into the College of Optometry. HAIGH: So was Berkeley a school that was particularly known for its optometry program? LAWSON: There were only ten places in the United States that you could study optometry at that time. That may still be true now; I don't know. Only three of those were on the West Coast. One was Forest Grove outside of Portland; one was connected to the University of California Berkeley; and one was the Los Angeles College of Optometry. So I was oriented towards Berkeley. HAIGH: As you pursued optometry, was it a subject that you found interesting and motivating? LAWSON: Not particularly. I wasn’t particularly interested in it, and I guess my mind was always kind of searching for a different direction to go. I remember one incident when we were first doing some clinical work.
Load more

Recommended publications
  • LINEAR ALGEBRA METHODS in COMBINATORICS László Babai
    LINEAR ALGEBRA METHODS IN COMBINATORICS L´aszl´oBabai and P´eterFrankl Version 2.1∗ March 2020 ||||| ∗ Slight update of Version 2, 1992. ||||||||||||||||||||||| 1 c L´aszl´oBabai and P´eterFrankl. 1988, 1992, 2020. Preface Due perhaps to a recognition of the wide applicability of their elementary concepts and techniques, both combinatorics and linear algebra have gained increased representation in college mathematics curricula in recent decades. The combinatorial nature of the determinant expansion (and the related difficulty in teaching it) may hint at the plausibility of some link between the two areas. A more profound connection, the use of determinants in combinatorial enumeration goes back at least to the work of Kirchhoff in the middle of the 19th century on counting spanning trees in an electrical network. It is much less known, however, that quite apart from the theory of determinants, the elements of the theory of linear spaces has found striking applications to the theory of families of finite sets. With a mere knowledge of the concept of linear independence, unexpected connections can be made between algebra and combinatorics, thus greatly enhancing the impact of each subject on the student's perception of beauty and sense of coherence in mathematics. If these adjectives seem inflated, the reader is kindly invited to open the first chapter of the book, read the first page to the point where the first result is stated (\No more than 32 clubs can be formed in Oddtown"), and try to prove it before reading on. (The effect would, of course, be magnified if the title of this volume did not give away where to look for clues.) What we have said so far may suggest that the best place to present this material is a mathematics enhancement program for motivated high school students.
    [Show full text]
  • Exploring Continuous Tensegrities
    Exploring Continuous Tensegrities by Edward Bruce “Ted” Ashton (Under the direction of Dr. Jason Cantarella) Abstract A discrete tensegrity framework can be thought of as a graph in Euclidean n-space where each edge is of one of three types: an edge with a fixed length (bar) or an edge with an upper (cable) or lower (strut) bound on its length. Roth and Whiteley, in their 1981 paper “Tensegrity Frameworks”, showed that in certain cases, the struts and cables can be replaced with bars when analyzing the framework for infinitesimal rigidity. In that case we call the tensegrity bar equivalent. In specific, they showed that if there exists a set of positive weights, called a positive stress, on the edges such that the weighted sum of the edge vectors is zero at every vertex, then the tensegrity is bar equivalent. In this paper we consider an extended version of the tensegrity framework in arXiv:0704.2784v2 [math.MG] 14 May 2007 which the vertex set is a (possibly infinite) set of points in Euclidean n-space and the edgeset is a compact set of unordered pairs of vertices. These are called continuous tensegrities. We show that if a continuous tensegrity has a strictly positive stress, it is bar equivalent and that it has a semipositive stress if and only if it is partially bar equivalent. We also show that if a tensegrity is minimally bar equivalent (it is bar equivalent but removing any open set of edges makes it no longer so), then it has a strictly positive stress. In particular, we examine the case where the vertices form a rectifiable curve and the possible motions of the curve are limited to local isometries of it.
    [Show full text]
  • On Invariant Synthesis for Parametric Systems
    On Invariant Synthesis for Parametric Systems Dennis Peuter and Viorica Sofronie-Stokkermans Universit¨at Koblenz-Landau, Koblenz, Germany {dpeuter,sofronie}@uni-koblenz.de May 30, 2019 Abstract We study possibilities for automated invariant generation in parametric systems. We use (a refinement of) an algorithm for symbol elimination in theory extensions to devise a method for iteratively strengthening certain classes of safety properties to obtain invariants of the system. We identify conditions under which the method is correct and complete, and situations in which the method is guaranteed to terminate. We illustrate the ideas on various examples. 1 Introduction In the verification of parametric systems it is important to show that a certain property holds for all states reachable from the initial state. One way to solve such problems is to identify an inductive invariant which entails the property to be proved. Finding suitable inductive invariants is non-trivial – the problem is undecidable in general; solutions have been proposed for specific cases, as discussed in what follows. In [Kap06], Kapur proposes methods for invariant generation in theories such as Presburger arithmetic, real closed fields, and for polynomial equations and inequations with solutions in an algebraically closed field. The main idea is to use templates for the invariant (polynomials with undetermined coefficients), and solve constraints for all paths and initial values to determine the coefficients. A similar idea was used by Beyer et al. [BHMR07] for constraints in linear real or rational arithmetic; it is shown that if an invariant is expressible with a given template, then it will be computed. Symbol elimination has been used for interpolation and invariant generation in many papers.
    [Show full text]
  • Linear Algebra Over a Division Ring Cédric Milliet
    Linear Algebra over a division ring Cédric Milliet To cite this version: Cédric Milliet. Linear Algebra over a division ring. 2016. hal-01283071v4 HAL Id: hal-01283071 https://hal.archives-ouvertes.fr/hal-01283071v4 Preprint submitted on 14 Aug 2016 (v4), last revised 2 Jun 2020 (v7) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. GÉOMÉTRIE ALGÉBRIQUE ÉLÉMENTAIRE AU-DESSUS D’UN CORPS NON COMMUTATIF CÉDRIC MILLIET Résumé. On considère un analogue de la topologie de Zariski sur un corps non commuta- tif K. Un fermé de base est donné par les zéros d’un polynôme en la conjugaison par un élément de K fixé à coefficients à droite dans K. Cela nous permet de développer des notions de géométrie algébrique élémentaire : variété algébrique affine, morphisme, comorphisme, une dimension de Zariski, un théorème de Chevalley pour les ensembles constructibles et un Null- stellensatz. On applique ces résultats à la théorie des modèles des corps non commutatifs, en considérant un corps non commutatif K dont la théorie dans le langage (+, ×, 0, 1) n’a pas la propriété d’indépendance de Shelah. Si K est de caractéristique p, on montre qu’il est de dimension finie sur son centre.
    [Show full text]
  • Jonathan Corley University of West Georgia 1601 Maple Street Carrollton, GA 30118 Jcorley[At]Westga.Edu
    Jonathan Corley University of West Georgia 1601 Maple Street Carrollton, GA 30118 jcorley[at]westga.edu Research Interests CS Education and Outreach, Software Engineering Education Ph.D. in Computer Science, August 2016 University of Alabama, Tuscaloosa, AL, USA Advisor: Dr. Jeff Gray Committee: Dr. Jeffrey Carver, Dr. Randy Smith, Dr. Susan Vrbsky, Dr. Eugene Syriani M.S. in Computer Science, May 2012 University of Alabama, Tuscaloosa, AL, USA Advisor: Dr. Nicholas Kraft B.S. in Computer Science, May 2009 University of Alabama, Tuscaloosa, AL, USA Honors & Awards Outstanding Graduate Researcher, University of Alabama Department of CS, 2016 President of the University of Alabama chapter of Upsilon Pi Epsilon (UPE), 2015 and 2014 UPE is an international honor society for the computing and information disciplines. 1st place, MODELS ACM Student Research Competition Graduate, 2014. Valencia, Spain University of Alabama College of Engineering Outstanding Service by a Graduate Student, 2014 Outstanding ACM Graduate Award, University of Alabama Department of CS, 2013 Vice-President of the University of Alabama chapter of Upsilon Pi Epsilon, 2013 Inducted into the University of Alabama chapter of Upsilon Pi Epsilon, 2011 Publications Refereed Journal and Book Chapter Jonathan Corley, Brian Eddy, Eugene Syriani, and Jeff Gray “Efficient and Scalable Omniscient Debugging for Model Transformations” In Ghosh, S., Li, J. (Eds.) Software Quality Journal Special Issue on Program Debugging: Research, Practice and Challenges. No. 1, January 2017, pp. 7-48 Jonathan Corley, Eugene Syriani, Huseyin Ergin, and Simon Van Mierlo “Cloud-based Multi- View Modeling Environments” In Cruz, A.M., Paiva, S. (Eds.) Modern Software Engineering Methodologies for Mobile and Cloud Environments, IGI Global.
    [Show full text]
  • Single Digits
    ...................................single digits ...................................single digits In Praise of Small Numbers MARC CHAMBERLAND Princeton University Press Princeton & Oxford Copyright c 2015 by Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TW press.princeton.edu All Rights Reserved The second epigraph by Paul McCartney on page 111 is taken from The Beatles and is reproduced with permission of Curtis Brown Group Ltd., London on behalf of The Beneficiaries of the Estate of Hunter Davies. Copyright c Hunter Davies 2009. The epigraph on page 170 is taken from Harry Potter and the Half Blood Prince:Copyrightc J.K. Rowling 2005 The epigraphs on page 205 are reprinted wiht the permission of the Free Press, a Division of Simon & Schuster, Inc., from Born on a Blue Day: Inside the Extraordinary Mind of an Austistic Savant by Daniel Tammet. Copyright c 2006 by Daniel Tammet. Originally published in Great Britain in 2006 by Hodder & Stoughton. All rights reserved. Library of Congress Cataloging-in-Publication Data Chamberland, Marc, 1964– Single digits : in praise of small numbers / Marc Chamberland. pages cm Includes bibliographical references and index. ISBN 978-0-691-16114-3 (hardcover : alk. paper) 1. Mathematical analysis. 2. Sequences (Mathematics) 3. Combinatorial analysis. 4. Mathematics–Miscellanea. I. Title. QA300.C4412 2015 510—dc23 2014047680 British Library
    [Show full text]
  • Fundamental Theorems in Mathematics
    SOME FUNDAMENTAL THEOREMS IN MATHEMATICS OLIVER KNILL Abstract. An expository hitchhikers guide to some theorems in mathematics. Criteria for the current list of 243 theorems are whether the result can be formulated elegantly, whether it is beautiful or useful and whether it could serve as a guide [6] without leading to panic. The order is not a ranking but ordered along a time-line when things were writ- ten down. Since [556] stated “a mathematical theorem only becomes beautiful if presented as a crown jewel within a context" we try sometimes to give some context. Of course, any such list of theorems is a matter of personal preferences, taste and limitations. The num- ber of theorems is arbitrary, the initial obvious goal was 42 but that number got eventually surpassed as it is hard to stop, once started. As a compensation, there are 42 “tweetable" theorems with included proofs. More comments on the choice of the theorems is included in an epilogue. For literature on general mathematics, see [193, 189, 29, 235, 254, 619, 412, 138], for history [217, 625, 376, 73, 46, 208, 379, 365, 690, 113, 618, 79, 259, 341], for popular, beautiful or elegant things [12, 529, 201, 182, 17, 672, 673, 44, 204, 190, 245, 446, 616, 303, 201, 2, 127, 146, 128, 502, 261, 172]. For comprehensive overviews in large parts of math- ematics, [74, 165, 166, 51, 593] or predictions on developments [47]. For reflections about mathematics in general [145, 455, 45, 306, 439, 99, 561]. Encyclopedic source examples are [188, 705, 670, 102, 192, 152, 221, 191, 111, 635].
    [Show full text]
  • Jonathan Corley Research Interests Education Honors & Awards Refereed Journal and Book Chapter
    Jonathan Corley University of Alabama 342 H.M. Comer Hall corle001[at]crimson.ua.edu Tuscaloosa, AL 35487-0290 http://corle001.students.cs.ua.edu Research Interests Software Engineering, Model-Driven Engineering, CS Education and Outreach Education Ph.D. in Computer Science, expected August 2016 University of Alabama, Tuscaloosa, AL, USA Advisor: Dr. J. Gray M.S. in Computer Science, May 2012 University of Alabama, Tuscaloosa, AL, USA Advisor: Dr. N. Kraft B.S. in Computer Science, May 2009 University of Alabama, Tuscaloosa, AL, USA Honors & Awards Outstanding Graduate Researcher, University of Alabama Department of CS, 2016 1st place, MODELS ACM Student Research Competition Graduate, 2014. Valencia, Spain University of Alabama College of Engineering Outstanding Service by a Graduate Student, 2014 Outstanding ACM Graduate Award, University of Alabama Department of CS, 2013 2nd place, ACM midSE, Graduate: PhD presentation, 2013. Gatlinburg, TN, USA President of the University of Alabama chapter of Upsilon Pi Epsilon (UPE), 2015 and 2014 UPE is an international honor society for the computing and information disciplines. Vice-President of the University of Alabama chapter of Upsilon Pi Epsilon, 2013 Inducted into the University of Alabama chapter of Upsilon Pi Epsilon, 2011 Refereed Journal and Book Chapter Jonathan Corley, Brian Eddy, Eugene Syriani, and Jeff Gray (2016) “Efficient and Scalable Omniscient Debugging for Model Transformations” In Ghosh, S., Li, J. (Eds.) Software Quality Special Issue on Program Debugging: Research, Practice and Challenges. Jonathan Corley, Eugene Syriani, Huseyin Ergin, and Simon Van Mierlo (2016) “Cloud-based Multi-View Modeling Environments” In Cruz, A.M., Paiva, S. (Eds.) Modern Software Engineering Methodologies for Mobile and Cloud Environments, IGI Global.
    [Show full text]
  • Complexity Results for Fourier-Motzkin Elimination
    Western University Scholarship@Western Electronic Thesis and Dissertation Repository 12-11-2018 2:30 PM Complexity Results for Fourier-Motzkin Elimination Delaram Talaashrafi The University of Western Ontario Supervisor Moreno Maza, Marc The University of Western Ontario Graduate Program in Computer Science A thesis submitted in partial fulfillment of the equirr ements for the degree in Master of Science © Delaram Talaashrafi 2018 Follow this and additional works at: https://ir.lib.uwo.ca/etd Part of the Theory and Algorithms Commons Recommended Citation Talaashrafi, Delaram, "Complexity Results for Fourier-Motzkin Elimination" (2018). Electronic Thesis and Dissertation Repository. 5981. https://ir.lib.uwo.ca/etd/5981 This Dissertation/Thesis is brought to you for free and open access by Scholarship@Western. It has been accepted for inclusion in Electronic Thesis and Dissertation Repository by an authorized administrator of Scholarship@Western. For more information, please contact [email protected]. Abstract In this thesis, we propose a new method for removing all the redundant inequalities gener- ated by Fourier-Motzkin elimination. This method is based on Kohler’s work and an improved version of Balas’ work. Moreover, this method only uses arithmetic operations on matrices. Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches based on linear programming. Keywords: polyhedron, projection, Fourier-Motzkin elimination, linear algebra, polyhe- dral cone, parametric linear programming i Acknowledgments First and foremost, I would like to offer my sincerest gratitude to my supervisor Professor Marc Moreno Maza, I am very thankful for his great advice and support. It is my honor to have Professor Graham Denham, Professor Roberto Solis-Oba, and Professor Kaizhong Zhang as the examiners.
    [Show full text]
  • Appendix C SURPLUS/LOSS: $291.34 SIGCSE 0.00 Sigada 100.00 SIGAPP 0.00 SIGPLAN 0.00
    Starts Ends Conference Actual SIGs and their % SIGACCESS 21-Oct-13 23-Oct-13 ASSETS '13: The 15th International ACM SIGACCESS ATTENDANCE: 155 SIGACCESS 100.00 Conference on Computers and Accessibility INCOME: $74,697.30 EXPENSE: $64,981.11 SURPLUS/LOSS: $9,716.19 SIGACT 12-Jan-14 14-Jan-14 ITCS'14 : Innovations in Theoretical Computer Science ATTENDANCE: 76 SIGACT 100.00 INCOME: $19,210.00 EXPENSE: $21,744.07 SURPLUS/LOSS: ($2,534.07) 22-Jul-13 24-Jul-13 PODC '13: ACM Symposium on Principles ATTENDANCE: 98 SIGOPS 50.00 of Distributed Computing INCOME: $62,310.50 SIGACT 50.00 EXPENSE: $56,139.24 SURPLUS/LOSS: $6,171.26 23-Jul-13 25-Jul-13 SPAA '13: 25th ACM Symposium on Parallelism in ATTENDANCE: 45 SIGACT 50.00 Algorithms and Architectures INCOME: $45,665.50 SIGARCH 50.00 EXPENSE: $39,586.18 SURPLUS/LOSS: $6,079.32 23-Jun-14 25-Jun-14 SPAA '14: 26th ACM Symposium on Parallelism in ATTENDANCE: 73 SIGARCH 50.00 Algorithms and Architectures INCOME: $36,107.35 SIGACT 50.00 EXPENSE: $22,536.04 SURPLUS/LOSS: $13,571.31 31-May-14 3-Jun-14 STOC '14: Symposium on Theory of Computing ATTENDANCE: SIGACT 100.00 INCOME: $0.00 EXPENSE: $0.00 SURPLUS/LOSS: $0.00 SIGAda 10-Nov-13 14-Nov-13 HILT 2013:High Integrity Language Technology ATTENDANCE: 60 SIGBED 0.00 ACM SIGAda Annual INCOME: $32,696.00 SIGCAS 0.00 EXPENSE: $32,404.66 SIGSOFT 0.00 Appendix C SURPLUS/LOSS: $291.34 SIGCSE 0.00 SIGAda 100.00 SIGAPP 0.00 SIGPLAN 0.00 SIGAI 11-Nov-13 15-Nov-13 ASE '13: ACM/IEEE International Conference on ATTENDANCE: 195 SIGAI 25.00 Automated Software Engineering
    [Show full text]
  • Dov Jarden Born 17 January 1911 (17 Tevet, Taf Resh Ain Aleph) Deceased 29 September 1986 (25 Elul, Taf Shin Mem Vav) by Moshe Jarden12
    Dov Jarden Born 17 January 1911 (17 Tevet, Taf Resh Ain Aleph) Deceased 29 September 1986 (25 Elul, Taf Shin Mem Vav) by Moshe Jarden12 http://www.dov.jarden.co.il/ 1Draft of July 9, 2018 2The author is indebted to Gregory Cherlin for translating the original biography from Hebrew and for his help to bring the biography to its present form. 1 Milestones 1911 Birth, Motele, Russian Empire (now Motal, Belarus) 1928{1933 Tachkemoni Teachers' College, Warsaw 1935 Immigration to Israel; enrolls in Hebrew University, Jerusalem: major Mathematics, minors in Bible studies and in Hebrew 1939 Marriage to Haya Urnstein, whom he called Rachel 1943 Master's degree from Hebrew University 1943{1945 Teacher, Bnei Brak 1945{1955 Completion of Ben Yehuda's dictionary under the direction of Professor Tur-Sinai 1946{1959 Editor and publisher, Riveon LeMatematika (13 volumes) 1947{1952 Assisting Abraham Even-Shoshan on Milon Hadash, a new He- brew Dictionary 1953 Publication of two Hebrew Dictionaries, the Popular Dictionary and the Pocket Dictionary, with Even-Shoshan 1956 Doctoral degree in Hebrew linguistics from Hebrew Unversity, under the direction of Professor Tur-Sinai; thesis published in 1957 1960{1962 Curator of manuscripts collection, Hebrew Union College, Cincinnati 1965 Publication of the Dictionary of Hebrew Acronyms with Shmuel Ashkenazi 1966 Publication of the Complete Hebrew-Spanish Dictionary with Arye Comay 1966 Critical edition of Samuel HaNagid's Son of Psalms under the Hebrew Union College Press imprint 1969{1973 Critical edition of
    [Show full text]
  • PARSEC3.0: a Multicore Benchmark Suite with Network Stacks and SPLASH-2X
    PARSEC3.0: A Multicore Benchmark Suite with Network Stacks and SPLASH-2X Xusheng Zhan1,2, Yungang Bao1, Christian Bienia3, and Kai Li3 1State Key Laboratory of Computer Architecture, ICT, CAS 2University of Chinese Academy of Sciences 3Department of Computer Science, Princeton University Abstract Benchmarks play a very important role in accelerating the development and research of CMP. As one of them, the PARSEC suite continues to be updated and revised over and over again so that it can offer better support for researchers. The former versions of PARSEC have enough workloads to evaluate the property of CMP about CPU, cache and memory, but it lacks of applications based on network stack to assess the performance of CMPs in respect of network. In this work, we introduce PARSEC3.0, a new version of PARSEC suite that implements a user-level network stack and generates three network workloads with this stack to cover network domain. We explore the input sets of splash-2 and expand them to multiple scales, a.k.a, splash-2x. We integrate splash-2 and splash-2x into PARSEC framework so that researchers use these benchmark suite conveniently. Finally, we evaluate the u-TCP/IP stack and new network workloads, and analyze the characterizes of splash-2 and splash-2x. 1. Introduction Benchmarking is a fundamental methodology for computer architecture research. Architects evaluate their new design using benchmark suites that usually consist of multiple programs selected out from a diversity of domains. The PARSEC benchmark suite, containing 13 applications from six emerging domains, has been widely used for evaluating chip multiprocessors (CMPs) systems since it is released in 2008.
    [Show full text]