"A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine" - Information and Links:

A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine - Info and Reading Options

Book's cover
The cover of “A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine” - Google Books.

"A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine" was published by CreateSpace Independent Publishing Platform in 2018, it has 38 pages and the language of the book is English.


“A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine” Metadata:

  • Title: ➤  A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine
  • Language: English
  • Number of Pages: 38
  • Is Family Friendly: Yes - No Mature Content
  • Publisher: ➤  CreateSpace Independent Publishing Platform
  • Publish Date:

Edition Specifications:

  • Weight: 0.150

Edition Identifiers:

AI-generated Review of “A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine”:


Snippets and Summary:

Described here is a very fast algorithm for performing the necessary ranking of the parallel data elements. The performance of the new algorithm is compared with that of the microcoded instruction for ranking on the Connection Machine.

"A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine" Description:

Google Books:

The data parallel implementation of a particle simulation for hypersonic rarefied flow described by Dagum associates a single parallel data element with each particle in the simulation. The simulated space is divided into discrete regions called cells containing a variable and constantly changing number of particles. The implementation requires a global sort of the parallel data elements so as to arrange them in an order that allows immediate access to the information associated with cells in the simulation. Described here is a very fast algorithm for performing the necessary ranking of the parallel data elements. The performance of the new algorithm is compared with that of the microcoded instruction for ranking on the Connection Machine. Dagum, Leonardo Unspecified Center NASA-CR-188903, NAS 1.26:188903, RIACS-TR-89-44 AF-AFOSR-0139-88; NCC2-387; NAGW-965...

Read “A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine”:

Read “A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine” by choosing from the options below.

Search for “A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine” in Libraries Near You:

Read or borrow “A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine” from your local library.

Buy “A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine” online:

Shop for “A Fast Sorting Algorithm for a Hypersonic Rarefied Flow Particle Simulation on the Connection Machine” on popular online marketplaces.