Effective use of shared memory multiprocessors
Conference
·
OSTI ID:5255016
We consider two application codes as case studies for the performance of shared memory multiprocessors. The first code is a packet switched network simulator, the second implements a new Monte Carlo algorithm for line transport. The codes are written in a portable parallel extension of the C programming language that can be compiled and executed on several shared memory multiprocessors, and that can be compiled into efficient serial code on any uniprocessor. We find that the latest crop of cost effective shared memory multiprocessors, when effectively used as multiprocessors on a single application, can exceed the performance of a well known supercomputer. 12 refs., 3 figs.
- Research Organization:
- Lawrence Livermore National Lab., CA (USA)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 5255016
- Report Number(s):
- UCRL-98211; CONF-880567-3; ON: DE88007019
- Country of Publication:
- United States
- Language:
- English
Similar Records
Memory access dependencies in shared-memory multiprocessors
Dynamic Program Phase Detection in Distributed Shared-Memory Multiprocessors
SISAL 1. 2: An alternative to FORTRAN for shared memory multiprocessors
Journal Article
·
Fri Jun 01 00:00:00 EDT 1990
· IEEE (Institute of Electrical and Electronics Engineers) Transactions on Software Engineering; (USA)
·
OSTI ID:6411036
Dynamic Program Phase Detection in Distributed Shared-Memory Multiprocessors
Conference
·
Sun Mar 05 23:00:00 EST 2006
·
OSTI ID:894326
SISAL 1. 2: An alternative to FORTRAN for shared memory multiprocessors
Conference
·
Sun Nov 19 23:00:00 EST 1989
·
OSTI ID:7020404