Design and application of Parsim — a message-passing computer simulator

Access Full Text

Design and application of Parsim — a message-passing computer simulator

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Currently many interconnection networks and parallel algorithms exist for message-passing computers. Users of these machines wish to determine which message-passing computer is best for a given job, and how it will scale with the number of processors and algorithm size. The paper describes a general purpose simulator for message-passing multiprocessors (Parsim), which facilitates system modelling. A structured method for simulator design has been used which gives Parsim the ability to simulate different topologies and algorithm combinations easily. This is illustrated by applying Parsim to a number of algorithms on a variety of topologies. Parsim is then used to predict the performance of the new IBM SP2 parallel computer, with topologies ranging up to 1024 processors.

Inspec keywords: performance evaluation; parallel algorithms; multiprocessing systems; digital simulation; hypercube networks

Other keywords: interconnection networks; system modelling; structured method; performance; parallel algorithms; message-passing multiprocessors; IBM SP2 parallel computer; Parsim; message-passing computer simulator

Subjects: Simulation techniques; Parallel architecture; Multiprocessing systems; Performance evaluation and testing; Multiprocessor interconnection; Parallel programming and algorithm theory

References

    1. 1)
      • J.K. Ousterhout . (1994) Tcl and the Tk toolkit.
    2. 2)
      • J.W. Cooley , J. Turkey . An algorithm for the machine calculation of complex Fourier series. Math. Comput. , 297 - 301
    3. 3)
      • Symons, A., Lakshmi Narasimhan, V.: `Parsim — message-passing computer simulator', Proceedings of the first ICA3PP-95 conference, April 1995, p. 621–630.
    4. 4)
      • M.Y. Wu , D.D. Gajski . Hypertool: A programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Syst. , 3 , 101 - 119
    5. 5)
      • A. Symons , V. Lakshmi Narasimhan , K. Sterzl . Performance analysis of aparallel FFT algorithm on a transputer network. Parallel Alg. Appl.
    6. 6)
      • D. Mitchell . (1990) Inside the transputer.
    7. 7)
      • L. Ni . A survey of wormhole routing techniques in direct networks.. Computer , 2
    8. 8)
      • A. Averbuch , E. Gabber , B. Gordissky , Y. Medan . A parallel FFT on a MIMD machine. Parallel Comput. , 61 - 74
    9. 9)
      • O. Tanir , S. Sevinc . Defining requirements for a standard simulationenvironment. Computer , 2 , 28 - 34
    10. 10)
      • M. Heidemann , D. Johnson , C.S. Burrus . Gauss and the history of the FFT. IEEE Mag.
    11. 11)
      • McMahon, F.H.: `The Livermore fortran kernels: A computer test of thenumerical performance range', UCRL-53745, December 1986.
    12. 12)
      • T. Lewis , H. El-Rewini . Parallax: A tool for parallel program scheduling. IEEE Parallel Distrib. Technol. , 2 , 62 - 72
    13. 13)
      • Yang, T., Gersoulis, A.: `Pyrros: Static task scheduling and code generationfor message-passing multiprocessors.', Proceedings 6th ACM internationalconference on Supercomputing, 1992, ACM PressNew York, p. 428–443, .
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_19970961
Loading

Related content

content/journals/10.1049/ip-cdt_19970961
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading