Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Comparison of Sequential and Parallel Radix Sort: A Performance Analysis, Study Guides, Projects, Research of Computer Science

This project proposes a comparison between sequential and parallel versions of radix sort. The study aims to determine the conditions under which each algorithm performs better or worse by testing various sizes of random integer arrays. The research will include multiple runs to average results, starting with random data and then experimenting with pre-sorted and other data patterns. Radix sort, a non-comparison sort, has the potential to outperform other parallel sorting methods like merge sort. The project will utilize the most significant digit to split the array into buckets and sort them using the sequential version of radix sort. The results will be presented through graphs, and an analysis will be conducted to understand the reasons behind the findings. If time permits, additional test conditions may be added.

Typology: Study Guides, Projects, Research

Pre 2010

Uploaded on 08/18/2009

koofers-user-yl7
koofers-user-yl7 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSCD$543$Project$Proposal$
$
Darren$Altenhofen$
$
Brief$Summary:$$A$comparison$of$sequential$and$parallel$versions$of$radix$sort.$
$
Description:$$Various$sizes$of$random$integer$arrays$will$be$run$through$sequential$
and$parallel$versions$of$the$algorithm.$$The$goal$is$to$show$which$conditions$the$
algorithm$perform$better$and$worse$to$make$some$conclusions$into$why.$Various$
sizes$of$integer$arrays$will$be$used$and$multiple$runs$will$be$performed$to$average$
results.$$I$will$start$with$random$data,$and$then$experiment$with$pre$sorted$and$
other$data$patterns.$
$
Information:$$Radix$sort$is$not$a$comparison$sort$and$has$potential$to$be$quicker$
than$other$parallel$sorting$methods$such$as$merge$sort.$$For$the$project,$I$will$be$
using$the$most$significant$digit$(left$most$digit)$to$split$the$array$into$different$
“buckets”$based$on$that$digit.$$These$buckets$of$numbers$are$then$sent$out$to$
available$nodes$to$be$sorted$by$the$sequential$version$of$radix$sort$and$returned.$$At$
the$end,$the$buckets$are$concatenated$together$and$we$have$a$sorted$array$of$
integers.$
$ One$challenge$presented$is$accounting$for$the$possible$very$unbalanced$
bucket$sizes.$$I$will$look$into$how$to$create$some$load$balancing$sort$conditions.$
$
Results:$$Graphs$of$the$timing$results$will$present$data$findings.$$Some$analysis$will$
be$done$into$why$I$get$the$results$I$do.$
$
Possible$Expansion:$$If$time$allows,$I$will$possibly$add$more$test$conditions.$
$
$
$
$
$
$
$
Sources$for$picture:$
$
http://en.wikipedia.org/wiki/Radix_sort$

Partial preview of the text

Download Comparison of Sequential and Parallel Radix Sort: A Performance Analysis and more Study Guides, Projects, Research Computer Science in PDF only on Docsity!

CSCD 543 Project Proposal Darren Altenhofen Brief Summary: A comparison of sequential and parallel versions of radix sort. Description: Various sizes of random integer arrays will be run through sequential and parallel versions of the algorithm. The goal is to show which conditions the algorithm perform better and worse to make some conclusions into why. Various sizes of integer arrays will be used and multiple runs will be performed to average results. I will start with random data, and then experiment with pre sorted and other data patterns. Information: Radix sort is not a comparison sort and has potential to be quicker than other parallel sorting methods such as merge sort. For the project, I will be using the most significant digit (left most digit) to split the array into different “buckets” based on that digit. These buckets of numbers are then sent out to available nodes to be sorted by the sequential version of radix sort and returned. At the end, the buckets are concatenated together and we have a sorted array of integers. One challenge presented is accounting for the possible very unbalanced bucket sizes. I will look into how to create some load balancing sort conditions. Results: Graphs of the timing results will present data findings. Some analysis will be done into why I get the results I do. Possible Expansion: If time allows, I will possibly add more test conditions. Sources for picture: http://en.wikipedia.org/wiki/Radix_sort