Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2

One of 1,403 items in the series: Argonne National Laboratory Reports available on this site.
Thumbnail image of item number 1 in: 'Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2'.
Thumbnail image of item number 2 in: 'Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2'.
Thumbnail image of item number 3 in: 'Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2'.
Thumbnail image of item number 4 in: 'Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2'.
Showing 1-4 of 21 pages in this report.

PDF Version Also Available for Download.

Description

One aspect of Argonne research in parallel computing involves the speed and other properties of parallel SDI algorithms. Various algorithms under study have exhibited speedups resulting from parallelization on shared-memory machines. A weapon-target accessibility algorithm called ACCESS exhibited a high degree of inherent parallelism and has been studied on a wide variety of sequential and parallel multiple instruction multiple data (MIMD) machines. To study ACCESS on a massively parallel single instruction multiple data (SIMD) machine architecture, ANL researchers developed a version of ACCESS on a Thinking Machines Corporation 16K processor Connection Machine-2 (CM-2) located at the ACRF. ANL researchers wrote … continued below

Physical Description

vi, 15 p. : ill., charts

Creation Information

Ewing, Thomas F. & Leibfritz, David W. December 1989.

Context

This report is part of the collection entitled: Technical Report Archive and Image Library and was provided by the UNT Libraries Government Documents Department to the UNT Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 48 times. More information about this report can be viewed below.

Who

People and organizations associated with either the creation of this report or its content.

Authors

Originator

Publisher

Audiences

We've identified this report as a primary source within our collections. Researchers, educators, and students may find this report useful in their work.

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

About | Browse this Partner

Contact Us

Corrections Questions

What

Descriptive information to help identify this report. Follow the links below to find similar items on the Digital Library.

Titles

  • Main Title: Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2
  • Added Title: ANL (Series)
  • Added Title: Argonne National Laboratory Report ANL-89/41
  • Series Title: Argonne National Laboratory Reports

Description

One aspect of Argonne research in parallel computing involves the speed and other properties of parallel SDI algorithms. Various algorithms under study have exhibited speedups resulting from parallelization on shared-memory machines. A weapon-target accessibility algorithm called ACCESS exhibited a high degree of inherent parallelism and has been studied on a wide variety of sequential and parallel multiple instruction multiple data (MIMD) machines. To study ACCESS on a massively parallel single instruction multiple data (SIMD) machine architecture, ANL researchers developed a version of ACCESS on a Thinking Machines Corporation 16K processor Connection Machine-2 (CM-2) located at the ACRF. ANL researchers wrote the Connection Machine version of ACCESS in C(*), a version of C by Thinking Machines Corporation with extensions to accommodate SIMD parallelism. Because of the large number of available physical processors and the ability to create virtual processors on the CM-2, the Connection Machine version of ACCESS was able to process an array of 128 x 1024 tasks in parallel. For the data tested, the CM-2 implementation of ACCESS was faster than both the parallel version run on the Alliant FX/8, the Encore Multimax, and the Sequent Balance and the sequential version run on the ANL Cray X-MP/14. For the benchmark ACCESS problem, the CM-2 at ANL with 16K processors achieved a sustained performance of 400 Mflops. On other larger CM-2 machines, the same problem achieved even higher performance: nearly 1600 Mflops on the Los Alamos National Laboratory 64K processor CM-2. %boratory 64K processor CM-2. The investigation has demonstrated that achieving optimal performance requires structuring the code carefully to keep all available processors busy and to reduce disruptive communication on the front-end processor.

Physical Description

vi, 15 p. : ill., charts

Notes

Digitized from microfiche (1).

Some parts of this report may be illegible, depending on the quality of the microfiche.

Language

Item Type

Identifier

Unique identifying numbers for this report in the Digital Library or other systems.

  • OCLC: 879645926
  • SuDoc Number: Y 3.AT 7:22/ANL-89/41
  • Report No.: ANL-89/41
  • Grant Number: W-31-109-Eng-38
  • Archival Resource Key: ark:/67531/metadc282996

Collections

This report is part of the following collection of related materials.

Technical Report Archive and Image Library

The Technical Report Archive & Image Library (TRAIL) identifies, acquires, catalogs, digitizes and provides unrestricted access to U.S. government agency technical reports. The mission of TRAIL is to ensure preservation, discoverability, and persistent open access to government technical publications regardless of form or format.

About | Browse this Collection

What responsibilities do I have when using this report?

Digital Files

When

Dates and time periods associated with this report.

Creation Date

  • December 1989

Added to The UNT Digital Library

  • Aug. 4, 2015, 8:33 a.m.

Usage Statistics

When was this report last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 48
More Statistics

Interact With This Report

Here are some suggestions for what to do next.

Start Reading

Thumbnail image of item number 1 in: 'Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2'.
Thumbnail image of item number 2 in: 'Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2'.
Thumbnail image of item number 3 in: 'Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2'.
Thumbnail image of item number 4 in: 'Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2'.

PDF Version Also Available for Download.

Citations, Rights, Re-Use

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Links for Robots

Helpful links in machine-readable formats.

Archival Resource Key (ARK)

International Image Interoperability Framework (IIIF)

Metadata Formats

Images

URLs

Stats

Ewing, Thomas F. & Leibfritz, David W. Parallelizing the SDI ACCESS Algorithm for the Connection Machine-2, report, December 1989; Argonne, Illinois. (https://digital.library.unt.edu/ark:/67531/metadc282996/: accessed April 19, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; crediting UNT Libraries Government Documents Department.

Back to Top of Screen