Experimental analysis of data management for distibuted data structures
Totty, Brian Keith
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/95777
Description
Title
Experimental analysis of data management for distibuted data structures
Author(s)
Totty, Brian Keith
Issue Date
1992
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S. (master's)
Degree Level
Thesis
Keyword(s)
Data management
Distributed data structures
Parallel processing
Data communication paradigms
Memory and access latencies
Data organization policies
Language
en
Abstract
"Distributed memory multiprocessor architectures offer enormous computational power, by exploiting the concurrent execution of many loosely connected processors. Because of the low interconnection degree, and partitioned memories, the architectures can scale to arbitrary numbers of processors. We pay a price for this seal.ability. Interface delays and low interconnection bandwidth to the distributed memories make remote memory access inefficient. In order to achieve good performance, we must carefully manage data to reduce the frequency of remote memory accesses. While attempting to increase locality, we cannot allow data management to become such a burden to prevent the creation of sophisticated programs.
This thesis investigates issues pertaining to data management for ""distributed data structures"". A distributed data structure logically extends traditional data structures by incorporating data management mechanisms within the abstraction boundary. The data management policies can be tuned to the particular algorithmic behavior, while hiding the particular details from the end user. This approach has the advantages of performance, flezibility, abstraction, and system independence.
To evaluate the success of data-structure-specific data management we performed an experimental, trace-driven analysis of various management policies on a set of scientific parallel benchmarks. An object-based, data management formulation provided mechanisms for data organization, partition, placement, and access. The organization, partition, and placement policies are similar to the domain decomposition facilities described in the current literature. The access policies are variants of remote access, migration, and coherent caching schemes. The experimental analysis evaluates the success of the data management configurations on individual data structures. The conclusions indicate that data-structure-specific access policies can lead to substantial performance improvement over a single, system-imposed, data management policy. The encapsulation of data management within a· data structure appears to be an appropriate compromise between programming simplicity and practical performance."
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
