The Risks Digest Index to Volume 11
Total Page：16
File Type：pdf, Size：1020Kb
Load more
Recommended publications
-
Emerging Technologies Multi/Parallel Processing
Emerging Technologies Multi/Parallel Processing Mary C. Kulas New Computing Structures Strategic Relations Group December 1987 For Internal Use Only Copyright @ 1987 by Digital Equipment Corporation. Printed in U.S.A. The information contained herein is confidential and proprietary. It is the property of Digital Equipment Corporation and shall not be reproduced or' copied in whole or in part without written permission. This is an unpublished work protected under the Federal copyright laws. The following are trademarks of Digital Equipment Corporation, Maynard, MA 01754. DECpage LN03 This report was produced by Educational Services with DECpage and the LN03 laser printer. Contents Acknowledgments. 1 Abstract. .. 3 Executive Summary. .. 5 I. Analysis . .. 7 A. The Players . .. 9 1. Number and Status . .. 9 2. Funding. .. 10 3. Strategic Alliances. .. 11 4. Sales. .. 13 a. Revenue/Units Installed . .. 13 h. European Sales. .. 14 B. The Product. .. 15 1. CPUs. .. 15 2. Chip . .. 15 3. Bus. .. 15 4. Vector Processing . .. 16 5. Operating System . .. 16 6. Languages. .. 17 7. Third-Party Applications . .. 18 8. Pricing. .. 18 C. ~BM and Other Major Computer Companies. .. 19 D. Why Success? Why Failure? . .. 21 E. Future Directions. .. 25 II. Company/Product Profiles. .. 27 A. Multi/Parallel Processors . .. 29 1. Alliant . .. 31 2. Astronautics. .. 35 3. Concurrent . .. 37 4. Cydrome. .. 41 5. Eastman Kodak. .. 45 6. Elxsi . .. 47 Contents iii 7. Encore ............... 51 8. Flexible . ... 55 9. Floating Point Systems - M64line ................... 59 10. International Parallel ........................... 61 11. Loral .................................... 63 12. Masscomp ................................. 65 13. Meiko .................................... 67 14. Multiflow. ~ ................................ 69 15. Sequent................................... 71 B. Massively Parallel . 75 1. Ametek.................................... 77 2. Bolt Beranek & Newman Advanced Computers ........... -
Some Performance Comparisons for a Fluid Dynamics Code
NBSIR 87-3638 Some Performance Comparisons for a Fluid Dynamics Code Daniel W. Lozier Ronald G. Rehm U.S. DEPARTMENT OF COMMERCE National Bureau of Standards National Engineering Laboratory Center for Applied Mathematics Gaithersburg, MD 20899 September 1987 U.S. DEPARTMENT OF COMMERCE NATIONAL BUREAU OF STANDARDS NBSIR 87-3638 SOME PERFORMANCE COMPARISONS FOR A FLUID DYNAMICS CODE Daniel W. Lozier Ronald G. Rehm U.S. DEPARTMENT OF COMMERCE National Bureau of Standards National Engineering Laboratory Center for Applied Mathematics Gaithersburg, MD 20899 September 1987 U.S. DEPARTMENT OF COMMERCE, Clarence J. Brown, Acting Secretary NATIONAL BUREAU OF STANDARDS, Ernest Ambler, Director - 2 - 2. BENCHMARK PROBLEM In this section we describe briefly the source of the benchmark problem, the major logical structure of the Fortran program, and the parameters of three different specific instances of the benchmark problem that vary widely in the amount of time and memory required for execution. Research Background As stated in the introduction, our purpose in benchmarking computers is solely in the interest of further- ing our investigations into fundamental problems of fire science. Over a decade ago, stimulated by federal recognition of very large losses of fife and property by fires each year throughout the nation, NBS became actively involved in a national effort to reduce such losses. The work at NBS ranges from very practical to quite theoretical; our approach, which proceeds directly from basic principles, is at the theoretical end of this spectrum. Early work was concentrated on developing a mathematical model of convection arising from a prescribed source of heat in an enclosure, e.g. -
Cisco Unity Express Virtual 9.0 COSI Licences
Open Source Used In Cisco Unity Express Virtual 9.0 Cisco Systems, Inc. www.cisco.com Cisco has more than 200 offices worldwide. Addresses, phone numbers, and fax numbers are listed on the Cisco website at www.cisco.com/go/offices. Text Part Number: 78EE117C99-133317509 Open Source Used In Cisco Unity Express Virtual 9.0 1 This document contains licenses and notices for open source software used in this product. With respect to the free/open source software listed in this document, if you have any questions or wish to receive a copy of any source code to which you may be entitled under the applicable free/open source license(s) (such as the GNU Lesser/General Public License), please contact us at [email protected]. In your requests please include the following reference number 78EE117C99-133317509 Contents 1.1 Activation 1.1 1.1 1.1.1 Available under license 1.2 Apache Commons Collections 3.1 1.2.1 Available under license 1.3 Apache Commons Digester 1.8.1 1.3.1 Available under license 1.4 Apache Commons Logging 1.1. 1.4.1 Available under license 1.5 Apache Xerces 1.4.4 1.5.1 Notifications 1.5.2 Available under license 1.6 apache-log4j 1.2.15 1.6.1 Available under license 1.7 apache-xerces 2.9.1 1.7.1 Available under license 1.8 ASM 3.1 1.8.1 Available under license 1.9 bash 2.05b 1.9.1 Available under license 1.10 BCEL 5.1 1.10.1 Notifications 1.10.2 Available under license 1.11 bcprov-jdk14 1.21 1.11.1 Available under license 1.12 beepcore 0.9.08 1.12.1 Notifications Open Source Used In Cisco Unity Express Virtual -
Programming Languages & Tools
I PROGRAMMING LANGUAGES & TOOLS Volume 10 Number 1 1998 Editorial The Digital Technicaljoumalis a refereed AlphaServer, Compaq, tl1e Compaq logo, jane C. Blake, Managing Editor journal published quarterly by Compaq DEC, DIGITAL, tl1e DIGITAL logo, 550 ULTIUX, Kathleen M. Stetson, Editor Computer Corporation, King Street, VAX,and VMS are registered 01460-1289. Hden L. Patterson, Editor LKGI-2jW7, Littleton, MA in the U.S. Patent and Trademark Office. Hard-copy subscriptions can be ordered by DIGITAL UNIX, FX132, and OpenVMS Circulation sending a check in U.S. funds (made payable arc trademarks of Compaq Computer Kristine M. Lowe, Administrator to Compaq Computer Corporation) to the Corporation. published-by address. General subscription Production rates arc $40.00 (non-U.S. $60) for four issues Intel and Pentium are registered u·ademarks $75.00 $115) Christa W. Jessica, Production Editor and (non-U.S. for eight issues. of Intel Corporation. University and college professors and Ph.D. Elizabeth McGrail, Typographer I lUX is a registered trademark of Silicon students in the elecu·icaJ engineering and com Peter R. Woodbury, Illustrator Graphics, Inc. puter science fields receive complimentary sub scriptions upon request. Compaq customers Microsoft, Visual C++, Windows, and Advisory Board may qualify tor giftsubscriptions and arc encour Windows NT are registered trademarks Thomas F. Gannon, Chairman (Acting) aged to contact tl1eir sales representatives. of Microsoft Corporation. Scott E. Cutler Donald Z. Harbert Electronic subscriptions are available at MIPS is a registered trademark of MIPS William A. Laing no charge by accessing URL Technologies, Inc. Richard F. Lary http:jjwww.digital.com/subscription. -
COMPUTATIONAL FLUID DYNAMICS: an Applications Profile from Convex Computer Corporation
COMPUTATIONAL FLUID DYNAMICS: An Applications Profile from Convex Computer Corporation This simulation. which is based on a Navier-Stokes analysis. depicts surface This simulation shows surface pressure predictions for the AV-88 Harrier II pressure predictions for the F-15 Eagle at Mach 0.9. forebody at Mach 0.8. Supercomputer simulations permit the engineer to observe phenomena that The AV-88 Harrier II can operate from small. unprepared sites and roads close wind tunnels cannot produce. to front Jines. Supercomputing performance brings large-scale simula effective resource for innovation, evaluation and enhancement tions into the aircraft designers repertoire. While not expected of aircraft design. to replace such traditional design tools as wind tunnels and test Design development using supercomputing simulation pro fiights, computer simulations offer the manufacturer a cost- ceeds from a systematic knowledge base rather than from conjecture or surmise. At the same time, computer simulation investigating the possibilities, MCAIR selected the Convex Cl, the increases the scope for design innovation and enhancement. first affordable supercomputer Its strong price/performance ratio The use of simulations makes iterative design experimentation proved decisive. cost-effective. Moreover, si mulations point the way to improve The Cl combines memory and vector processing capabilities ments in design. previously found only on large-scale supercomputers with the Supercomputer simulations also permit software and price advantages of minicom the engineer to obseNe details of fluid flow puters. MCAIR found that the Cl completed phenomena that wind tunnels cannot pro in 30 minutes runs that required hours on a duce. These include surface pressure dis "Computational fluid minicomputer tr i bu ti on s, shock wave locations and dynamics is more complex for Installed in September 1985, this 64-bit strengths, streamline paths and boundary military aircraft than for integrated scalar and vector processor with a layer behavior. -
Certification and Benchmarking of AIPS on the Convex
AIPS MEMO NO. _ 3 £ Certifioation and Benchmarking of AIPS on the Convex C-l and Alliant FX/8 Kerry C. Hilldrup, Donald C. Wells, William D. Cotton National Radio Astronomy Observatory [1] Edgemont Road, Charlottesville, VA 22903-2475 (804)296-0211, FTS=938-1271, TWX=910-997-0174 24 December 1985 [2] Abstract The 15APR85 release of AIPS has been installed on the Convex C-l vector computer and on the Alliant FX/8 vector/concurrent computer. Both have been certified using the PFT benchmarking and certification test. Although a small number of compiler bugs were encountered in each, the AIPS application code was installed with only minimal modifications, and computed results agreed well with other implementations of AIPS. In the course of the implementations, the technology of the Clark CLEAN algorithm was advanced considerably; the final vectorized CLEAN algorithm on both systems is about three times as fast as the current microcode algorithm on the FPS AP-120B array processor. Similar improvements were observed for other highly vectorized tasks. Programs which were not vectorized generally executed on both in comparable CPU times and faster real times than they achieved on the DEC VAX-8600. The FX/8 with 6 computational elements (CEs) generally outperformed the C-l by a little in CPU time, but was significantly slower in real time. The performance of the FX/8 as a function of the number of CEs is also described. [1] NRAO is operated by Associated Universities, Inc., under contract with the U. S. National Science Foundation. [2] this report entirely supersedes and replaces a previous version which was dated 18 July 1985 and was marked as "AIPS Memo No. -
Name Server Operations Guide for BIND Release 4.9.5
Name Server Operations Guide for BIND Release 4.9.5 Releases from 4.9 Paul Vixie1 <[email protected]> Internet Software Consortium La Honda, CA Releases through 4.8.3 Kevin J. Dunlap2 Michael J. Karels Computer Systems Research Group Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720 1. Introduction The Berkeley Internet Name Domain (BIND) implements an Internet name server for BSD-derived operating systems. The BIND consists of a server (or ‘‘daemon’’) called named and a resolver library. A name server is a network service that enables clients to name resources or objects and share this information with other objects in the network. This in effect is a distributed data base system for objects in a computer network. The BIND server runs in the background, servicing queries on a well known network port. The standard port for UDP and TCP is specified in /etc/services. The resolver is a set of routines residing in a system library that provides the interface that programs can use to access the domain name services. BIND is fully integrated into BSD (4.3 and later releases) network programs for use in storing and retrieving host names and address. The system administrator can configure the system to use BIND 1 This author was employed by Digital Equipment Corporation’s Network Systems Laboratory during the development and re- lease of BIND 4.9. Release 4.9.2 was sponsored by Vixie Enterprises. Releases from 4.9.3 were sponsored by the Internet Software Consortium. 2 This author was an employee of Digital Equipment Corporation’s ULTRIX Engineering Advanced Development Group and was on loan to CSRG when this work was done. -
An Analysis of the Internet Virus of November 1988
With Microscope and Tweezers: An Analysis of the Internet Virus of November 1988 Mark W. Eichin and Jon A. Rochlis Massachusetts Institute of Technology 77 Massachusetts Avenue, E40-311 Cambridge, MA 02139 February 9, 1989 Abstract computer, it attempted to break into other machines on the network. This paper is an analysis of that virus program In early November 1988 the Internet, a collection of net- and of the reaction of the Internet community to the attack. works consisting of 60,000 host computers implementing the TCP/IP protocol suite, was attacked by a virus, a pro- gram which broke into computers on the network and which spread from one machine to another. This paper is a de- tailed analysis of the virus programitself, as well as the re- 1.1 Organization actions of the besieged Internet community. We discuss the structure of the actual program, as well as the strategies the virus used to reproduce itself. We present the chronology In Section 1 we discuss the categorization of the program of events as seen by our team at MIT, one of a handful of which attacked the Internet, the goals of the teams work- groups around the country working to take apart the virus, ing on isolating the virus and the methods they employed, and summarize what the virus did and did not actually do. in an attempt to discover its secrets and to learn the net- In Section 2 we discuss in more detail the strategies it em- work’s vulnerabilities. We describe the lessons that this ployed, the specific attacks it used, and the effective and incident has taught the Internet community and topics for future consideration and resolution. -
Supercomputers: the Amazing Race Gordon Bell November 2014
Supercomputers: The Amazing Race Gordon Bell November 2014 Technical Report MSR-TR-2015-2 Gordon Bell, Researcher Emeritus Microsoft Research, Microsoft Corporation 555 California, 94104 San Francisco, CA Version 1.0 January 2015 1 Submitted to STARS IEEE Global History Network Supercomputers: The Amazing Race Timeline (The top 20 significant events. Constrained for Draft IEEE STARS Article) 1. 1957 Fortran introduced for scientific and technical computing 2. 1960 Univac LARC, IBM Stretch, and Manchester Atlas finish 1956 race to build largest “conceivable” computers 3. 1964 Beginning of Cray Era with CDC 6600 (.48 MFlops) functional parallel units. “No more small computers” –S R Cray. “First super”-G. A. Michael 4. 1964 IBM System/360 announcement. One architecture for commercial & technical use. 5. 1965 Amdahl’s Law defines the difficulty of increasing parallel processing performance based on the fraction of a program that has to be run sequentially. 6. 1976 Cray 1 Vector Processor (26 MF ) Vector data. Sid Karin: “1st Super was the Cray 1” 7. 1982 Caltech Cosmic Cube (4 node, 64 node in 1983) Cray 1 cost performance x 50. 8. 1983-93 Billion dollar SCI--Strategic Computing Initiative of DARPA IPTO response to Japanese Fifth Gen. 1990 redirected to supercomputing after failure to achieve AI goals 9. 1982 Cray XMP (1 GF) Cray shared memory vector multiprocessor 10. 1984 NSF Establishes Office of Scientific Computing in response to scientists demand and to counteract the use of VAXen as personal supercomputers 11. 1987 nCUBE (1K computers) achieves 400-600 speedup, Sandia winning first Bell Prize, stimulated Gustafson’s Law of Scalable Speed-Up, Amdahl’s Law Corollary 12. -
Shared Memory Programming on NUMA–Based Clusters Using a General and Open Hybrid Hardware / Software Approach
Shared Memory Programming on NUMA–based Clusters using a General and Open Hybrid Hardware / Software Approach Martin Schulz Institut für Informatik Lehrstuhl für Rechnertechnik und Rechnerorganisation Shared Memory Programming on NUMA–based Clusters using a General and Open Hybrid Hardware / Software Approach Martin Schulz Vollständiger Abdruck der von der Fakultät für Informatik der Technischen Universität München zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) genehmigten Dissertation. Vorsitzender: Univ.-Prof. R. Bayer, Ph.D. Prüfer der Dissertation: 1. Univ.-Prof. Dr. A. Bode 2. Univ.-Prof. Dr. H. Hellwagner, Universität Klagenfurt / Österreich Die Dissertation wurde am 24. April 2001 bei der Technischen Universität München ein- gereicht und durch die Fakultät für Informatik am 28. Juni 2001 angenommen. Abstract The widespread use of shared memory programming for High Performance Computing (HPC) is currently hindered by two main factors: the limited scalability of architectures with hardware support for shared memory and the abundance of existing programming models. In order to solve these issues, a comprehensive shared memory framework needs to be created which enables the use of shared memory on top of more scalable architectures and which provides a user–friendly solution to deal with the various different programming models. Driven by the first issue, a large number of so–called SoftWare Distributed Shared Memory (SW–DSM) systems have been developed. These systems rely solely on soft- ware components to create a transparent global virtual memory abstraction on highly scal- able, loosely coupled architectures without any direct hardware support for shared memory. However, they are often affected by inherent performance problems and, in addition, do not solve the second issue of the existence of (too) many shared memory programming models. -
Network Troubleshooting Tools
Network Troubleshooting Tools Network Troubleshooting Tools Joseph D. Sloan Beijing • Cambridge • Farnham • Köln • Paris • Sebastopol • Taipei • Tokyo Network Troubleshooting Tools by Joseph D. Sloan Copyright © 2001 O’Reilly & Associates, Inc. All rights reserved. Printed in the United States of America. Published by O’Reilly & Associates, Inc., 101 Morris Street, Sebastopol, CA 95472. Editors: Robert Denn and Mike Loukides Production Editor: Catherine Morris Cover Designer: Emma Colby Printing History: August 2001: First Edition. Nutshell Handbook, the Nutshell Handbook logo, and the O’Reilly logo are registered trademarks of O’Reilly & Associates, Inc. Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and O’Reilly & Associates, Inc. was aware of a trademark claim, the designations have been printed in caps or initial caps. The association between the image of a basilisk and network troubleshooting is a trademark of O’Reilly & Associates, Inc. While every precaution has been taken in the preparation of this book, the publisher assumes no responsibility for errors or omissions, or for damages resulting from the use of the information contained herein. Library of Congress Cataloging-in-Publication Data Sloan, Joe. Network Troubleshooting Tools / Joe Sloan.--1st ed. p. cm. Includes bibliographical references and index. ISBN 0-596-00186-X 1. Computer networks--Maintenance and repair 2. Computer networks--Management. I. Title. TK5105.5 -
History of the Root Server System
RSSAC023: History of the Root Server System A Report from the ICANN Root Server System Advisory Committee (RSSAC) 4 November 2016 History of the Root Server System Preface This is a report to the Internet community from the ICANN Root Server System Advisory Committee (RSSAC). In this report, the RSSAC gives an overview of the organizational history of the root server system. The RSSAC advises the Internet community and ICANN Board of Directors on matters relating to the operation, administration, security and integrity of the Internet’s Root Server System. The RSSAC’s responsibilities include: • Communicating with the technical and ICANN communities on matters relating to the operation of the root servers and their multiple instances. • Gathering and articulating requirements to offer to those engaged in technical revisions of the protocols and common best practices related to the operation of DNS servers. • Engaging in ongoing threat assessment and risk analysis of the Root Server System. • Recommending necessary audit activity to assess the current status of root servers and the root zone. Contributors to this report are listed at end of this document. 2 RSSAC023 History of the Root Server System Table of Contents 1. Introduction ................................................................................................................. 5 2. History of Root Servers .............................................................................................. 5 2.1. Root Servers in Early Days of the DNS (1983–1986) ........................................ 5 2.2. Expanding Root Service for MILNET and NSFNET (1986–1990) ................... 7 2.3. Expanding Root Service Outside North America (1991) ................................. 10 2.4. DDN-NIC Changes to Network Solutions (1991–1992) .................................. 11 2.5. InterNIC (1993) ................................................................................................ 12 2.6. Renaming Root Servers to root-servers.net (1995) ..........................................