Logiciel MPSA Et Ressources Bioinformatiques Client- Serveur Web Dédiés À L’Analyse De Séquences De Protéine

Total Page:16

File Type:pdf, Size:1020Kb

Logiciel MPSA Et Ressources Bioinformatiques Client- Serveur Web Dédiés À L’Analyse De Séquences De Protéine N° d’ordre 139-99 Année 1999 THÈSE présentée devant l’UNIVERSITÉ CLAUDE BERNARD – LYON 1 pour l’obtention du DIPLÔME DE DOCTORAT (arrêté du 30 mars 1992) présentée et soutenue publiquement le 31 mai 1999 par M. Christophe BLANCHET TITRE : Logiciel MPSA et ressources bioinformatiques client- serveur Web dédiés à l’analyse de séquences de protéine. Directeur de thèse : Pr Gilbert DELEAGE JURY : Dr Marc-André DELSUC, Rapporteur Dr Philippe DESSEN, Rapporteur Dr Jean-Jacques CODANI Pr Alain-Jean COZZONE, Président Pr Gilbert DELÉAGE Avant-propos Avant-Propos Avant de commencer, j'aimerais attirer l'attention du lecteur sur deux notions. Tout d'abord je trouve qu'il est toujours très difficile de présenter un logiciel ou un site Web par écrit : que ce soit dans un document relié, avec des transparents ou avec des diapositives. C'est pourquoi, je ne saurais que conseiller au lecteur d'essayer les logiciels et de visiter les sites Web que je présente dans cet ouvrage. Notamment en ce qui concerne MPSA, le lecteur pourra trouver toutes les informations disponibles sur le site Web (http://www.ibcp.fr/mpsa) et y télécharger un exécutable pour son système d'exploitation. La deuxième notion sur laquelle je voudrais attirer votre attention est la mise sur le Web de cette thèse. En effet, cet ouvrage traitant de bioinformatique et du World-Wide Web, il contient de nombreuses références à d'autres documents répartis sur Internet. C'est pourquoi je publierai la version finale de ma thèse au format HTML sur ma page personnelle (http://www.ibcp.fr/~blanchet). - 3 - Remerciements Remerciements En premier lieu mes remerciements vont à mes rapporteurs, les Dr Phillipe Dessen et Marc-André Delsuc, pour avoir accepté de juger le travail que j’ai effectué au cours de ma thèse. Mes remerciements sont également adressés au Dr Jean-Jacques Codani, au Pr Alain-Jean Cozzone et au Pr Gilbert Deléage pour leur participation à mon jury. J’ai une attention particulière pour Gilbert Deléage qui m’a accueilli depuis mon stage de DEA dans son équipe, le Laboratoire de Conformation des Protéines (sans oublier François Penin). Sans lui, je ne serais peut-être pas revenu à une de mes passions un moment délaissée : l’informatique. En effet le champ de recherche qu’il m’avait proposé alors, la Bioinformatique, m’a permis de concilier et d’imbriquer deux disciplines qui m’intéressent au plus haut point : la Biologie et l’Informatique. De la même manière, je remercie le Pr A.J. Cozzone tout d’abord pour m’avoir accueilli au sein de l’Institut de Biologie et Chimie des Protéines (CNRS – UPR 412), mais également pour la confiance qu’il m’a accordée en me confiant la création et l’administration du serveur Web de l’EDISS, École Doctorale Interdisciplinaire Sciences- Santé, qu’il dirige et à laquelle j’ai appartenu au cours de ma formation doctorale. Je remercie tous les membres du Laboratoire de Conformation de Protéines pour leur bonne humeur et leur disponibilité, gages d'un climat de travail de qualité: Anja Böckmann, Christophe Combet, Christophe Geourjon, Laurent Ladavière, Roland Montserret, François Penin, Tetsuya Takahashi, mais également le presque-de-la-famille "Xav. le graveur fou". Je ne peux remercier les gens de mon équipe sans remercier un autre Xavier que je n'ai pas eu la joie de connaître plus longtemps car il nous a quitté beaucoup trop rapidement. La coutume veut de dire que ce sont toujours les meilleurs qui s'en vont, parfois c'est tragiquement vrai… Je citais tout à l'heure l’EDISS, tous mes remerciements vont également aux membres etudiants du bureau avec qui j’ai pris plaisir - 5 - Table des matières à travailler : Olivier N., Marie-Caroline N.-D., Pierre H., Frédéric B., Bruno C., pour ne citer qu’eux. Ces mêmes personnes et toute leur petite famille se retrouvent également ici remerciées au même titre que de nombreuses autres personnes que je considère comme mes amis. Je ne saurai terminer sans adresser tous mes chaleureux remerciements à mes parents et à ma famille, mais également à mes beaux-parents et à la famille de Christelle. Christelle, que je remercie ici de tout mon cœur pour son amour et son soutien. Sans oublier le petit bout de chou trognon que nous avons la chance d'avoir pour fille, notre petite Alice. Christophe - 6 - Table des matières Table des Matières Avant-Propos.................................................................................................................. 3 Remerciements............................................................................................................... 5 Table des Matières ......................................................................................................... 7 Table des illustrations.................................................................................................. 13 Abréviations ................................................................................................................. 15 1 Introduction .............................................................................................................. 17 2 Rappels bibliographiques ......................................................................................... 21 2.1 Le Web : le nouvel outil du biologiste....................................................................21 2.2 Les bases de données relatives aux protéines .........................................................23 2.2.1 DBcat : la banque des banques de données biologiques...........................................................24 2.2.2 Les banques de séquences de protéines généralistes ................................................................24 2.2.2.1 SWISS–PROT......................................................................................................................24 2.2.2.2 TrEMBL...............................................................................................................................26 2.2.2.3 PIR International..................................................................................................................27 2.2.3 Les banques de séquences de protéine spécialisées ..................................................................28 2.2.4 Autres bases de données biologiques utiles en analyse de séquences.....................................28 2.2.4.1 Banques de motifs protéiques.............................................................................................28 2.2.4.1.1 PROSITE ......................................................................................................................29 2.2.4.1.2 PRODOM, DOMO et Pfam ........................................................................................29 2.2.4.1.3 BLOCKS et PRINTS ...................................................................................................29 2.2.4.2 Banque de structures tridimensionnelles : la PDB ............................................................30 2.2.4.3 Banque de domaines structuraux : SCOP, CATH, etc. .....................................................30 2.2.5 Outils d’interrogation de bases de données ...............................................................................30 2.3 Alignement de séquences de protéine.....................................................................31 2.3.1 Algorithme de programmation dynamique de Smith et Waterman .........................................31 2.3.2 Recherche de protéines similaires : alignement par paire ........................................................33 2.3.2.1 FASTA..................................................................................................................................33 2.3.2.2 BLAST..................................................................................................................................34 2.3.2.3 Efficacité relative des méthodes .........................................................................................34 2.3.3 Étude d’une famille de protéines : alignement multiple ...........................................................35 2.3.3.1 Quelques méthodes disponibles : Clustal W, Multalin, etc. .............................................35 2.3.3.1.1 Les algorithmes fondamentaux d’alignement multiple.............................................35 2.3.3.1.2 Algorithmes optimisant les fondamentaux.................................................................36 2.3.3.2 Validation de ces méthodes ................................................................................................36 2.4 Prédiction de structure secondaire ........................................................................38 2.4.1 Prédiction à partir de la seule séquence de la protéine..........................................................39 2.4.2 Incorporation de l'information relative à l’évolution de la séquence .....................................39 2.4.2.1 En utilisant la notion de similarité de séquences...............................................................39 2.4.2.2 En utilisant les alignements multiples................................................................................40 2.4.2.3 En utilisant la Phylogénie ...................................................................................................40 - 7 - Table des matières 2.4.3 Comparaison des qualités de prédiction ...................................................................................40 2.4.3.1 Nouvelles perspectives........................................................................................................40
Recommended publications
  • Overview of the SPEC Benchmarks
    9 Overview of the SPEC Benchmarks Kaivalya M. Dixit IBM Corporation “The reputation of current benchmarketing claims regarding system performance is on par with the promises made by politicians during elections.” Standard Performance Evaluation Corporation (SPEC) was founded in October, 1988, by Apollo, Hewlett-Packard,MIPS Computer Systems and SUN Microsystems in cooperation with E. E. Times. SPEC is a nonprofit consortium of 22 major computer vendors whose common goals are “to provide the industry with a realistic yardstick to measure the performance of advanced computer systems” and to educate consumers about the performance of vendors’ products. SPEC creates, maintains, distributes, and endorses a standardized set of application-oriented programs to be used as benchmarks. 489 490 CHAPTER 9 Overview of the SPEC Benchmarks 9.1 Historical Perspective Traditional benchmarks have failed to characterize the system performance of modern computer systems. Some of those benchmarks measure component-level performance, and some of the measurements are routinely published as system performance. Historically, vendors have characterized the performances of their systems in a variety of confusing metrics. In part, the confusion is due to a lack of credible performance information, agreement, and leadership among competing vendors. Many vendors characterize system performance in millions of instructions per second (MIPS) and millions of floating-point operations per second (MFLOPS). All instructions, however, are not equal. Since CISC machine instructions usually accomplish a lot more than those of RISC machines, comparing the instructions of a CISC machine and a RISC machine is similar to comparing Latin and Greek. 9.1.1 Simple CPU Benchmarks Truth in benchmarking is an oxymoron because vendors use benchmarks for marketing purposes.
    [Show full text]
  • Chapter 3 CSE Implementation Issues
    UvA-DARE (Digital Academic Repository) Studies in Interactive Visualization van Liere, R. Publication date 2001 Link to publication Citation for published version (APA): van Liere, R. (2001). Studies in Interactive Visualization. General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:25 Sep 2021 Chapter 3 CSE Implementation Issues An overview of the CSE architecture was presented in Chapter 2. In this chapter a more in-depth discussion on the technical issues related to the design and implementation is given. 3.1 Design 3.1.1 Data Storage and Mappings A variable managed by the blackboard consists of a name, type, value, dimensions, and user defined attributes. Data is stored in the blackboard as an n-dimensional array (where n is0, 1, 2,...) containing elements of the same scalar type (e.g., 8-bit character, 32-bit integer).
    [Show full text]
  • 3Dfx Oral History Panel Gordon Campbell, Scott Sellers, Ross Q. Smith, and Gary M. Tarolli
    3dfx Oral History Panel Gordon Campbell, Scott Sellers, Ross Q. Smith, and Gary M. Tarolli Interviewed by: Shayne Hodge Recorded: July 29, 2013 Mountain View, California CHM Reference number: X6887.2013 © 2013 Computer History Museum 3dfx Oral History Panel Shayne Hodge: OK. My name is Shayne Hodge. This is July 29, 2013 at the afternoon in the Computer History Museum. We have with us today the founders of 3dfx, a graphics company from the 1990s of considerable influence. From left to right on the camera-- I'll let you guys introduce yourselves. Gary Tarolli: I'm Gary Tarolli. Scott Sellers: I'm Scott Sellers. Ross Smith: Ross Smith. Gordon Campbell: And Gordon Campbell. Hodge: And so why don't each of you take about a minute or two and describe your lives roughly up to the point where you need to say 3dfx to continue describing them. Tarolli: All right. Where do you want us to start? Hodge: Birth. Tarolli: Birth. Oh, born in New York, grew up in rural New York. Had a pretty uneventful childhood, but excelled at math and science. So I went to school for math at RPI [Rensselaer Polytechnic Institute] in Troy, New York. And there is where I met my first computer, a good old IBM mainframe that we were just talking about before [this taping], with punch cards. So I wrote my first computer program there and sort of fell in love with computer. So I became a computer scientist really. So I took all their computer science courses, went on to Caltech for VLSI engineering, which is where I met some people that influenced my career life afterwards.
    [Show full text]
  • Quality Planning for Distributed Collaborative Multimedia Applications
    Quality Planning for Distributed Collab orative Multimedia Applications PhD Thesis Mark Claypool Advisor John Riedl University of Minnesota Computer Science Department September Acknowledgements There are many p eople who have help ed me in this work either directly by adding their work to mine or indirectly by giving me vision and supp ort However ab ove all there are two p eople who deserve my deep est gratitude Professor John Riedl and my wife Ka jal As my advisor John has contributed to all levels of this thesis from guidance on writing C co de and English grammar rules to exp erimental design and data analysis to a rich exciting vision of computer science research Most imp ortantly he has provided motivation to p ersevere through the slow dicult parts of research motivation to pursue research problems that make a dierence in the world and motivation to pursue a career as a professor myself I hop e to emulate much of Johns style when I advise my future graduate students Equally imp ortant Ka jal has b een a pillar of strength and supp ort She has b een understanding of the uctuations in the demands on the time of a graduate student She has b een patient through the many years she worked to supp ort us while I was still in school working on this thesis She has b een inspirational when I was down ab out progress or down ab out some exp eriment results And her technical knowledge has provided me with nudges in the right direction when my research lacked fo cus I hop e I can b e as supp ortive of her during her PhD quest as she was
    [Show full text]
  • Chris Trendall
    Chris Trendall A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto Copyright @ 2000 by Chris Trendall National Library Bibliotheque nationale 191 ,cana, du Canada Acquisitions and Acquisitions et Bibtiographic Services services bibliographiques 395 Wellington Street 395. rue Wdlingtm OttawaON KlAW OitewaON K1AW CaMda Canada The author has granted a non- L'auteur a accordé une licence non exclusive Licence allowing the exclusive permettant à la National Library of Canada to Bibliothèque nationale du Canada de reproduce, loan, dismbute or seii reproduire, prêter, distribuer ou copies of this thesis in microfonn, vendre des copies de cette thèse sous paper or electronic formats. la forme de microfiche/nlm, de reproduction sur papier ou sur format électronique. The author retains ownership of the L'auteur conserve la propriété du copyright in this thesis. Neither the droit d'auteur qui protège cette thèse. thesis nor substantial extracts fkom it Ni la thèse ni des extraits substantiels may be printed or otherwise de celle-ci ne doivent être imprimés reproduced without the author's ou autrement reproduits sans son permission. autorisation. Abstract Ray Tracing Refraction in Hardware Chris Trendall Master of Science Graduate Department of Computer Science University of Toronto 2000 Graphics hardware has begun to e-xhibit more general mathematical functionality, sug- gesting that a wider range of mathematical operations can be implemented in hardware. In order to explore what can and cannot be implemented in current hardware and to study necessary hardware functionality for even more general calculations, single inter- action ray - tracing is studied.
    [Show full text]
  • Simulation of Turbulent Flow in Computer Graphics: Applications
    Simulation of Turbulent Flow in Computer Graphics: Applications and Optimizations Ian Buck Princeton University, Department of Computer Science Indep endent Work for COS 397 Advisor : Perry R. Co ok www.cs.princeton.edu/~ ianbuck/turbulent January 5, 1998 Abstract The basis for the rst part of this work was to explore what is involved in simulating turbulent ow using an already existing mathematical mo del. This includes implementing a complete optimized C version of the mo del and simulating owmodelssuch as acoustical instruments. The second part of this work explores alternative metho ds of calculation for ow simulation using the graphics hardware as a mathematical engine. We present a few di erent metho ds to use the accelerated framebu er to p erform some of the calculations required in ow simulation. Part I Simulating Turbulent Flow 1 Intro duction Research in application of uid ow simulation has been an active topic in computer graphics for over a decade. Such visual e ects as simulated smoke, re, and liquids are all typically based on top of a mathematical mo del which graphics researchers have b een trying to improve through to day. There have been endless pap ers published in the ACM SIGGRAPH pro ceedings in '97, '95, '93, '91, '90, and continuing back through '86 with a pap er dedicated to how the swirling atmosphere of Jupiter was simulated for the movie \2010" (Yeager et al, 1986). The primary diculty in creating such visually stimulating e ects, suchas simple candle smoke isthatanintensive computational simulation is required. To provide results which app ear accurate, such calculations can b e extensive and quite slow.
    [Show full text]
  • História, Vývoj a Praktické Uplatnenie Vizuálnych Efektov V Súčastnosti
    VYSOKÁ ŠKOLA MÚZICKÝCH UMENÍ FILMOVÁ A TELEVÍZNA FAKULTA Ateliér vizuálnych efektov História, vývoj a praktické uplatnenie vizuálnych efektov v súčastnosti. BAKALÁRSKA PRÁCA Vypracoval: Jozef Janík Vedúci práce: Mgr. Art. Marián Villaris Bratislava 2015 VYSOKÁ ŠKOLA MÚZICKÝCH UMENÍ FILMOVÁ A TELEVÍZNA FAKULTA Ateliér vizuálnych efektov História, vývoj a praktické uplatnenie vizuálnych efektov v súčastnosti. BAKALÁRSKA PRÁCA Ateliér vizuálnych efektov Školiteľ: Konzultant: V Bratislave 01. 01. 2015 Jozef Janík Čestné prehlásenie: Prehlasujem, že som túto bakalársku prácu vypracoval samostatne a že som uviedol všetky informačné zdroje. V Bratislave dňa 01.01. 2015 ...................................... Jozef Janík Poďakovanie: Touto cestou vyslovujem poďakovanie pánovi Mgr. Art. Mariánovi Villarisovi za pomoc, odborné vedenie, cenné rady a pripomienky pri vypracovaní mojej bakalárskej práce. V Bratislave dňa............................... ........................................ podpis študenta VYSOKÁ ŠKOLA MÚZICKÝCH UMENÍ, FILMOVÁ A TELEVÍZNA FAKULTA, ATELIÉR VIZUÁLNYCH EFEKTOV ABSTRAKT JANÍK, Jozef: História, vývoj a praktické uplatnenie vizuálnych efektov v súčastnosti. [Bakalárska práca]. – Vysoká škola múzických umení. Filmová a televízna fakulta. Ateliér vizuálnych efek- tov. Vedúci práce: Mgr. art. Marian Villaris. Oponent: Ing. Ladislav Dedík. Vysoká škola múzických umení. 2015. Počet strán: 32. Bakalárska práca sa venuje histórii a vývoju vizuálnych efektov v minulosti a porovnáva ich s postupmi, ktoré sa používajú v súčasnosti.
    [Show full text]
  • Realtime Computer Graphics on Gpus Introduction
    Real-time Algorithms Programmable Pipeline History Summary Realtime Computer Graphics on GPUs Introduction Jan Kolomazn´ık Department of Software and Computer Science Education Faculty of Mathematics and Physics Charles University in Prague March 3, 2021 1 / 55 Real-time Algorithms Programmable Pipeline History Summary Real-time Algorithms 2 / 55 Real-time Algorithms Programmable Pipeline History Summary REAL-TIME ALGORITHMS I Time Constrains: I Hard limit I Soft limit I CG examples: I Video frame rate I Cinema – 24 Hz I TV – 25 (50) Hz, 30 (60) Hz I Video games – 30–60 Hz I Virtual reality – frame rate doubled I Haptic rendering – 1 kHz 3 / 55 Real-time Algorithms Programmable Pipeline History Summary REAL-TIME ALGORITHMS I Time Constrains: I Hard limit I Soft limit I CG examples: I Video frame rate I Cinema – 24 Hz I TV – 25 (50) Hz, 30 (60) Hz I Video games – 30–60 Hz I Virtual reality – frame rate doubled I Haptic rendering – 1 kHz 4 / 55 Real-time Algorithms Programmable Pipeline History Summary REAL-TIME ALGORITHMS I Time Constrains: I Hard limit I Soft limit I CG examples: I Video frame rate I Cinema – 24 Hz I TV – 25 (50) Hz, 30 (60) Hz I Video games – 30–60 Hz I Virtual reality – frame rate doubled I Haptic rendering – 1 kHz 5 / 55 Real-time Algorithms Programmable Pipeline History Summary REAL-TIME ALGORITHMS I Time Constrains: I Hard limit I Soft limit I CG examples: I Video frame rate I Cinema – 24 Hz I TV – 25 (50) Hz, 30 (60) Hz I Video games – 30–60 Hz I Virtual reality – frame rate doubled I Haptic rendering – 1 kHz 6 / 55 Real-time Algorithms Programmable Pipeline History Summary REAL-TIME ALGORITHMS I Time Constrains: I Hard limit I Soft limit I CG examples: I Video frame rate I Cinema – 24 Hz I TV – 25 (50) Hz, 30 (60) Hz I Video games – 30–60 Hz I Virtual reality – frame rate doubled I Haptic rendering – 1 kHz 7 / 55 Real-time Algorithms Programmable Pipeline History Summary HOW TO ACHIEVE SPEED I Optimal algorithm (time complexity ?) I Approximations vs.
    [Show full text]
  • Performance of Various Computers Using Standard Linear Equations Software
    ———————— CS - 89 - 85 ———————— Performance of Various Computers Using Standard Linear Equations Software Jack J. Dongarra* Electrical Engineering and Computer Science Department University of Tennessee Knoxville, TN 37996-1301 Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge, TN 37831 University of Manchester CS - 89 - 85 June 15, 2014 * Electronic mail address: [email protected]. An up-to-date version of this report can be found at http://www.netlib.org/benchmark/performance.ps This work was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract DE-AC05-96OR22464, and in part by the Science Alliance a state supported program at the University of Tennessee. 6/15/2014 2 Performance of Various Computers Using Standard Linear Equations Software Jack J. Dongarra Electrical Engineering and Computer Science Department University of Tennessee Knoxville, TN 37996-1301 Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge, TN 37831 University of Manchester June 15, 2014 Abstract This report compares the performance of different computer systems in solving dense systems of linear equations. The comparison involves approximately a hundred computers, ranging from the Earth Simulator to personal computers. 1. Introduction and Objectives The timing information presented here should in no way be used to judge the overall performance of a computer system. The results reflect only one problem area: solving dense systems of equations. This report provides performance information on a wide assortment of computers ranging from the home-used PC up to the most powerful supercomputers. The information has been collected over a period of time and will undergo change as new machines are added and as hardware and software systems improve.
    [Show full text]
  • Digital's Vaxstation 4000 Family Performance Summary
    Digital’s VAXstation 4000 Family Performance Summary Version 2.0 March 1992 Order Number: EC-N0626-51 Digital Equipment Corporation Maynard MA TM ________________________________________________________________________________________________ First Printing, March 1992 The information in this document is subject to change without notice and should not be construed as a com- mitment by Digital Equipment Corporation. Digital Equipment Corporation assumes no responsibility for any errors that may appear in this document. Any software described in this document is furnished under a license and may be used or copied only in accordance with the terms of such license. No responsibility is assumed for the use or reliability of software or equipment that is not supplied by Digital Equipment Corporation or its affiliated companies. Restricted Rights: Use, duplication, or disclosure by the U.S. Government is subject to restrictions as set forth in subparagraph (c)(1)(ii) of the Rights in Technical Data and Computer Software clause at DFARS 252.227 7013. Copyright ©1991 Digital Equipment Corporation All right reserved. Printed in U.S.A. The following are trademarks of Digital Equipment Corporation: DEC, DECsystem, DECwrite , the DIGI- TAL Logo, ULTRIX, VAX, VAXstation 3100, VMS The following are third-party trademarks: dBASE IV is a registered trademark of Ashton-Tate Corporation. HP is a trademark of Hewlett-Packard Company. IBM is a trademark of International Business Machines Corporation. Lotus and 1-2-3 are registered trademarks of the Lotus Development Corporation. SPEC is a trademark of the Standard Performance Evaluation Corporation. SPARCserver is a trademark of Sun Microsystems, Incorporated. Sun is a trademark of Sun Microsystems, Incorporated.
    [Show full text]
  • Performance of Various Computers Using Standard Linear Equations Software
    ———————— CS - 89 - 85 ———————— Performance of Various Computers Using Standard Linear Equations Software Jack J. Dongarra* Electrical Engineering and Computer Science Department University of Tennessee Knoxville, TN 37996-1301 Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge, TN 37831 University of Manchester CS - 89 - 85 September 30, 2009 * Electronic mail address: [email protected]. An up-to-date version of this report can be found at http://WWW.netlib.org/benchmark/performance.ps This Work Was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract DE-AC05-96OR22464, and in part by the Science Alliance a state supported program at the University of Tennessee. 9/30/2009 2 Performance of Various Computers Using Standard Linear Equations Software Jack J. Dongarra Electrical Engineering and Computer Science Department University of Tennessee Knoxville, TN 37996-1301 Computer Science and MatHematics Division Oak Ridge National Laboratory Oak Ridge, TN 37831 University of Manchester September 30, 2009 Abstract This report compares the performance of different computer systems in solving dense systems of linear equations. The comparison involves approximately a hundred computers, ranging from the Earth Simulator to personal computers. 1. Introduction and Objectives The timing information presented here should in no way be used to judge the overall performance of a computer system. The results reflect only one problem area: solving dense systems of equations. This report provides performance information on a wide assortment of computers ranging from the home-used PC up to the most powerful supercomputers. The information has been collected over a period of time and will undergo change as new machines are added and as hardware and software systems improve.
    [Show full text]
  • An Overview of Scientific Computing
    An Overview of Scienti c Computing Lloyd Fosdick Elizab eth Jessup Septemb er 28, 1995 High Performance Scienti c Computing University of Colorado at Boulder c Copyright 1995 by the HPSC Group of the University of Colorado The following are memb ers of the HPSC Group of the Department of Computer Science at the University of Colorado at Boulder: Lloyd D. Fosdick Elizab eth R. Jessup Carolyn J. C. Schauble Gitta O. Domik Overview i Contents 1 Intro duction 1 2 Large-scale scienti c problems 2 2.1.1 Computer simulation of the greenhouse e ect ::: :: 6 3 The scienti c computing environment 8 4 Workstations 14 4.1 RISC architecture : :: :: :: :: ::: :: :: :: :: ::: :: 15 4.2 The DEC 5000 workstation : :: ::: :: :: :: :: ::: :: 17 4.2.1 The MIPS R3000 and R3010 pro cessors. : :: ::: :: 18 5 Sup ercomputers 19 5.1 Parallel architectures : :: :: :: ::: :: :: :: :: ::: :: 19 5.1.1 Evaluation of an integral : ::: :: :: :: :: ::: :: 20 5.1.2 Molecular dynamics :: :: ::: :: :: :: :: ::: :: 21 5.1.3 Typ es of parallel computers :: :: :: :: :: ::: :: 22 5.2 A virtual parallel computer : :: ::: :: :: :: :: ::: :: 26 6 Further reading 27 References 28 CUBoulder : HPSC Course Notes ii Overview Trademark Notice Convex, Convex Exemplar, are trademarks of Convex Computer Corp ora- tion. Cray, Cray-1, Cray Y-MP, Cray C90, are trademarks of Cray Research, Inc. DEC, DECstation, DECstation 5000, DEC 5000/240, DEC 10000-660 AXP, DEC PXG 3D Accelerator, DEC VAX 11/780, PXG, PXGTurb o+, VAX are trademarks of Digital Equipment Corp oration. HP 9000/735 is a trademark of Hewlett-Packard Company. Intel i860, Intel iPSC/2, Intel iPSC/860, Intel Delta, Intel Paragon are trade- marks of Intel Corp oration.
    [Show full text]