Files in this item

FilesDescriptionFormat

application/pdf

application/pdfNARAYANAN-THESIS-2020.pdf (938kB)
(no description provided)PDF

Description

Title:Generalizing fine-grained message aggregation
Author(s):Narayanan, Venkatasubrahmanian
Advisor(s):Kale, Laxmikant
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(s):Fine-grained parallelism
message aggregation
Abstract:The divergence of application behavior from optimal network usage leads to performance bottlenecks induced by communication. Communication performances are known to worsen when dealing with large quantities of small messages, due to the overhead of envelopes and going through the communication stack multiple times. Prior work has attempted to mitigate this through the aggregration of small messages, but it has only studied the impact for cases where the size of the message is constant and known ahead of time. This thesis explores the applicability of this optimization to variable-sized messages and machines with a large number of cores, analyzing both the theoretical considerations involved and the performance gains achieved in practice. The work is implemented as an update to the Topological Routing and Aggregation Module(TRAM) of the Charm++ parallel programming system.
Issue Date:2020-05-15
Type:Thesis
URI:http://hdl.handle.net/2142/108060
Rights Information:Copyright 2020 Venkatasubrahmanian Narayanan
Date Available in IDEALS:2020-08-26
Date Deposited:2020-05


This item appears in the following Collection(s)

Item Statistics