DOCSLIB.ORG

Thinking Machines

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Thinking Machines High Performance Comput ing IAnd Communications Week I K1N.G COMMUNICATIONS GROUP, INC. 627 National Press Building, Washington, D.C. 20045 (202) 638-4260 Fax: (202) 662-9744 Thursday, July 8,1993 Volume 2, Number 27 Gordon Bell Makes His Case: Get The Feds out Of Computer Architecture BY RICHARD McCORMACK It's an issue that has been simmering, then smolder- Bell: "You've got ing and occasionally flaring up: will the big massively huge forces tellmg parallel machines costing tens of millions of dollars you who's malnl~ne prove themselves worthy of their promise? Or will and how you bu~ld these machines, developed with millions of dollars computers " from the taxpayer, be an embarrassing bust? It's a debate that occurs daily-even with spouses in bed at night-but not much outside of the high- performance computing industry's small borders. Lit- erally thousands of people are engaged in trying to make massive parallelism a viable technology. But there are still few objective observers, very little data, and not enough experience with the big machines to prove-or disprove-their true worth. afraid to talk about [the situation] because they know Interestingly, though, one of the biggest names in they've conned the world and they have to keep lying computing has made up his mind. The MPPs are aw- to support" their assertions that the technology needs ful, and the companies selling them, notably Intel and government support, says the ever-quotable Bell. "It's Thinking Machines, but others as well, are bound to really bad when it turns the scientists into a bunch of fail, says Gordon Bell, whose name is attached to the liars. " most prestigious award in parallel computing. Bell, 58, who sponsors two, $1,000 awards each year These big, massively parallel computers "are crap," for achievement in parallel computing, is a recipient of he says. Worse, "the scientific community is basically rCorr:inued on page 3.' 2 Thursday, July 8, 1993 HPCC WEEK IEEE Picks Gordon Bell Prize Finalists The finalists for the cent, to 7.5 GFhhnillion Laboratory for "45 Giga- Paul Oppenheimer of 1993 Gordon Bell Prize dollars." flops Molecular Dynamics Thinking Machines Corp. for significant achieve- on the Connection for "Parallel Execution of "I want to congratulate Machine 5:" a Fortran 77 Weather ment in parallel processing them on reaching 60 giga- were named last week, and Prediction Model;" flops," says Gordon Bell L. Long and M. Ka- And Cray Research by all indications, the on Tuesday afternoon. mon of Pennsylvania award is growing in popu- for the numerous entries "That's about 50 percent State University and D. that utilized the compa- larity. There were 23 en- of the peak on the [CM-51, Dahl, M. Bromley, R. tries in this year's compe- ny's C90 supercomputer. so that's great.. .The users Lordi, J. Myczkowski and "These entries were too tition, nearly double that are finally getting some- R. Shapiro of Thinking of any previous year. close in overall quality for thing out of the com- Machines Corp. for "A the judges to pick the most Moreover, the perfor- puter." Deterministic Parallel Al- outstanding one, so the gorithm to Solve a Model mance reported by the top Those making the fifth finalist is Cray entry was more than eight Boltzmann Equation;" Research," says the IEEE. award say that the number Robert Means, Bret times that of the previous and quality of the submis- It is the first time that a best, reports the IEEE Wallach and David Busby company has been hon- sions, as well as the in- of HNC Inc. and Robert Computer Society, which creased performance of ored in the Gordon Bell administers the award. Lengel of Tracor Applied Prize competition. thc machines, are "indica- Sciences for "Bispectrum Two entries exceeded 60 tive of the rapid progress For more information, billion floating-point Signal Processing on contact the IEEE's Mari- in the application of paral- HNC's SIMD Numerical operations per second. lel processing to scientific lyn Potes at 714- 821 -8380. "More significantly," Array Processor;" and engineering prob- Gary Sabot, Skef says the IEEE, " 12 entries lems." achieved sustained rates Wholey, Jonas Berlin and exceeding 25 percent of The 1993 finalists are: the theoretical peak per- formance of the machines P.S. Lomdahl, P. they ran on. Tamayo. N. Gronbech- Priceherformance im- Jensen and D.M. Beazley proved by almost 600 per- of Los Alamos National HPCC WEEK Thursday, July 8, 1993 Gomlon Be//Makes His Caser.r (From front, the 1991 National Medal of Technology, awarded to good computers." He goes on to say, however, that it him by President Bush. "Bell has displayed more is "not fair to society to have to fund their learn- vision than any other computer designer in the field, in ing ...as a taxpayer with a growing tax burden, I don't the area of understanding how a particular archi- want to continue this funding." tecture, as yet not created, could address an important It is people like Bell who keep the computer industry set of requirements of a broad community," says the fresh and alive. Larry Smarr, director of the National U.S. Department of Commerce in its Medal of Tech- Center for Supercomputing Applications, describes nology citation. Bell, his former boss at the National Science Founda- Bell sat down with HPCC Week editor Richard tion as "incredibly conflicted." But the computer in- McCormack at his home recently in Los Altos, Calif., dustry itself is "incredibly conflicted." And thank and spoke about where he thinks the industry is goodness; without conflict or chaos there is no creati- headed. While he is not very bullish on the prospects vity or progress. It is what keeps the industry so hea- of those companies making message-passing multi- lthy and vibrant. computers, he does think there will be an explosion in HPCC Week last week shared Gordon Bell's clustered workstations and shared memory computers. thoughts with the executives of Thinking Machines He is particularly fond of Kendall Square Research, a and Intel and asked for their responses, which are pub- company for which he works occasionally as a consul- lished in full. We also interviewed the tant. users of the big new CM-5 at Los Alamos National No doubt, there will be plenty of people who may Laboratory and the Paragon at Oak Ridge National wince when they read Bell's remarks on the inside Laboratory, and will present their stories separately in pages of this publication (including Bell). But he says next week's issue. It should be noted now, however, in a recent paper he has written on government sup- that both users insist their machines are experimental, port of computer companies that "my attack on State and that it is still too early to pass judgment on them. Computers is unfortunately taken as an attack on We invite any of our readers to respond to Bell's people and their organizations. It shouldn't be, be- comments. Call Richard McCormack at 202-662-9721. cause the designers are all bright enough and given Bell can be reached at 415-949-2735. enough time and money will eventually learn to design .% Question: You've become an outspoken critic of DAR- Fine. These are all bright people and given enough PA's computing program. Yet money, bright people can be educated or produce there are a number of out- something useful. These people are kindergarten standina DARPA-funded suc- architects, for which we pay a large amount to fund cess stories: SUN, MIPS and the bastards. Silicon Graphics, for instance. I'm not against specialized computers. But when Bell: Those companies are the product of the way to vou're ~uttinga lot of money into it and a lot of people do it. But it isn't 10years ago, because SUN is 1 1 are prosramming and reprogramming it, then you years old now. There are some Al companies started have to think if any of these have any generality to it. in the last decade around Carnegie [Mellon Universi- ty]. But if I were DARPA I would worry about getting Q: So what happens to them? together some good recent success stories. Bell: What happens to basically all the multicom- puter guys is they're all going to get wiped out by 0:Thinking Machines is one. AIM and plain old computers because if you strip the Bell: That's a massive failure because here you've machines down to their bare nothing, sitting there is got $350 to $500 million that has been poured into basically a simple computer and a high-speed switch. that all together, from DARPA, investors and from Guess what? ATM is a high-speed switch. government purchases. If you look at the amount of The only thing that is going to save them is if ATM work output and look at whether any taxes have been doesn't come in very fast or isn't as good. But over returned other than payroll taxes-hey I want these time, plain old switches and plain old computers con- systems to pay back financially -then Thinking nected together just eliminate the special machines. Machines is easy. I just look at the financial return of that and I'd say it was an absolute disaster. Q: Even with the problems of latency and It's a little over 10years old and they haven't paid bandwidth? Bell: There are ATM switches on the market that back. My guess is that lntel is way in the hole on its have the bandwidth and latency of the switches that venture.
Load more

