Limited resource scheduling in sparse matrix algorithms

We present analytic models and simulation techniques that describe the performance of the multifrontal method on distributed memory architectures. We focus on particular strategies for partitioning, clustering, and mapping of task nodes to processors in order to minimize the overall parallel executi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Hawaii International Conference on System Sciences, 27th. Vol. 5: Biotechnology Jg. 2; S. 473 - 482
Hauptverfasser: Pozo, Smith
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE Comput. Soc. Press 1994
Schlagworte:
Computation time
Computer performance
Distributed memories
Parallel algorithms
Scheduling
Sparse matrices
ISBN:0818650907, 9780818650901
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We present analytic models and simulation techniques that describe the performance of the multifrontal method on distributed memory architectures. We focus on particular strategies for partitioning, clustering, and mapping of task nodes to processors in order to minimize the overall parallel execution time and minimize communication costs. The performance model has bees used to obtain estimates for the speedups of various engineering and scientific problems, on several distributed architectures. The result is that the available parallelism of these problems is strongly dependent on the sparsity structure of the input matrices.< >
AbstractList We present analytic models and simulation techniques that describe the performance of the multifrontal method on distributed memory architectures. We focus on particular strategies for partitioning, clustering, and mapping of task nodes to processors in order to minimize the overall parallel execution time and minimize communication costs. The performance model has bees used to obtain estimates for the speedups of various engineering and scientific problems, on several distributed architectures. The result is that the available parallelism of these problems is strongly dependent on the sparsity structure of the input matrices.< >
Author Pozo
Smith
Author_xml – sequence: 1
  surname: Pozo
  fullname: Pozo
  organization: Dept. of Comput. Sci., Tennessee Univ., Knoxville, TN, USA
– sequence: 2
  surname: Smith
  fullname: Smith
BookMark eNotj81Kw0AURgdU0NY-gK7mBZLOTzKTWUpQWwi4aPfl5uZOO5KfMpOCvr2F-p3F2R34Fux-nEZi7EWKXErh1pttvdvl0rki1-qKuWMLUcnKlMIJ-8hWKX2L60pllZFPzDZhCDN1PFKaLhGJJzxRd-nDeORh5OkMMREfYI7hh0N_nGKYT0N6Zg8e-kSrfy_Z_uN9X2-y5utzW781WajsnPlOOagQsLRYFR7bDom01IhSG22cgA5QFGXhBWiQprXUelDOogJEQ3rJXm_ZQESHcwwDxN_D7Zn-AwFLR9w
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/HICSS.1994.323236
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
EndPage 482
ExternalDocumentID 323236
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i87t-fd29a8cac57c84fcbdcee313cc1363690adac0454f0a3a16b7ebfa297c2acc6e3
IEDL.DBID RIE
ISBN 0818650907
9780818650901
IngestDate Tue Aug 26 23:27:06 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i87t-fd29a8cac57c84fcbdcee313cc1363690adac0454f0a3a16b7ebfa297c2acc6e3
PageCount 10
ParticipantIDs ieee_primary_323236
PublicationCentury 1900
PublicationDate 19940000
PublicationDateYYYYMMDD 1994-01-01
PublicationDate_xml – year: 1994
  text: 19940000
PublicationDecade 1990
PublicationTitle Hawaii International Conference on System Sciences, 27th. Vol. 5: Biotechnology
PublicationTitleAbbrev HICSS
PublicationYear 1994
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000527261
Score 1.3365242
Snippet We present analytic models and simulation techniques that describe the performance of the multifrontal method on distributed memory architectures. We focus on...
SourceID ieee
SourceType Publisher
StartPage 473
SubjectTerms Computation time
Computer performance
Distributed memories
Parallel algorithms
Scheduling
Sparse matrices
Title Limited resource scheduling in sparse matrix algorithms
URI https://ieeexplore.ieee.org/document/323236
Volume 2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMeDGx48-Wvib3Lw2i0_2vw4D8cEGYMN2W2kr4kWXCddN_zzTdo6Ebx4S0JI8ijJ4730-wlCDwwoscpvpDTRPkARAqJUORY5Q7hhsQRbE_henuVkohYLPW0527UWxlpb_3xm-6FY3-Vna9iGVNmAe_fPRQd1pBSNVGufTiEJkz4YqAmPVAUsHJEtX-e7TttLTUr0YPw0nM2CUi_uN4P-elyl9i2j43-t6gT1fjR6eLr3PqfowBbnSLZ6JVy2WXnsg1fvTILmHOcF9sdHubF4Fbj8n9i8v67LvHpbbXpoPnqcD8dR-zRClCtZRS5j2igwkEhQsYM087NxygEoF9wHvCYzEOB6jhhuqEilTZ1hWgIzAMLyC9Qt1oW9RNgPoKy2TPiDLk6c9r1JqryRTDnwu_8KnQWTlx8N_GLZWHv9Z-sNOmpQwyFDcYu6Vbm1d-gQdlW-Ke_rD_YFQBiU4w
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMeDTkFP_pr42xy8dsuPtknPQ9lwjsGG7DbS10QLrpOuE_98k7ROBC_ekhCSPEryeC_9foLQHQNKtLQbKY0SG6DEMQSpNCwwinDFQgHaE_ieh2I0krNZMm44214Lo7X2P5_pjiv6u_xsCWuXKuty6_55vI12ojBkpBZrbRIqJGLChgOe8UilA8MR0RB2vuu0udakJOn2B73JxGn1wk497K_nVbx3eTj417oOUftHpYfHG_9zhLZ0cYJEo1jCZZOXxzZ8te7Eqc5xXmB7gJQrjReOzP-J1dvLssyr18WqjaYP99NeP2geRwhyKarAZCxREhREAmRoIM3sbJxyAMpjbkNelSlweD1DFFc0ToVOjWKJAKYAYs1PUatYFvoMYTuA1IlmsT3qwsgktjdJpTWSSQN2_5-jY2fy_L3GX8xray_-bL1Fe_3p03A-HIweL9F-DR52-Yor1KrKtb5Gu_BR5avyxn-8LzFNmCo
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=Hawaii+International+Conference+on+System+Sciences%2C+27th.+Vol.+5%3A+Biotechnology&rft.atitle=Limited+resource+scheduling+in+sparse+matrix+algorithms&rft.au=Pozo&rft.au=Smith&rft.date=1994-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818650901&rft.volume=2&rft.spage=473&rft.epage=482&rft_id=info:doi/10.1109%2FHICSS.1994.323236&rft.externalDocID=323236
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818650901/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818650901/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818650901/sc.gif&client=summon&freeimage=true