Linked Data Explorerhttp://worldcat.org/entity/work/id/137139835
Sorting on a mesh-connected parallel computer
Two algorithms are presented for sorting M to the 2nd power elements on an nxn mesh-connected processor array that require O(n) routing and comparison steps. The best previous algorithm takes time O(n log n). The algorithms of this paper are shown to be optimal in time within small constant factors. Extensions to higher-dimensional mesh-connected processor arrays are also given. (Author).
Open All Close All
http://schema.org/about
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/mesh
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/addressing
- http://id.loc.gov/authorities/subjects/sh85029552
- http://id.loc.gov/authorities/subjects/sh85097826
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/data_processing_equipment
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/comparison
- http://id.loc.gov/authorities/subjects/sh85125332
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/routing
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/algorithms
- http://id.worldcat.org/fast/1126867
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/parallel_processors
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/networks
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/computer_hardware
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/computer_systems
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/computer_architecture
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/arrays
- http://id.worldcat.org/fast/1052928
- http://id.worldcat.org/fast/872776
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/sorting_machines
- http://experiment.worldcat.org/entity/work/data/137139835#Topic/sorting
http://schema.org/description
- "Two algorithms are presented for sorting M to the 2nd power elements on an nxn mesh-connected processor array that require O(n) routing and comparison steps. The best previous algorithm takes time O(n log n). The algorithms of this paper are shown to be optimal in time within small constant factors. Extensions to higher-dimensional mesh-connected processor arrays are also given. (Author)."@en