Recommended publications
  • A PARALLEL IMPLEMENTATION of BACKPROPAGATION NEURAL NETWORK on MASPAR MP-1 Faramarz Valafar Purdue University School of Electrical Engineering
    Purdue University Purdue e-Pubs ECE Technical Reports Electrical and Computer Engineering 3-1-1993 A PARALLEL IMPLEMENTATION OF BACKPROPAGATION NEURAL NETWORK ON MASPAR MP-1 Faramarz Valafar Purdue University School of Electrical Engineering Okan K. Ersoy Purdue University School of Electrical Engineering Follow this and additional works at: http://docs.lib.purdue.edu/ecetr Valafar, Faramarz and Ersoy, Okan K., "A PARALLEL IMPLEMENTATION OF BACKPROPAGATION NEURAL NETWORK ON MASPAR MP-1" (1993). ECE Technical Reports. Paper 223. http://docs.lib.purdue.edu/ecetr/223 This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information. TR-EE 93-14 MARCH 1993 A PARALLEL IMPLEMENTATION OF BACKPROPAGATION NEURAL NETWORK ON MASPAR MP-1" Faramarz Valafar Okan K. Ersoy School of Electrical Engineering Purdue University W. Lafayette, IN 47906 - * The hdueUniversity MASPAR MP-1 research is supponed in pan by NSF Parallel InfrasmctureGrant #CDA-9015696. - 2 - ABSTRACT One of the major issues in using artificial neural networks is reducing the training and the testing times. Parallel processing is the most efficient approach for this purpose. In this paper, we explore the parallel implementation of the backpropagation algorithm with and without hidden layers [4][5] on MasPar MP-I. This implementation is based on the SIMD architecture, and uses a backpropagation model which is more exact theoretically than the serial backpropagation model. This results in a smoother convergence to the solution. Most importantly, the processing time is reduced both theoretically and experimentally by the order of 3000, due to architectural and data parallelism of the backpropagation algorithm.
    [Show full text]
  • The Maspar MP-1 As a Computer Arithmetic Laboratory
    Division Computing and Applied Mathematics Laboratory The MasPar MP-1 as a Computer Arithmetic Laboratory M. A. Anuta, D. W. Lozier and P. R. Turner January 1995 U. S. DEPARTMENT OF COMMERCE Technology Administration National Institute of Standards and Technology Gaithersburg, MD 20899 QC N\sr 100 .U56 NO. 5569 1995 NISTIR 5569 The MasPar MP-l as a Computer Arithmetic Laboratory M. A. Anuta D. W. Lozier P. R. Turner U.S. DEPARTMENT OF COMMERCE Technology Administration National Institute of Standards and Technology Applied and Computational Mathematics Division Computing and Applied Mathematics Laboratory Gaithersburg, MD 20899 January 1995 U.S. DEPARTMENT OF COMMERCE Ronald H. Brown, Secretary TECHNOLOGY ADMINISTRATION Mary L. Good, Under Secretary for Technology NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY Arati Prabhakar, Director I I The MasPar MP-1 as a Computer Arithmetic Laboratory Michael A Anuta^ Daniel W Lozier and Peter R Turner^ Abstract This paper describes the use of a massively parallel SIMD computer architecture for the simulation of various forms of computer arithmetic. The particular system used is a DEC/MasPar MP-1 with 4096 processors in a square array. This architecture has many ad\>cmtagesfor such simulations due largely to the simplicity of the individual processors. Arithmetic operations can be spread across the processor array to simulate a hardware chip. Alternatively they may be performed on individual processors to allow simulation of a massively parallel implementation of the arithmetic. Compromises between these extremes permit speed-area trade-offs to be examined. The paper includes a description of the architecture and its features. It then summarizes some of the arithmetic systems which have been, or are to be, implemented.
    [Show full text]
  • The Race Continues
    SLALOM Update: The Race Continues John Gustafson, Diane Rover, Stephen Elbert, and Michael Carter Ames Laboratory DOE, Ames, Iowa Last November, we introduced in these pages a new kind of computer benchmark: a complete scientific problem that scales to the amount of computing power available, and always runs in the same amount of time… one minute. SLALOM assigns no penalty for novelty in language or architecture, and runs on computers as different as an Alliant, a MasPar, an nCUBE, and a Toshiba notebook PC. Since that time, there have been several developments: • The number of computer systems in the list has more than doubled. • The algorithms have improved. • An annual award for SLALOM performance has been announced. • SLALOM is the judge for at least one competitive supercomputer procurement. • The massively-parallel contenders are starting to unseat the low-end Cray computers. • All but a few major scientific computer manufacturers are represented in our report. • Many of the original numbers have improved significantly. Most Wanted List We’re still waiting to hear results for a few major players in supercomputing: Thinking Machines, Convex, MEIKO, and Stardent haven’t sent anything to us, nor have any of their customers. We’d also very much like numbers for the WaveTracer and Active Memory Technology computers. Our Single-Instruction, Multiple Data (SIMD) version has been improved since the last Supercomputing Review article, so the groups working on those machines might want to check it out as a better starting point (see inset). The only IBM mainframe measurements are nonparallel and nonvector, so we expect big improvements to its performance.
    [Show full text]
  • Porting Industrial Codes and Developing Sparse Linear Solvers on Parallel Computers
    Science and Engineering Research Council "The Science and Engineering Research Council does not accept any responsibility for loss or damage arising from the use of information contained in any of its reports or in any communication about its tests or investigations" OCR Output RAL 94-019 Porting Industrial Codes and Developing Sparse Linear Solvers on Parallel Computers Michel J. Daydé 2 and Iain S. Duff ABSTRACT We address the main issues when porting existing codes from serial to parallel computers and when developing portable parallel software on MIMD multiprocessors (shared memory, virtual shared memory, and distributed memory multiprocessors, and networks of computers). We discuss the use of numerical libraries as a way of developing portable and efficient parallel code. We illustrate this by using examples from our experience in porting industrial codes and in designing parallel numerical libraries. We report in some detail on the parallelization of scientific applications coming from Centre National d’Etudes Spatiales and from Aérospatiale, and we illustrate how it is possible to develop portable and efficient numerical software by considering the parallel solution of sparse linear systems of equations. Keywords: industrial codes, sparse matrices, multifrontal, BLAS, PVM, P4, MIMD multiprocessors, networks. AMS(MOS) subject classifications: 65F05, 65F50, 68N99, 68U99. 90C30. Computing Reviews classification: G.4, G.1.3, D.2.7, D.2.10 Computing Reviews General Terms: Algorithms Text from invited lectures given at First International Meeting on Vector and Parallel Processing, Porto, Portugal. 29 September - 1 October, 1993. Part of this work was supported by Aérospatiale, Division Avions, and Centre National d’Etudes Spatiales under contracts 11C05770 and 873/CNES/90/0841/00.
    [Show full text]
  • THE RISE and Fall the 01 BRILLIANT START-UP THAT Some Day We Will Build a Think­ I~Z~~~~~ Thinking Ing Machine
    Company Profile THE RISE and Fall THE 01 BRILLIANT START-UP THAT Some day we will build a think­ I~Z~~~~~ Thinking ing machine. It will be a truly NEVER GRASPED intelligent machine. One that can see and hear and speak. A THE BASICS Mach-Ines machine that will be proud of us. by Gary Taubes -From a Thinking Machines brochure seven 'years a~ter. its The truth is very different. This is the simple proeessors, all of them completing In 19 90 founding, Thlllklllg story of how Thinking Machines got the a single instruction at the same time. To Machines was the market leader in paral­ jump on a hot new market-and then get more speed, more processors would lel supercomputers, with sales of about screwed up, big time. be added. Eventually, so the theory went, $65 million. Not only was the company with enough processors (perhaps billions) protitable; it also, in the words of one IBM ntil W. Daniel Hillis came along, and the right software, a massively paral­ computer scientist, had cornered the mar­ Ucomputers more or less had been de­ lel computer might start acting vaguely . ket "on sex appeal in high-performance signed along the lines of ENIAC. Ifl that human. Whether it would take pride in its computing." Several giants in the com­ machine a single processor complete? in­ creators would remain to be seen. puter industry were seeking a merger or a structions one at a time, in sequence. "Se­ Hillis is what good scientists call a very partnership with the company.
    [Show full text]
  • Analysis of the Maspar MP-1 Architecture Bradley C
    Analysis of the MasPar MP-1 architecture Bradley C. Kuszmaul March 26, 1990 Please don't spread this document around outside of Thinking Machines Corporation. There may be mistakes, which are my fault, and if widely distributed, such mistakes might make Thinking Machines look bad. This analysis is mostly based on a talk given at the MIT VLSI Seminar, March 13, 1990. "VLSI Architecture for a Massively Parallel Computer" Won S. Kim and John Zapisek MasPar Computer Corporation about the MasPar MP-1 computer. Won S. Kim is the processor chip implementor. John Zapisek is the router chip implementor. I have tried to be clear about what is conjecture, and what is 'stated fact'. When I say that something is 'stated fact', I mean that Mr. Kim or Mr. Zapisek said it is true. When I say something is 'conjecture', I mean that I have reverse-engineered from the stated facts to hypothesize about their machine. When I do 'analysis', it is, unless otherwise stated, based on stated-fact. Unless indictated otherwise, the statements in this document are stated-fact. All of the analysis is based on the talk, rather than on other sources of information (i.e., this document is free from the effects of industrial espionage). The processor chip architecture: Each processor chip has 32 4-bit PE's. There are 48 32-bit registers per PE (on chip memory) There are 16K bytes DRAM/PE (off-chip) (64K bytes with 4Mbit DRAM) The PE clock rate is 7Ons (I saw 14Mhz elsewhere) The memory is operated in fast-page mode at 80ns/byte The processors are 'clustered' into 16 PE's per cluster.
    [Show full text]
  • Eigenvalue Computation
    Research Institute for Advanced Computer Science NASA Ames Research Center //v--_p -(/a._ ./_::v33 Efficient, Massively Parallel Eigenvalue Computation Yan Huo Robert Schreiber N94-13921 (NASA-CR-194289) EFFICIENTv HASSIVELY PAKALLEL EIGENVALUE COHPUTATION (Research Inst. for unclas Advanced Computer Science) 17 p G316Z 0185433 // RIACS Technical Report 93.02 January, 1993 Submitted to: International Journal of Supercompuler Applications Efficient, Massively Parallel Eigenvalue Computation Yan Huo Robert Schreiber The Research Institute of Advanced Computer Science is operated by Universities Space Research Association, The American City Building, Suite 311, Columbia, MD 21044, (301) 730-2656 Work reported herein was supported by NASA via Contract NAS 2-13721 between NASA and the Universities Space Research Association (USRA). Work was performed at the Research Institute for Advanced Computer Science (RIACS), NASA Ames Research Center, Moffett Field, CA 94035-1000. Efficient, Massively Parallel Eigenvalue Computation Yan Huo* Robert Schreiber t January 22, 1993 Abstract In numerical simulations of disordered electronic systems, one of the most common ap- proaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. In this paper, we describe an effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD computers, the Maspar MP-1 and MP-2 systems. Results of numerical tests and timings are also presented. "Department of Electrical Engineering, Princeton University, Princeton NJ 08544 IResearch Institute for Advanced Computer Science, MS 230-5, NASA Ames Research Center, Moffett Field, CA 94035-1000. This author's work was supported by the NAS Systems Division and DARPA via Cooperative Agreement NCC 2-387 between NASA and the University Space Research Association (USRA).
    [Show full text]
  • Manycore Parallel Computing with CUDA
    Manycore Parallel Computing with CUDA Mark Harris [email protected] 1 Future Science & Engineering Breakthroughs Hinge on Computing Computational Computational Computational Computational Geoscience Modeling Medicine Physics Computational Computational Computational Image Chemistry Biology Finance Processing © NVIDIA Corporation 2008 2 Faster is not “Just faster” 3 2-3x “Just faster” Do a little more, wait a little less Doesn’t change how you work 4 5-10x “Significant” Worth upgrading Worth rewriting (parts of) your application 5 100x+ “Fundamentally Different” Worth considering a new platform Worth re-architecting your application Makes new applications possible Drives down “time to discovery” Creates fundamental changes in science 6 Parallel Computing with CUDA Enabling new science and engineering By drastically reducing time to discovery Engineering design cycles: from days to minutes, weeks to days Enabling new computer science By reinvigorating research in parallel algorithms, programming models, architecture, compilers, and languages 7 GeForce® TeslaTM Quadro® Entertainment High-Performance Computing Design & Creation © NVIDIA Corporation 2008 8 Wide Developer Acceptance and Success 146X 36X 19X 17X 100X Interactive Ion placement for Transcoding HD Simulation in Astrophysics N- visualization of molecular video stream to Matlab using .mex body simulation volumetric white dynamics H.264 file CUDA function matter simulation connectivity 149X 47X 20X 24X 30X Financial GLAME@lab: An Ultrasound Highly optimized Cmatch exact simulation
    [Show full text]
  • A Massively Parallel MIMD Implemented by SIMD Hardware? H
    Purdue University Purdue e-Pubs ECE Technical Reports Electrical and Computer Engineering 1-1-1992 A Massively Parallel MIMD Implemented by SIMD Hardware? H. G. Dietz Purdue University School of Electrical Engineering W E. Cohen Purdue University School of Electrical Engineering Follow this and additional works at: http://docs.lib.purdue.edu/ecetr Dietz, H. G. and Cohen, W E., "A Massively Parallel MIMD Implemented by SIMD Hardware?" (1992). ECE Technical Reports. Paper 280. http://docs.lib.purdue.edu/ecetr/280 This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information. A Massively Parallel MIMD Implemented by SIMD Hardware? H. G. Dietz WeE. Cohen TR-EE 92-4 January 1992 f This work was supported by the Office of Naval Research (ONR) under grant number N00014-91-J-4013 and by the National Science Foundation (NSF) under award number 9015696-CDA. Massive MIMD Table of Contents 1. Introduction .......................................................................................................................... 1.1. Interpretation Overhead ......................................................................................... 1.2. Indirection .............................................................................................................. 1.3. Enable Masking ..................................................................................................... 1.4. Our Approach ........................................................................................................
    [Show full text]
  • Performance of the Wavelet Decomposition on Massively
    Performance of the Wavelet Decomposition on Massively Parallel Architectures Tarek A. EI-Ghazawi Department of Electrical and Computer Engineering The George Washington University Washington, D.C. 20052 Tel." (202) 994-5905; Fax: (202) 994-0227 [email protected] and Jacqueline Le Moigne Applied Information Science Branch, Code 935 NASA Goddard Space Flight Center Greenbelt, MD 20771 Tel: (301) 286-8723; Fax: (301) 286-1776 lenloigne @ backserv,gs fc,n asa.gov Abstract Traditionally, Fourier Transforms have been utilized for performing signal analysis and representation. But although it is straightforward to reconstruct a signal from its Fourier transform, no local description of the signal is included in its Fourier representation. To alleviate this problem, Windowed Fourier transforms and then Wavelet transforms have been introduced, and it has been proven that wavelets give a better localization than traditional Fourier transforms, as well as a better division of the time- or space-frequency plane than Windowed Fourier transforms. Because of these properties and after the development of several fast algorithms for computing the wavelet representation of any signal, in particular the Multi-Resolution Analysis (MRA) developed by Mallat, wavelet transforms have increasingly been applied to signal analysis problems, especially real-life problems, in which speed is critical. In this paper we present and compare efficient wavelet decomposition algorithms on different parallel architectures. We report and analyze experimental measurements, using NASA remotely sensed images. Results show that our algorithms achieve significant performance gains on current high- performance parallel systems, and meet scientific applications and multimedia requirements. The extensive performance measurements collected over a number of high-performance computer systems have revealed important architectural characteristics of these systems, in relation to the processing demands of the wavelet decomposition of digital images.
    [Show full text]
  • SIMD Systems Programmierung Paralleler Und Verteilter Systeme (PPV)
    SIMD Systems Programmierung Paralleler und Verteilter Systeme (PPV) Sommer 2015 Frank Feinbube, M.Sc., Felix Eberhardt, M.Sc., Prof. Dr. Andreas Polze Computer Classification single vector computer, processor array computer pipeline multiprocessor computer distributed system Programming models - Classification Explicit Creation of parallelism - Coroutines (Modula-2) vs. Implicit - fork & join (cthreads) - Prolog: parallel AND, OR - Vector expressions (FP, APL) - parbegin/parend (Algol 68) - Matrix operations (HPF, Intel Ct) - Processes/Threads (UNIX, Mach, VMS), RPCs - Futures, OpenCL, OpenMP vs. Shared address space Communication - Mutual exclusion primitives Message passing - Similar to sequential programming - send/receive primitives - „ease of use“ - local (private) variables Specification of parallel execution Control parallelism vs. Data parallelism - Simultaneous execution of multiple control flows - Multiple data elements handled simultaneously - Matches MIMD paradigm - Matches SIMD paradigm - Difficult to scale - Single control flow - Easy to scale Control Parallelism Begi Begi n n sequent ial parallel sequent ial En En d d Multiprocessor Systems Symmetric Multiprocessing (SMP) ■ Set of equal processors in one system (more SM-MIMD than SIMD) ■ Processors share access to main memory over one bus □ Demands synchronization and operating system support ■ Today, every SMP application also works on a uniprocessor machine Asymmetric multiprocessing (ASMP) ■ Specialized processors for I/O, interrupt handling or operating system (DEC VAX
    [Show full text]
  • A Massively Parallel MIMD Implemented by SIMD Hardware? H
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Purdue E-Pubs Purdue University Purdue e-Pubs ECE Technical Reports Electrical and Computer Engineering 1-1-1992 A Massively Parallel MIMD Implemented by SIMD Hardware? H. G. Dietz Purdue University School of Electrical Engineering W E. Cohen Purdue University School of Electrical Engineering Follow this and additional works at: http://docs.lib.purdue.edu/ecetr Dietz, H. G. and Cohen, W E., "A Massively Parallel MIMD Implemented by SIMD Hardware?" (1992). ECE Technical Reports. Paper 280. http://docs.lib.purdue.edu/ecetr/280 This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information. A Massively Parallel MIMD Implemented by SIMD Hardware? H. G. Dietz WeE. Cohen TR-EE 92-4 January 1992 f This work was supported by the Office of Naval Research (ONR) under grant number N00014-91-J-4013 and by the National Science Foundation (NSF) under award number 9015696-CDA. Massive MIMD Table of Contents 1. Introduction .......................................................................................................................... 1.1. Interpretation Overhead ......................................................................................... 1.2. Indirection .............................................................................................................. 1.3. Enable Masking ....................................................................................................
    [Show full text]