On multiprocessor synchronization and data transfer
Su, Hong-Men
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/23597
Description
Title
On multiprocessor synchronization and data transfer
Author(s)
Su, Hong-Men
Issue Date
1992
Doctoral Committee Chair(s)
Yew, Pen-Chung
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
Interprocessor communication has been one of the major overheads in parallel processing. Although synchronization and data transfer are two related activities associated with interprocessor communication, most previous approaches dealt only with synchronization. This thesis studies the issues in interprocessor communication. Experimental data on parallelism of application programs using an oracle-guided simulator confirm the importance of interprocessor communication. Direct communication with static message-passing, which integrates synchronization and data transfer, is proposed as a basic mechanism to implement efficient interprocessor communication on distributed shared memory multiprocessors for critical region synchronization, a family of information dissemination algorithms (such as data spreading and dissemination barriers), and Doacross loops. The mechanism is able to remove three major interprocessor communication overheads, namely, processor stall, remote busy-waiting, and remote reads. Algorithms for the critical region synchronization and information dissemination are given with correctness proofs and timing analysis. Compiler algorithms are proposed to transform sequential loops into Doacross loops using the above mechanism. Also included in this thesis is a Doacross synchronization scheme which can handle complex cross-iteration dependences easily, and is suitable for bus-based systems. Experiments on the proposed schemes and the previous schemes by detailed interpretation-driven simulation are used to show the merits of proposed schemes.
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.
