Sensitivity analysis of database operations : a case study of parallel partition/sorting algorithm
Document Type
Journal article
Source Publication
International Journal of Computers and Applications
Publication Date
1-1-2004
Volume
26
Issue
4
First Page
199
Last Page
206
Keywords
Database operations, Load balance, Parallel sorting algorithms, Sensitivity analysis
Abstract
Many data sets follow certain distribution patterns, such as uniform distribution, normal distribution, and so on. Some algorithms for database operations make use of this distribution knowledge, and they usually perform much better than other algorithms, particularly in parallel computers. However, the distribution characteristics of certain data sets can change from time to time in real-life situations and affect the performance of these algorithms. It is thus important to know the behaviour of these algorithms under imperfect situations. This article presents the sensitivity analysis of a statistical algorithm for database operations when data sets do not follow the assumed distribution pattern. A parallel sorting algorithm designed by the author is used as a case study. This algorithm is for parallel computers with multiple instruction streams, multiple data streams architecture with shared memory.
DOI
10.1080/1206212X.2004.11441743
Print ISSN
1206212X
E-ISSN
19257074
Publisher Statement
Copyright © 2004 Taylor & Francis
Access to external full text or publisher's version may require subscription.
Full-text Version
Publisher’s Version
Language
English
Recommended Citation
Loo, A. (2004). Sensitivity analysis of database operations: A case study of parallel partition/sorting algorithm. International Journal of Computers and Applications, 26(4), 199-206. doi: 10.1080/1206212X.2004.11441743