Shared Memory-Aware Latency-Sensitive Message Aggregation for Fine-Grained Communication

Message aggregation is widely used with a goal to reduce communication cost in HPC applications. The difference in the order of overhead of sending a message and cost of per byte transferred motivates the need for message aggregation, for several irregular fine-grained messaging applications like gr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis s. 682 - 687
Hlavní autoři: Chandrasekar, Kavitha, Kale, Laxmikant
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 17.11.2024
Témata:
Charm
Conferences
Costs
Discrete event simulation
High performance computing
Message aggregation
runtime
SMP
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Message aggregation is widely used with a goal to reduce communication cost in HPC applications. The difference in the order of overhead of sending a message and cost of per byte transferred motivates the need for message aggregation, for several irregular fine-grained messaging applications like graph algorithms and parallel discrete event simulation (PDES) . While the benefit of message aggregation is often analyzed in terms of reducing the overhead, specifically the per message cost, we also analyze different schemes that can aid in reducing the message latency, i.e. the time from when a message is sent to the time when it is received. Message latency can affect several applications like PDES with speculative execution where reducing message latency could result in fewer rollbacks. Specifically in our work, we demonstrate the effectiveness of process-aware message aggregation schemes for a range of proxy applications with respect to messaging overhead and latency.
AbstractList Message aggregation is widely used with a goal to reduce communication cost in HPC applications. The difference in the order of overhead of sending a message and cost of per byte transferred motivates the need for message aggregation, for several irregular fine-grained messaging applications like graph algorithms and parallel discrete event simulation (PDES) . While the benefit of message aggregation is often analyzed in terms of reducing the overhead, specifically the per message cost, we also analyze different schemes that can aid in reducing the message latency, i.e. the time from when a message is sent to the time when it is received. Message latency can affect several applications like PDES with speculative execution where reducing message latency could result in fewer rollbacks. Specifically in our work, we demonstrate the effectiveness of process-aware message aggregation schemes for a range of proxy applications with respect to messaging overhead and latency.
Author Kale, Laxmikant
Chandrasekar, Kavitha
Author_xml – sequence: 1
  givenname: Kavitha
  surname: Chandrasekar
  fullname: Chandrasekar, Kavitha
  email: kchndrs2@illinois.edu
  organization: University of Illinois at Urbana-Champaign,Department of Computer Science
– sequence: 2
  givenname: Laxmikant
  surname: Kale
  fullname: Kale, Laxmikant
  email: kale@illinois.edu
  organization: University of Illinois at Urbana-Champaign,Department of Computer Science
BookMark eNotjN1KwzAYQCMoqHNPoBd9gdavSb78XJbiNmHixQZ6N9Lmaw3YVNKq7O0d6tXhcOBcs_M4RmLstoSiLMHe7-oXJbiEggOXBQBYPGNLq60RCAIRpbhky2kKDShAI8HgFXvdvblEPnuiYUzHvPo-WbZ1M8X2mO8oTmEOX3TK0-R6yqq-T9S7OYwx68aUrUKkfJ3cCT6rx2H4jKH9zTfsonPvEy3_uWD71cO-3uTb5_VjXW1zx1HNeYNl54QHZzRqsK1R1vm21UKC184ozQ0YsoIkOu25QtXxxpOExivhpViwu79tIKLDRwqDS8dDCYaDRhQ_XKJTIA
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SCW63240.2024.00095
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350355543
EndPage 687
ExternalDocumentID 10820755
Genre orig-research
GroupedDBID 6IE
6IL
ACM
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIL
ID FETCH-LOGICAL-a256t-b51fa3d0a875709c869adcc7340d7a8672808e93e45a7d2656f2bde40bd63d43
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001451792300073&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 01:59:32 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a256t-b51fa3d0a875709c869adcc7340d7a8672808e93e45a7d2656f2bde40bd63d43
PageCount 6
ParticipantIDs ieee_primary_10820755
PublicationCentury 2000
PublicationDate 2024-Nov.-17
PublicationDateYYYYMMDD 2024-11-17
PublicationDate_xml – month: 11
  year: 2024
  text: 2024-Nov.-17
  day: 17
