Optimal Matrix Partitioning for Data Parallel Computing on Hybrid Heterogeneous Platforms

In this paper, we study the problem of partitioning a matrix over a small number of interconnected heterogeneous processors. This problem is crucial for data parallel dense linear algebra and other applications with similar communication patterns on modern hybrid servers, integrating several heterog...

Full description

Saved in:
Bibliographic Details
Published in2020 19th International Symposium on Parallel and Distributed Computing (ISPDC) pp. 1 - 11
Main Authors Malik, Tania, Lastovetsky, Alexey
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2020
Subjects
Online AccessGet full text
DOI10.1109/ISPDC51135.2020.00011

Cover

Abstract In this paper, we study the problem of partitioning a matrix over a small number of interconnected heterogeneous processors. This problem is crucial for data parallel dense linear algebra and other applications with similar communication patterns on modern hybrid servers, integrating several heterogeneous compute devices such as CPUs, GPUs and other accelerators. The objective is to balance the load of the heterogeneous devices while minimising the communication cost. While the problem has been solved for the case of two processors, it is still open for three and more processors. The state-of-the-art solution for the case of three processors uses a communication cost function, which does not accurately account for the total amount of data moved between processors and therefore leaves the question of its global optimality open. In this work, we propose a cost function, which accurately represents the total amount of data moved between processors. Then, we formulate and solve the problem of optimal partitioning of a square computational domain, using this accurate communication cost function. Finally, we propose and implement an original experimental methodology for accurate measurement of the communication time of parallel applications on hybrid heterogeneous servers, integrating multi-core CPUs and various accelerators. We apply this methodology to experimental validation of our mathematical result.
AbstractList In this paper, we study the problem of partitioning a matrix over a small number of interconnected heterogeneous processors. This problem is crucial for data parallel dense linear algebra and other applications with similar communication patterns on modern hybrid servers, integrating several heterogeneous compute devices such as CPUs, GPUs and other accelerators. The objective is to balance the load of the heterogeneous devices while minimising the communication cost. While the problem has been solved for the case of two processors, it is still open for three and more processors. The state-of-the-art solution for the case of three processors uses a communication cost function, which does not accurately account for the total amount of data moved between processors and therefore leaves the question of its global optimality open. In this work, we propose a cost function, which accurately represents the total amount of data moved between processors. Then, we formulate and solve the problem of optimal partitioning of a square computational domain, using this accurate communication cost function. Finally, we propose and implement an original experimental methodology for accurate measurement of the communication time of parallel applications on hybrid heterogeneous servers, integrating multi-core CPUs and various accelerators. We apply this methodology to experimental validation of our mathematical result.
Author Malik, Tania
Lastovetsky, Alexey
Author_xml – sequence: 1
  givenname: Tania
  surname: Malik
  fullname: Malik, Tania
  organization: School of Computer Science (UCD),Dublin,Ireland
– sequence: 2
  givenname: Alexey
  surname: Lastovetsky
  fullname: Lastovetsky, Alexey
  organization: School of Computer Science (UCD),Dublin,Ireland
BookMark eNotj1FLwzAUhSPog5v-AhHyB1pvkrZJHqVTN5isoD74NG7a2xHompFm4P69G_p04HycD86MXY9hJMYeBeRCgH1afTSLuhRClbkECTkACHHFZkJLI4wtKnnLvjeH5Pc48HdM0f_wBmPyyYfRjzveh8gXmPDS4jDQwOuwPxzThYWRL08u-o4vKVEMOxopHCfeDJjOu_10x256HCa6_885-3p9-ayX2Xrztqqf15mXoFKmgBSgxsKQkU61pStdK4xx1iJQgU5j63Qv-8poKqgTrcGy6AgqabQlVHP28Of1RLQ9xPObeNpaCUJrq34BGH9REA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ISPDC51135.2020.00011
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 Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1728189462
9781728189468
EndPage 11
ExternalDocumentID 9201779
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i203t-30e30a7a48e82b3c5b5bc188b99a0e4ab7acb7f2f687e4ed1c8a54de062879ea3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:38:54 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-30e30a7a48e82b3c5b5bc188b99a0e4ab7acb7f2f687e4ed1c8a54de062879ea3
PageCount 11
ParticipantIDs ieee_primary_9201779
PublicationCentury 2000
PublicationDate 2020-July
PublicationDateYYYYMMDD 2020-07-01
PublicationDate_xml – month: 07
  year: 2020
  text: 2020-July
