Author: Selim G. Akl
Publisher: Academic Press
ISBN: 148326808X
Category : Reference
Languages : en
Pages : 244
Book Description
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the respective primary memories of the computers (random access memory), or in a single shared memory. SIMD processors communicate through an interconnection network or the processors communicate through a common and shared memory. The text also investigates the case of external sorting in which the sequence to be sorted is bigger than the available primary memory. In this case, the algorithms used in external sorting is very similar to those used to describe internal sorting, that is, when the sequence can fit in the primary memory, The book explains that an algorithm can reach its optimum possible operating time for sorting when it is running on a particular set of architecture, depending on a constant multiplicative factor. The text is suitable for computer engineers and scientists interested in parallel algorithms.
Parallel Sorting Algorithms
Author: Selim G. Akl
Publisher: Academic Press
ISBN: 148326808X
Category : Reference
Languages : en
Pages : 244
Book Description
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the respective primary memories of the computers (random access memory), or in a single shared memory. SIMD processors communicate through an interconnection network or the processors communicate through a common and shared memory. The text also investigates the case of external sorting in which the sequence to be sorted is bigger than the available primary memory. In this case, the algorithms used in external sorting is very similar to those used to describe internal sorting, that is, when the sequence can fit in the primary memory, The book explains that an algorithm can reach its optimum possible operating time for sorting when it is running on a particular set of architecture, depending on a constant multiplicative factor. The text is suitable for computer engineers and scientists interested in parallel algorithms.
Publisher: Academic Press
ISBN: 148326808X
Category : Reference
Languages : en
Pages : 244
Book Description
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the respective primary memories of the computers (random access memory), or in a single shared memory. SIMD processors communicate through an interconnection network or the processors communicate through a common and shared memory. The text also investigates the case of external sorting in which the sequence to be sorted is bigger than the available primary memory. In this case, the algorithms used in external sorting is very similar to those used to describe internal sorting, that is, when the sequence can fit in the primary memory, The book explains that an algorithm can reach its optimum possible operating time for sorting when it is running on a particular set of architecture, depending on a constant multiplicative factor. The text is suitable for computer engineers and scientists interested in parallel algorithms.
An Implementation of Parallel Sorting Algorithms
Author: Cheng-tze Steve Chang
Publisher:
ISBN:
Category :
Languages : en
Pages : 182
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 182
Book Description
VLSI Implementation of Parallel Sorting Algorithms
Author: Bijan Tehrani
Publisher:
ISBN:
Category : Parallel processing (Electronic computers)
Languages : en
Pages : 206
Book Description
Publisher:
ISBN:
Category : Parallel processing (Electronic computers)
Languages : en
Pages : 206
Book Description
Implementing Parallel Sorting Algorithms
Author: Jamal Elabed
Publisher:
ISBN:
Category : Ada (Computer program language)
Languages : en
Pages : 156
Book Description
Publisher:
ISBN:
Category : Ada (Computer program language)
Languages : en
Pages : 156
Book Description
A New Parallel Sorting Algorithm and Its Efficient VLSI Implementation
Author: Dey Sujit
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 32
Book Description
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 32
Book Description
Implementation of Parallel Sorting Algorithms on a Transputer Network
Author: Venkatraman U. Calidas
Publisher:
ISBN:
Category : Parallel processing (Electronic computers)
Languages : en
Pages : 160
Book Description
Publisher:
ISBN:
Category : Parallel processing (Electronic computers)
Languages : en
Pages : 160
Book Description
Design, analysis, and implementation of parallel external sorting algorithms
Author: Dina B. Friedland
Publisher:
ISBN:
Category :
Languages : en
Pages : 182
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 182
Book Description
Parallel Algorithms
Author: Henri Casanova
Publisher: CRC Press
ISBN: 1584889462
Category : Computers
Languages : en
Pages : 360
Book Description
Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. The book extract
Publisher: CRC Press
ISBN: 1584889462
Category : Computers
Languages : en
Pages : 360
Book Description
Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. The book extract
Efficient Parallel Implementation of Sorting Algorithms on EPGA
Author: Samer Istambouli
Publisher:
ISBN:
Category : Parallel algorithms
Languages : en
Pages : 74
Book Description
Publisher:
ISBN:
Category : Parallel algorithms
Languages : en
Pages : 74
Book Description
GPU Gems 2
Author: Matt Pharr
Publisher: Addison-Wesley Professional
ISBN: 9780321335593
Category : Computers
Languages : en
Pages : 814
Book Description
More useful techniques, tips, and tricks for harnessing the power of the new generation of powerful GPUs.
Publisher: Addison-Wesley Professional
ISBN: 9780321335593
Category : Computers
Languages : en
Pages : 814
Book Description
More useful techniques, tips, and tricks for harnessing the power of the new generation of powerful GPUs.