Evaluation of automatic parallelization algorithms to minimize speculative parallelism overheads: An experiment
Automatic parallelization is a crucial objective of the parallel computing architecture that can be achieved through conversion of sequential code into multi-threaded code, which will run in parallel manner. This approach focuses largely on the loops since they take most of the execution time in pro...
Uloženo v:
| Vydáno v: | Journal of discrete mathematical sciences & cryptography Ročník 24; číslo 5; s. 1517 - 1528 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Taylor & Francis
04.07.2021
|
| Témata: | |
| ISSN: | 0972-0529, 2169-0065 |
| 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 | Automatic parallelization is a crucial objective of the parallel computing architecture that can be achieved through conversion of sequential code into multi-threaded code, which will run in parallel manner. This approach focuses largely on the loops since they take most of the execution time in programs. Thread level speculation techniques come into roleplay while checking for the dependencies. These dependencies cannot be identified at the compile time, thus providing a larger scope of parallelization when combined with other parallelisation techniques. This results in a greater speedup and more accurate parallel code formation. In this research paper, an experiment to evaluate the performance and comparative analysis has been done among key automatic parallelization algorithms on different parameters like number of cores, speedup and loop dependency taking into consideration of speculation. |
|---|---|
| AbstractList | Automatic parallelization is a crucial objective of the parallel computing architecture that can be achieved through conversion of sequential code into multi-threaded code, which will run in parallel manner. This approach focuses largely on the loops since they take most of the execution time in programs. Thread level speculation techniques come into roleplay while checking for the dependencies. These dependencies cannot be identified at the compile time, thus providing a larger scope of parallelization when combined with other parallelisation techniques. This results in a greater speedup and more accurate parallel code formation. In this research paper, an experiment to evaluate the performance and comparative analysis has been done among key automatic parallelization algorithms on different parameters like number of cores, speedup and loop dependency taking into consideration of speculation. |
| Author | Kumar, Sudhakar Aggarwal, Naveen Singh, Sunil Kr Aggarwal, Kriti |
| Author_xml | – sequence: 1 givenname: Sudhakar surname: Kumar fullname: Kumar, Sudhakar email: sudhakark324@gmail.com organization: Panjab University – sequence: 2 givenname: Sunil Kr surname: Singh fullname: Singh, Sunil Kr organization: Panjab University – sequence: 3 givenname: Naveen surname: Aggarwal fullname: Aggarwal, Naveen organization: Panjab University – sequence: 4 givenname: Kriti surname: Aggarwal fullname: Aggarwal, Kriti organization: University Institute of Engineering and Technology, Panjab University |
| BookMark | eNqFkNtKAzEQhoNUsK0-gpAX2Jpkm91GbyylHqDgjV6HbA42kt0sSVptn95dWxG80KthmP8bZr4RGDS-0QBcYjTBaIauECsJooRNCCJ4ghnF05yegCHBBcsQKugADPtM1ofOwCjGN4QoI5gNgV9uhduIZH0DvYFik3zddRK2IgjntLP7w1C4Vx9sWtcRJg9r29ja7jWMrZYb10W2-geJNfRbHdZaqHgN5w3UH60OttZNOgenRrioL451DF7uls-Lh2z1dP-4mK8ymWOUsopqSSqCDZoShShWyORqio1iFaYU41JJOdNlblRBVVnSShaSCVQwQRkmOc3H4OawVwYfY9CGS5u-PklBWMcx4r07_u2O9-740V1H0190250vwu5f7vbA2cb4UIt3H5ziSeycDyaIRtrI879XfAKGzosM |
| CitedBy_id | crossref_primary_10_1038_s41598_023_49869_6 crossref_primary_10_4018_IJCAC_312583 crossref_primary_10_1007_s11227_024_05987_0 crossref_primary_10_1080_17517575_2023_2301658 crossref_primary_10_1007_s11042_023_16922_5 crossref_primary_10_4018_IJSSCI_334711 crossref_primary_10_1016_j_csa_2024_100037 crossref_primary_10_1007_s42979_023_02566_7 crossref_primary_10_1016_j_csa_2024_100046 crossref_primary_10_3233_JHS_230258 crossref_primary_10_1002_int_23062 crossref_primary_10_1016_j_procs_2024_06_112 |
| Cites_doi | 10.1080/09720529.2012.10698389 10.1504/IJICA.2021.113750 10.1145/24039.24041 10.1080/09720502.2018.1467585 10.1080/09720529.2019.1582864 10.1080/09720502.2015.1033847 10.1080/09720529.2020.1721869 |
| ContentType | Journal Article |
| Copyright | 2021 Taru Publications 2021 |
| Copyright_xml | – notice: 2021 Taru Publications 2021 |
| DBID | AAYXX CITATION |
| DOI | 10.1080/09720529.2021.1951435 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2169-0065 |
| EndPage | 1528 |
| ExternalDocumentID | 10_1080_09720529_2021_1951435 1951435 |
| Genre | Research Article |
| GroupedDBID | 30N 4.4 ABCCY ABFIM ABPEM ABTAI ABXYU ACGFS ACTIO ADCVX AEYOC AGDLA AIJEM AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AQTUD AVBZW AWYRJ BLEHA CCCUG DGEBU DKSSO EBS E~A E~B GTTXZ H13 HZ~ H~P IPNFZ J9A KYCEM LJTGL M4Z O9- P2P S-T SNACF TDBHL TFW TTHFI UT5 AAYXX CITATION |
| ID | FETCH-LOGICAL-c310t-b5ec2b21f042d051d0f3d41fd9b155117dcc8e73fd65d775bc6c9a069a5912353 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000692750900030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0972-0529 |
| IngestDate | Sat Nov 29 02:16:51 EST 2025 Tue Nov 18 22:27:40 EST 2025 Mon Oct 20 23:47:35 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c310t-b5ec2b21f042d051d0f3d41fd9b155117dcc8e73fd65d775bc6c9a069a5912353 |
| PageCount | 12 |
| ParticipantIDs | informaworld_taylorfrancis_310_1080_09720529_2021_1951435 crossref_citationtrail_10_1080_09720529_2021_1951435 crossref_primary_10_1080_09720529_2021_1951435 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-07-04 |
| PublicationDateYYYYMMDD | 2021-07-04 |
| PublicationDate_xml | – month: 07 year: 2021 text: 2021-07-04 day: 04 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of discrete mathematical sciences & cryptography |
| PublicationYear | 2021 |
| Publisher | Taylor & Francis |
| Publisher_xml | – name: Taylor & Francis |
| References | CIT0010 CIT0001 CIT0003 CIT0002 CIT0005 CIT0004 CIT0007 Hill M. D. (CIT0008) 2008; 41 CIT0006 CIT0009 |
| References_xml | – ident: CIT0001 doi: 10.1080/09720529.2012.10698389 – ident: CIT0005 doi: 10.1504/IJICA.2021.113750 – volume: 41 start-page: 33 issue: 7 year: 2008 ident: CIT0008 publication-title: Computer (Long. Beach. Calif – ident: CIT0002 – ident: CIT0003 doi: 10.1145/24039.24041 – ident: CIT0004 – ident: CIT0006 doi: 10.1080/09720502.2018.1467585 – ident: CIT0010 doi: 10.1080/09720529.2019.1582864 – ident: CIT0007 doi: 10.1080/09720502.2015.1033847 – ident: CIT0009 doi: 10.1080/09720529.2020.1721869 |
| SSID | ssj0059219 |
| Score | 2.250857 |
| Snippet | Automatic parallelization is a crucial objective of the parallel computing architecture that can be achieved through conversion of sequential code into... |
| SourceID | crossref informaworld |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1517 |
| SubjectTerms | Automatic parallelization Independent and pipeline multi-threading Speculative parallelism overheads |
| Title | Evaluation of automatic parallelization algorithms to minimize speculative parallelism overheads: An experiment |
| URI | https://www.tandfonline.com/doi/abs/10.1080/09720529.2021.1951435 |
| Volume | 24 |
| WOSCitedRecordID | wos000692750900030&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 | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor & Francis Journals Complete customDbUrl: eissn: 2169-0065 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0059219 issn: 0972-0529 databaseCode: TFW dateStart: 19980101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV05T8MwFLZQxcBCOUW55IE1Jc7lmK1CrZgqhiK6RT6hUpqgJu3ArycvcXoMwABTlOGLItvvSt77PoTuvIi7VVyLnVAQ7QSaBk6stXYiPwiE9IDi3K3FJuh4HE-n7Nl2Exa2rRJqaNMQRdS-Goybi6LtiLsHxhn4QVVVdx7pE1bH_MoLVxcwzcnotfXFIfNIw7ZHPQcg7QzPd0_ZiU473KVbUWfU_Yf3PUKHNuXEg-aMHKM9nZ2gbivngK11n6J8uGb-xrnBfFnmNZ8rBnrwNNWpHdnEPH3LF7PyfV7gMsdATjKffWoMQ5u1GNhKbyDFHEOTaOXyVfGABxneSAqcoZfRcPL45Fg9BkdWSWDpiFBLT3jEVIauKmNWrvFVQIxiAhIvQpWUsaa-UVGoKA2FjCTjbsR4yGAk1z9HnSzP9AXCNFBGaG0oFHTG94UinMpYGKq4L7nbQ0G7D4m0ZOWgmZEmpOU0tYuawKImdlF7qL-GfTRsHb8B2PYmJ2X9mcQ0miaJ_yP28g_YK3QAt3Xfb3CNOuViqW_QvlyVs2JxW5_hL4fu7tU |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrZ07T8MwEMctKEiwUJ6iPD2wpsR5OWGrUCsQpVMR3SI_oVKaoCbtwKcnl0cfAzDAHF0U2b4727n7_RG6sTxm5nnNN1xOlOEo6hi-UsrwbMfhwgLEuVmITdDBwB-NgtVeGCirhDO0LkERRawG54bL6Lok7haQM_CHKj_eWaRNgiLpb6ItN8-1wM8f9l7raOwGFil5e9QywKbu4vnuNWv5aY1eupJ3es3_-OJ9tFftOnGnXCYHaEPFh6hZKzrgysGPUNJdwL9xojGbZUmBdMVACI8iFVVdm5hFb8l0nL1PUpwlGPgkk_GnwtC3WeiBzdXSJJ1gqBPNo75M73AnxktVgWP00usO7x-MSpLBEPk-MDO4q4TFLaJzX5e5P0tT29IhWgYc9l6ESiF8RW0tPVdS6nLhiYCZXsDcALpy7RPUiJNYnSJMHam5UprCmU7bNpeEUeFzTSWzBTNbyKknIhQVrxxkM6KQ1FjTalBDGNSwGtQWai_MPkpgx28Gweosh1lxU6JLWZPQ_tH27A-212jnYfjcD_uPg6dztAuPijJg5wI1sulMXaJtMc_G6fSqWNBfrDny_w |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV25TsNAEF1BQIiGcIpwbkHr4PW1Nl0EiUCgKEUQ6SzvBZGcOIqdFHw9HnudowAKqK2xVrNz2jPvIXRjeZGZ5zXfcBmRhiOpY_hSSsOzHYdxCyDOzYJsgna7_mAQ9PQ0YarHKqGHViVQRBGrwbknQlUTcbeAOAM_qPLuziJNEhQ5fxNt5aWzB0be77xVwdgNLFLC7VHLAJlqiee716ylpzXw0pW006n_w4H30Z6uOXGrNJIDtCHHh6he8Tlg7d5HKGkvoL9xonA0y5IC0BUDPngcy1jvbOIofk-mw-xjlOIswYBOMhp-SgxbmwUb2FwuRdIRhinRPOaL9A63xnjJKXCMXjvt_v2joQkZDJ5XgZnBXMktZhGVe7rIvVmYyhYOUSJgUHkRKjj3JbWV8FxBqcu4x4PI9ILIDWAn1z5BtXEylqcIU0coJqWi0NEp22aCRJT7TFER2TwyG8ip7iHkGq0cSDPikFSgplqpISg11EptoOZCbFLCdfwmEKxecpgV30lUSWoS2j_Knv1B9hrt9B464ctT9_kc7cKTYgbYuUC1bDqTl2ibz7NhOr0qzPkL2IXxsQ |
| 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=article&rft.atitle=Evaluation+of+automatic+parallelization+algorithms+to+minimize+speculative+parallelism+overheads%3A+An+experiment&rft.jtitle=Journal+of+discrete+mathematical+sciences+%26+cryptography&rft.au=Kumar%2C+Sudhakar&rft.au=Singh%2C+Sunil+Kr&rft.au=Aggarwal%2C+Naveen&rft.au=Aggarwal%2C+Kriti&rft.date=2021-07-04&rft.issn=0972-0529&rft.eissn=2169-0065&rft.volume=24&rft.issue=5&rft.spage=1517&rft.epage=1528&rft_id=info:doi/10.1080%2F09720529.2021.1951435&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_09720529_2021_1951435 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0972-0529&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0972-0529&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0972-0529&client=summon |