PublicationDecade 2020
PublicationTitle 2020 19th International Symposium on Parallel and Distributed Computing (ISPDC)
PublicationTitleAbbrev ISPDC
PublicationYear 2020
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.7519246
Snippet In this paper, we study the problem of partitioning a matrix over a small number of interconnected heterogeneous processors. This problem is crucial for data...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Approximation algorithms
communication optimization
Computational modeling
Cost function
data parallelism
data partitioning
heterogeneous platforms
hybrid platforms
Matrix multiplication
non-rectangular partitioning
optimal partitioning
Partitioning algorithms
Program processors
Shape
Title Optimal Matrix Partitioning for Data Parallel Computing on Hybrid Heterogeneous Platforms
URI https://ieeexplore.ieee.org/document/9201779
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PS8MwGA1zJ08qm_ibHDzaLW2aJTlvjipMCzqYp5GkX0CcrbgW1L_epK1TxIOXEFJCQ5LyvibvfQ-hc6lt5qBABw5rWRA7kAiE1CQIDaWR4lrY0AucZzejZB5fL9iigy42WhgAqMlnMPDV-i4_K0zlj8qG0qEV53ILbbmy0Wq1opyQyOHVXToZu_iBMvfbF3nGFvG-QD9MU2rMmO6g2dfbGqrI06Aq9cB8_ErE-N_h7KL-tzoPpxvc2UMdyHvo4dZ9-89qhWc-5_4bTv2WaA9bsQtM8USVyrd675QVbswc_LMix8m7l23hxDNjCrehoKjWOF2p0ge06z6aTy_vx0nQ2iYEjxGhZUAJUKK4igWISFPDNNMmFEJLqQjESnNlNLeRHQkOMWShEYrFGXg1JZeg6D7q5kUOBwjLkYyJsMyCclBureaj2PUyETBgYZYdop6fluVLkxlj2c7I0d_Nx2jbL0xDdj1B3fK1glMH6aU-q9fyE9fApGM
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PS8MwGA06D3pS2cTf5uDRbumPNMl5c3S6zoIbzNNI2q8gzlZcC-pfb9LWKeLBW0gILflS3pf0ve8hdClUmmgoUJbGWmp5GiQsLhSx7Nh1HckUT20jcA4nfjDzbuZ0voGu1loYAKjIZ9A1zepffpLHpbkq6wmNVoyJTbRF9amC1WqtRpZjE9Eb3UeDvs4gXKoPfo7hbBHjDPTDNqVCjeEuCr-eV5NFnrplobrxx69SjP99oT3U-dbn4WiNPPtoA7I2erjTX_-zXOLQVN1_w5HZFM11K9apKR7IQppe456yxLWdgxnLMxy8G-EWDgw3JtdbCvJyhaOlLExKu-qg2fB62g-sxjjBenSIW1guAZdIJj0O3FFuTBVVsc25EkIS8KRiMlYsdVKfM_AgsWMuqZeA0VMyAdI9QK0sz-AQYeELj_CUpiA1mKepYr6nZ8UOUKB2khyhtlmWxUtdG2PRrMjx390XaDuYhuPFeDS5PUE7Jkg19fUUtYrXEs40wBfqvIrrJ6dBp7Q
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=2020+19th+International+Symposium+on+Parallel+and+Distributed+Computing+%28ISPDC%29&rft.atitle=Optimal+Matrix+Partitioning+for+Data+Parallel+Computing+on+Hybrid+Heterogeneous+Platforms&rft.au=Malik%2C+Tania&rft.au=Lastovetsky%2C+Alexey&rft.date=2020-07-01&rft.pub=IEEE&rft.spage=1&rft.epage=11&rft_id=info:doi/10.1109%2FISPDC51135.2020.00011&rft.externalDocID=9201779