PublicationDecade 2020
PublicationTitle SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis
PublicationTitleAbbrev SC-W
PublicationYear 2024
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib060584085
Score 1.8894268
Snippet Message aggregation is widely used with a goal to reduce communication cost in HPC applications. The difference in the order of overhead of sending a message...
SourceID ieee
SourceType Publisher
StartPage 682
SubjectTerms Charm
Conferences
Costs
Discrete event simulation
High performance computing
Message aggregation
runtime
SMP
Title Shared Memory-Aware Latency-Sensitive Message Aggregation for Fine-Grained Communication
URI https://ieeexplore.ieee.org/document/10820755
WOSCitedRecordID wos001451792300073&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV25TgMxELVIREEFiCBuuaA12Ht5XUYRgQKiSIlEusjHbESToFwof8-Ms-EoKOj2kHalsdfzZj3vPcZui6RyScidKJwvBCJwJ1xWGRFCrhDdJhaUjWYTutcrRyPTr8nqkQsDALH5DO7oMO7lh5lf0a8y_MIxX-k8b7CG1npL1tpNHtreI7WuWllISXM_6LySGLnEKjAhjWxJJhI_PFRiCuke_vPlR6z1Tcbj_a80c8z2YHrCRiS0DIG_UKPsRrQ_8Iw_WwLAGzGgpnRaxvD2ghrHeHuCZfUkDgJHlMq7iC3FI7lD4DN-cURabNh9GHaeRG2SICyilaVwuapsGqQlZXppfFkYG7zXaSaDtmVB9lMlmBSy3OqQIHyrEhcgky4UacjSU9aczqZwxngpwRjvvJZY9fkKgYRWFiSuQCojM5tz1qKojN-3MhjjXUAu_rh-yQ4o8ETcU_qKNZfzFVyzfb9evi3mN3HwPgEoIJtJ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG4UTfSkRoxve_BabXe72-2REBEjEBJI5Eb6WuIFDA8N_96ZAj4OHrztI9lNOt3ON9v5vo-Q2zwpbeIzy3LrcgYI3DIrS828zwSg28QEYaLZhOp0isFAd9dk9ciFCSHE5rNwh4dxL99P3AJ_lcEXDvlKZdk22cmkTMSKrrWZPrjBh3pda20hwfV9r_6CcuQc6sAEVbI52kj8cFGJSaRx8M_XH5LqNx2Pdr8SzRHZCuNjMkCp5eBpG1tll6z2AWe0ZRACL1kP29JxIYPbM2wdo7URFNajGAYKOJU2AF2yR_SHgGf8YolUSb_x0K832domgRnAK3NmM1Ga1HOD2vRcuyLXxjunUsm9MkWOBlRF0GmQmVE-AQBXJtYHya3PUy_TE1IZT8bhlNCCB62ddYpD3edKgBJKmMBhDRIS7WzOSBVHZfi2EsIYbgbk_I_rN2Sv2W-3hq2nzvMF2ccgII1PqEtSmU8X4Yrsuvf562x6HQP5CWzRnpA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=SC24-W%3A+Workshops+of+the+International+Conference+for+High+Performance+Computing%2C+Networking%2C+Storage+and+Analysis&rft.atitle=Shared+Memory-Aware+Latency-Sensitive+Message+Aggregation+for+Fine-Grained+Communication&rft.au=Chandrasekar%2C+Kavitha&rft.au=Kale%2C+Laxmikant&rft.date=2024-11-17&rft.pub=IEEE&rft.spage=682&rft.epage=687&rft_id=info:doi/10.1109%2FSCW63240.2024.00095&rft.externalDocID=10820755