An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes

IEEE Transactions on Computers - United States
doi 10.1109/tc.1983.1676217
Full Text
Abstract

Available in full text

Date
Authors

Unknown

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

GPU Matrix Sort (An Efficient Implementation of Merge Sort)

International Journal of Computer Applications
2014English

Cycle With Parallel Chords Are Odd Even Graceful

International Journal of Innovative Technology and Exploring Engineering
Mechanics of MaterialsElectronic EngineeringCivilStructural EngineeringElectricalComputer Science
2019English

Area-Efficient VLSI Implementation for Parallel Linear-Phase FIR Digital Filters of Odd Length Based on Fast FIR Algorithm

IOSR Journal of Electrical and Electronics Engineering
2013English

An Efficient Parallel Algorithm for Planarity

1986English

An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2000English

A Heapify Based Parallel Sorting Algorithm

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2008English

Efficient Parallel Implementation of Active Appearance Model Fitting Algorithm on GPU

The Scientific World Journal
BiochemistryMedicineGeneticsMolecular BiologyEnvironmental Science
2014English

An Efficient FPGA Implementation of AES Algorithm

International Journal of Engineering Research and
2016English

Strategies for Stable Merge Sorting

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy