Accelerating Messages by Avoiding Copies in an Asynchronous Task-based Programming Model

Task-based programming models promise improved communication performance for irregular, fine-grained, and load imbalanced applications. They do so by relaxing some of the messaging semantics of stricter models and taking advantage of those at the lower-levels of the software stack. For example, whil...

Full description

Saved in:
Bibliographic Details
Published in:2021 IEEE/ACM 6th International Workshop on Extreme Scale Programming Models and Middleware (ESPM2) pp. 10 - 19
Main Authors: Bhat, Nitin, White, Sam, Ramos, Evan, Kale, Laxmikant V.
Format: Conference Proceeding
Language:English
Published: IEEE 01.11.2021
Subjects:
Adaptation models
AMPI
Asynchronous Tasking
Charm
Communication Optimizations
Computational modeling
Parallel Programming
Programming
RDMA
Runtime
Schedules
Semantics
Task analysis
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Task-based programming models promise improved communication performance for irregular, fine-grained, and load imbalanced applications. They do so by relaxing some of the messaging semantics of stricter models and taking advantage of those at the lower-levels of the software stack. For example, while MPI's two-sided communication model guarantees in-order delivery, requires matching sends to receives, and has the user schedule communication, task-based models generally favor the runtime system scheduling all execution based on the dependencies and message deliveries as they happen. The messaging semantics are critical to enabling high performance.In this paper, we build on previous work that added zero copy semantics to Converse/LRTS. We examine the messaging semantics of Charm++ as it relates to large message buffers, identify shortcomings, and define new communication APIs to address them. Our work enables in-place communication semantics in the context of point-to-point messaging, broadcasts, transmission of read-only variables at program startup, and for migration of chares. We showcase the performance of our new communication APIs using benchmarks for Charm++ and Adaptive MPI, which result in nearly 90% latency improvement and 2x lower peak memory usage.
AbstractList Task-based programming models promise improved communication performance for irregular, fine-grained, and load imbalanced applications. They do so by relaxing some of the messaging semantics of stricter models and taking advantage of those at the lower-levels of the software stack. For example, while MPI's two-sided communication model guarantees in-order delivery, requires matching sends to receives, and has the user schedule communication, task-based models generally favor the runtime system scheduling all execution based on the dependencies and message deliveries as they happen. The messaging semantics are critical to enabling high performance.In this paper, we build on previous work that added zero copy semantics to Converse/LRTS. We examine the messaging semantics of Charm++ as it relates to large message buffers, identify shortcomings, and define new communication APIs to address them. Our work enables in-place communication semantics in the context of point-to-point messaging, broadcasts, transmission of read-only variables at program startup, and for migration of chares. We showcase the performance of our new communication APIs using benchmarks for Charm++ and Adaptive MPI, which result in nearly 90% latency improvement and 2x lower peak memory usage.
Author Kale, Laxmikant V.
White, Sam
Ramos, Evan
Bhat, Nitin
Author_xml – sequence: 1
  givenname: Nitin
  surname: Bhat
  fullname: Bhat, Nitin
  email: nitin@hpccharm.com
  organization: Charmworks, Inc.,Urbana,Illinois,USA
– sequence: 2
  givenname: Sam
  surname: White
  fullname: White, Sam
  email: white67@illinois.edu
  organization: University of Illinois at Urbana-Champaign,Department of Computer Science,Urbana,Illinois,USA
– sequence: 3
  givenname: Evan
  surname: Ramos
  fullname: Ramos, Evan
  email: evan@hpccharm.com
  organization: Charmworks, Inc.,Urbana,Illinois,USA
– sequence: 4
  givenname: Laxmikant V.
  surname: Kale
  fullname: Kale, Laxmikant V.
  email: kale@illinois.edu
  organization: Charmworks, Inc.,Urbana,Illinois,USA
BookMark eNotjM1KxDAURiPoQsd5AhHyAq25SZu2y1JGHZjBAbtwNyTNTQ22ydCMQt_e-vNtDt9ZnBty6YNHQu6BpQCseti8HvY8z0omU844pGxZcUHWVVGClHkGkDF2Td7qrsMBJ3V2vqd7jFH1GKmeaf0VnPmRTTi5RTlPlad1nH33PgUfPiNtVfxItIpo6GEK_aTG8bcSDA635MqqIeL6nyvSPm7a5jnZvTxtm3qXOM7EOTFWCJ5xsEKzHI2UttO6zLkBsVxuOqFLVhktQXSgC60sQyG5zDUUylZiRe7-sg4Rj6fJjWqaj5XMgQOIb68hUDI
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ESPM254806.2021.00007
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
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 Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781665411400
1665411406
EndPage 19
ExternalDocumentID 9651211
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i203t-df332421f3b05ed66fcbb852d135ed2dc3b809db613c1b7baf0e36265b17af93
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000765927300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Thu Jun 29 18:37:53 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-df332421f3b05ed66fcbb852d135ed2dc3b809db613c1b7baf0e36265b17af93
PageCount 10
ParticipantIDs ieee_primary_9651211
PublicationCentury 2000
PublicationDate 2021-Nov.
PublicationDateYYYYMMDD 2021-11-01
PublicationDate_xml – month: 11
  year: 2021
  text: 2021-Nov.
PublicationDecade 2020
PublicationTitle 2021 IEEE/ACM 6th International Workshop on Extreme Scale Programming Models and Middleware (ESPM2)
PublicationTitleAbbrev ESPM2
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.7747408
Snippet Task-based programming models promise improved communication performance for irregular, fine-grained, and load imbalanced applications. They do so by relaxing...
SourceID ieee
SourceType Publisher
StartPage 10
SubjectTerms Adaptation models
AMPI
Asynchronous Tasking
Charm
Communication Optimizations
Computational modeling
Parallel Programming
Programming
RDMA
Runtime
Schedules
Semantics
Task analysis
Title Accelerating Messages by Avoiding Copies in an Asynchronous Task-based Programming Model
URI https://ieeexplore.ieee.org/document/9651211
WOSCitedRecordID wos000765927300002&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/eLvHCXMwlV1NawIxEA0qPfTUFi39Jocem5rsmt3NUUTpoYpQD94kn7KUZsVVwX_fTBRLoZfeNkvIwszhzWTnvYfQMwW3beEcMTmVJOC1IkoYRXgP2gsNBJqoM_ueTybFfC6mDfRy4sJYa-PwmX2Fx_gv31R6C1dlXZFxUCRromaeZweu1pGUw6joDj-m4wTky2DyIGFRmfC3aUrEjNHF_752iTo_5Ds8PcHKFWpY30bzvtYBICBdfonH4FuytDVWe9zfVSVsxINqFbpeXHosPe7Xe69B9zY09ngm608CcGXgYBjH-oqngAlOB81Gw9ngjRxNEUiZ0HRDjEuhBmIuVZRbk2VOK1XwxLA0LBOjU1XQEO0A05qpXElHLUjOcMVy6UR6jVq-8vYG4VDIFbkMJUlhWM8ZLjnXIC5vQ3qUyOwtakNQFquD7MXiGI-7v1_fo3OI-oGm94Bam_XWPqIzvduU9fop5uobVZ2XDA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1La8JAEB6sLbSntmjpu3vosVs3j83jKKJYqiI0B2-SfUkoTcREwX_fnSiWQi-9ZcOygZnDN7OZ7_sAnhm6bcfGUBWylFq8FlTESlDuY3shkUBT68yOwskkms3iaQNeDlwYrXU9fKZf8bH-l68Kucarsk4ccFQkO4Jj7vsu27G19rQch8Wd_sd07KKAGc4euE6tTfjbNqVGjcH5_753Ae0f-h2ZHoDlEho6b8GsK6WFCExYviBjdC5Z6JKILeluigw3kl6xtH0vyXKS5qRbbnOJyre2tSdJWn5SBCyFB-NA1ld9CtrgtCEZ9JPekO5tEWjmMq-iynhYBTnGE4xrFQRGChFxVzmeXbpKeiJiNt4WqKUjQpEaplF0hgsnTE3sXUEzL3J9DcSWclGY2qIkUo5vFE85lygvr22CRBzoG2hhUObLnfDFfB-P279fP8HpMBmP5qO3yfsdnGEGdqS9e2hWq7V-gBO5qbJy9Vjn7RtfT5pT
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=2021+IEEE%2FACM+6th+International+Workshop+on+Extreme+Scale+Programming+Models+and+Middleware+%28ESPM2%29&rft.atitle=Accelerating+Messages+by+Avoiding+Copies+in+an+Asynchronous+Task-based+Programming+Model&rft.au=Bhat%2C+Nitin&rft.au=White%2C+Sam&rft.au=Ramos%2C+Evan&rft.au=Kale%2C+Laxmikant+V.&rft.date=2021-11-01&rft.pub=IEEE&rft.spage=10&rft.epage=19&rft_id=info:doi/10.1109%2FESPM254806.2021.00007&rft.externalDocID=9651211