Measurement-Based Performance Models of Numerical Problems on Loosely-Coupled Systems
Rahmeh, Joseph Toufic
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/69419
Description
Title
Measurement-Based Performance Models of Numerical Problems on Loosely-Coupled Systems
Author(s)
Rahmeh, Joseph Toufic
Issue Date
1988
Department of Study
Electrical Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Abstract
Multiprocessor systems offer the potential of significant performance improvements over uniprocessors. Performance evaluation is necessary to effectively utilize these systems and to uncover and remove performance bottlenecks, which prevent the realization of their performance potential. Multiprocessors fall into one of two categories: shared and distributed memory systems. We study the performance of distributed memory, or loosely coupled, systems in the context of iterative numerical problems.
We derive a performance model for a bus-based system and compare the performance predicted by the model to data collected from experiments implemented on a network of workstations connected via a local area network. We show that the effectiveness of such a system is limited by the bandwidth of the bus.
We derive a similar model for the hypercube system and compare it to experimental data collected on the Intel iPSC hypercube. We show that the data downloading and the collection of results reduce the speedup especially for small problem sizes and present schemes to overcome the overheads of data downloading and result collection.
Both the bus and the hypercube models assume contention-free and nearest-neighbor communication. We derive a general (architecture and problem independent) model that includes communication contention and allows for non-nearest neighbor interactions. We show that the performance limiting factors are the communication latency, the communication decomposition, the channel congestion, and the grain size.
Parallel systems are more vulnerable to faults due to their multiplicity of hardware. Algorithm-based fault tolerance has been proposed for low-cost detection of errors and location of faulty processors in distributed computation. In the last part of the thesis, we study the effectiveness of some of the proposed algorithm-based fault tolerance schemes on the hypercube.
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.
