Cooperative Data Transfer: Fast Message -Passing on Shared-Memory Multiprocessors
Solt, David G.
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/81965
Description
Title
Cooperative Data Transfer: Fast Message -Passing on Shared-Memory Multiprocessors
Author(s)
Solt, David G.
Issue Date
1999
Doctoral Committee Chair(s)
Roy Campbell
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
This work describes and tests eight point-to-point send operations that are implemented using Cooperative Data Transfer. Several global communication operations are also presented that reduce synchronization costs even for small messages. Cooperative Data Transfer performs well on many parallel applications and algorithms, such as sorting, Fast Fourier Transform, Cholesky factorization, and matrix and vector multiplication.
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.
