MASA-StarPU: Parallel Sequence Comparison with Multiple Scheduling Policies and Pruning
Sequence comparison tools based on the Smith-Waterman (SW) algorithm provide the optimal result but have high execution times when the sequences compared are long, since a huge dynamic programming (DP) matrix is computed. Block pruning is an optimization that does not compute some parts of the DP ma...
Uložené v:
| Vydané v: | Proceedings (Symposium on Computer Architecture and High Performance Computing) s. 225 - 232 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.09.2020
|
| Predmet: | |
| ISSN: | 2643-3001 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Sequence comparison tools based on the Smith-Waterman (SW) algorithm provide the optimal result but have high execution times when the sequences compared are long, since a huge dynamic programming (DP) matrix is computed. Block pruning is an optimization that does not compute some parts of the DP matrix and can reduce considerably the execution time when the sequences compared are similar. However, block pruning's resulting task graph is dynamic and irregular. Since different pruning scenarios lead to different pruning shapes, we advocate that no single scheduling policy will behave the best for all scenarios. This paper proposes MASA-StarPU, a sequence aligner that integrates the domain specific framework MASA to the generic programming environment StarPU, creating a tool which has the benefits of StarPU (i.e., multiple task scheduling policies) and MASA (i.e., fast sequence alignment). MASA-StarPU was executed in two different multicore platforms and the results show that a bad choice of the scheduling policy may have a great impact on the performance. For instance, using 24 cores, the 5M x 5M comparison took 1484s with the dmdas policy whereas the same comparison took 3601s with lws. We also show that no scheduling policy behaves the best for all scenarios. |
|---|---|
| AbstractList | Sequence comparison tools based on the Smith-Waterman (SW) algorithm provide the optimal result but have high execution times when the sequences compared are long, since a huge dynamic programming (DP) matrix is computed. Block pruning is an optimization that does not compute some parts of the DP matrix and can reduce considerably the execution time when the sequences compared are similar. However, block pruning's resulting task graph is dynamic and irregular. Since different pruning scenarios lead to different pruning shapes, we advocate that no single scheduling policy will behave the best for all scenarios. This paper proposes MASA-StarPU, a sequence aligner that integrates the domain specific framework MASA to the generic programming environment StarPU, creating a tool which has the benefits of StarPU (i.e., multiple task scheduling policies) and MASA (i.e., fast sequence alignment). MASA-StarPU was executed in two different multicore platforms and the results show that a bad choice of the scheduling policy may have a great impact on the performance. For instance, using 24 cores, the 5M x 5M comparison took 1484s with the dmdas policy whereas the same comparison took 3601s with lws. We also show that no scheduling policy behaves the best for all scenarios. |
| Author | M. A. Melo, Alba C. Thibault, Samuel Lopes, Rafael A. |
| Author_xml | – sequence: 1 givenname: Rafael A. surname: Lopes fullname: Lopes, Rafael A. organization: University of Brasilia – sequence: 2 givenname: Samuel surname: Thibault fullname: Thibault, Samuel organization: INRIA Bordeaux – sequence: 3 givenname: Alba C. surname: M. A. Melo fullname: M. A. Melo, Alba C. organization: University of Brasilia |
| BookMark | eNotjNtKAzEURaMo2Fa_wJf8wNTkJGkS38bxCi0OjMXHksmc2kiaqXNB_HsL-rIXLBZ7Ss5Sm5AQytmcc2Zvqru8yMr8Xloj9RwYsDljTNgTMuUaDLcWpD4lE1hIkQnG-AWZ9v3nMVmAXUzI-yqv8qwaXFeub2npOhcjRlrh14jJIy3a_cF1oW8T_Q7Djq7GOIRDRFr5HTZjDOmDlm0MPmBPXWpo2Y3pKC_J-dbFHq_-OSPrx4e34jlbvj69FPky24HRQ6agRm791iPyWjrgjfbGGe2tB-0UoGHmOOC1td7UyoBFoZSUjeK6qZWYkeu_34CIm0MX9q772VgQigktfgGoSlQQ |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/SBAC-PAD49847.2020.00039 |
| 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 |
| Discipline | Computer Science |
| EISBN | 1728199247 9781728199245 |
| EISSN | 2643-3001 |
| EndPage | 232 |
| ExternalDocumentID | 9235037 |
| Genre | orig-research |
| GroupedDBID | 23M 29O 6IE 6IF 6IH 6IK 6IL 6IN AAJGR AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI M43 OCL RIE RIL RNS |
| ID | FETCH-LOGICAL-h287t-52be19cfcee1b4a21d7c8a87c9c27a52e8082e82c799c8b5829e35544d517db53 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 12 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000630462100028&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 02:27:29 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-h287t-52be19cfcee1b4a21d7c8a87c9c27a52e8082e82c799c8b5829e35544d517db53 |
| OpenAccessLink | https://inria.hal.science/hal-02914793 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_9235037 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-Sep |
| PublicationDateYYYYMMDD | 2020-09-01 |
| PublicationDate_xml | – month: 09 year: 2020 text: 2020-Sep |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings (Symposium on Computer Architecture and High Performance Computing) |
| PublicationTitleAbbrev | SBAC-PAD |
| PublicationYear | 2020 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0036296 |
| Score | 2.1986158 |
| Snippet | Sequence comparison tools based on the Smith-Waterman (SW) algorithm provide the optimal result but have high execution times when the sequences compared are... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 225 |
| SubjectTerms | dynamic programming parallel programming environments parallel sequence comparison |
| Title | MASA-StarPU: Parallel Sequence Comparison with Multiple Scheduling Policies and Pruning |
| URI | https://ieeexplore.ieee.org/document/9235037 |
| WOSCitedRecordID | wos000630462100028&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/eLvHCXMwlV07T8MwED61FQMTjxbxlgdGTBPHiW22UKhYWkUqFd2q-BEVCbUotPx-zklaGFjYrEjORT75XvnuPoCbxE9N54JR5oSmPLSKas0l1dbiDq_zoCabEOOxnM1U1oLbXS-Mc64Cn7k7v6z-5duV2fhSWR-DkTiIRBvaQiR1r9bW6qIdVskWqROo_uQhHdAsfeQKzS-mgcwjuAJPCf6LRKXyIcOD_0k_hN5PMx7Jdm7mCFpueQwHWzYG0lzOLryO0klKMXgss-k9yfLSs6S8k0mDlSaDHeMg8cVXMmqghPiGBfob35ZOqinBmDuTfGlR6MYXTXowHT69DJ5pQ5tAF5j-rDG11C5UpsDvCjXPWWiFkbkURhkm8pg5iW7fSWaEUkbqWDLlfNTBbRwKq-PoBDrL1dKdApFRobg2hY5Cw50sNAZrzk_YV0UgbSLOoOvPaf5RT8aYN0d0_vfjC9j3iqgRWpfQWZcbdwV75mv99lleV-r8Bh83oQg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFH9BNNETKhi_7cGjla3raOttogQjkCVA5EbWjwUSM8wE_37bMdCDF2_Nku4tfen72u-9H8Bty01Np4xgYpjE1NcCS0k5llrbHU7n3ppsgg0GfDIRcQXutr0wxpgCfGbu3bL4l68XauVKZU0bjIRewHZg1zFnld1aG7trLbFobbA6nmgOH6M2jqMnKqwBtokgcRguz5GC_6JRKbxIp_Y_-YfQ-GnHQ_HW0RxBxWTHUNvwMaDyetbhrR8NI2zDxzweP6A4yR1Pyjsalmhp1N5yDiJXfkX9Ekxo3zCzHsc1pqNiTrDNnlGSaSt05comDRh3nkftLi6JE_DMJkBLm1xK4wuV2u_yJU2Ir5niCWdKKMKSkBhuHb_hRDEhFJchJ8K4uIPq0GdahsEJVLNFZk4B8SAVVKpUBr6ihqfShmvGzdgXqcd1i51B3Z3T9GM9G2NaHtH5349vYL876vemvZfB6wUcOKWs8VqXUF3mK3MFe-prOf_MrwvVfgOx06RR |
| 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%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+%28Symposium+on+Computer+Architecture+and+High+Performance+Computing%29&rft.atitle=MASA-StarPU%3A+Parallel+Sequence+Comparison+with+Multiple+Scheduling+Policies+and+Pruning&rft.au=Lopes%2C+Rafael+A.&rft.au=Thibault%2C+Samuel&rft.au=M.+A.+Melo%2C+Alba+C.&rft.date=2020-09-01&rft.pub=IEEE&rft.eissn=2643-3001&rft.spage=225&rft.epage=232&rft_id=info:doi/10.1109%2FSBAC-PAD49847.2020.00039&rft.externalDocID=9235037 |