Sitewide Free Shipping - Limited Time Only - No Minimum Spend - T&C's Apply
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $0
Parallel Sorting Algorithms - Selim G. Akl

Parallel Sorting Algorithms

By: Selim G. Akl

eText | 20 June 2014 | Edition Number 1

At a Glance

eText

$89.10

or 4 interest-free payments of $22.27 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionReference, Information & Interdisciplinary SubjectsEncyclopaedias & Reference WorksReference WorksMathematics

More in Reference Works

Spotless A-Z - Jennifer Fleming

eBOOK

Spotless A-Z

eBook

$10.99

The Daring Book for Girls - Andrea J. Buchanan

eBOOK

The Daring Book for Girls

eBook

RRP $35.99

$28.99

19%
OFF

This product is categorised by