Find results with:

Add another field

Search by date

to

Searching collections:

Dartmouth Dissertations

Add or remove collections

Home Dartmouth Dissertations Page 1

Reference URL

To link to the entire object, paste this link in email, IM or document

To embed the entire object, paste this HTML in website

To link to this page, paste this link in email, IM or document

To embed this page, paste this HTML in website

Parallel out-of-core sorting: the third way.

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Back to top

Powered by CONTENTdm®

Call No.	Ph.D. 2003
Author	Chaudhry, Geeta.
Title	Parallel out-of-core sorting: the third way.
Date	2003
Abstract	Sorting very large datasets is a key subroutine in almost any application that is built on top of a large database. Two ways to sort out-of-core data dominate the literature: merging-based algorithms and partitioning-based algorithms. Within these two paradigms, all the programs that sort out-of-core data on a cluster rely on assumptions about the input distribution. We propose a third way of out-of-core sorting: oblivious algorithms. In all, we have developed six programs that sort out-of-core data on a cluster. The first three programs, based completely on Leighton's columnsort algorithm, have a restriction on the maximum problem size that they can sort. The other three programs relax this restriction two are based on our original algorithmic extensions to columnsort. We present experimental results to show that our algorithms perform well. To the best of our knowledge, the programs presented in this thesis are the first to sort out-of-core data on a cluster without making any simplifying assumptions about the distribution of the data to be sorted.
Description	ix, 149 leaves : ill. 28 cm.
Format	application/pdf
Advisor	Thomas H. Cormen
Subject	Sorting (Electronic computers). Parallel processing (Electronic computers). Computer algorithms.
College	Dartmouth College -- Department of Computer Science.
Issuing Body	Dartmouth Dissertations are made available through the Dartmouth Digital Library.
Degree	Thesis (Ph.D.)--Dartmouth College.
Copyright	All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means without permission in writing from the author.
DOI	http://dx.doi.org/10.1349/ddlp.29

Title	Page 1
Format	application/pdf
Issuing Body	Dartmouth Dissertations are made available through the Dartmouth Digital Library.
Degree	Thesis (Ph.D.)--Dartmouth College.
Full Text	Parallel Out-of-Core Sorting: The ThirdWay A Thesis Submitted to the Faculty in partial ful llment of the requirements for the degree of Doctor of Philosophy in Computer Science by Geeta Chaudhry DARTMOUTH COLLEGE Hanover, New Hampshire March 12th, 2004 Examining Committee: (chair) Thomas H. Cormen Doug McIlroy Bill McKeeman Lars Arge Carol Folt Dean of Graduate Students

	All
	Pages Enter page numbers or page ranges separated by commas. For example: 1,3,5-12

Find results with:

Searching collections:

Home Dartmouth Dissertations Page 1

Parallel out-of-core sorting: the third way.

Page 1

Object Description

Description

Parallel out-of-core sorting: the third way.

Parallel out-of-core sorting: the third way.