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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of discrete mathematical sciences & cryptography Ročník 24; číslo 5; s. 1517 - 1528
Hlavní autoři: Kumar, Sudhakar, Singh, Sunil Kr, Aggarwal, Naveen, Aggarwal, Kriti
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis 04.07.2021
Témata:
Automatic parallelization
Independent and pipeline multi-threading
Speculative parallelism overheads
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/eLvHCXMwrV05T8MwFLZQxcBCOUW55IHVpc7lmK1CrZgqhiK6RfEFldIGNWkHfj1-idNjAAaYogwvip7fmbz3fQjdMRFKZbhPItsrk0BzRlKR9ohNjZDdOdWyJptgo1E8mfBnN01YuLFK6KFNDRRRxWpw7lQUzUTcPSDOwA8q2915tEt5lfNtFLYXcM3x8LWJxSH3aI22xzwCIs0Oz3dP2clOO9ilW1ln2P6H9z1Ch67kxP3aRo7Rnp6foHZD54Cdd5-ifLBG_sa5wemyzCs8Vwzw4FmmM7eyidPsLV9My_dZgcscAzjJbPqpMSxtVmRgK70RKWYYhkRtyFfFA-7P8YZS4Ay9DAfjxyfi-BiItEVgSUSopSc8aqyjK-vMqmd8FVCjuIDCizIlZayZb1QUKsZCISPJ017E05DDSq5_jlrzfK4vEOYxTUMTe8b3TBDFkishZWSNRjFA4OMdFDTnkEgHVg6cGVlCG0xTp9QElJo4pXZQdy32UaN1_CbAtw85KavPJKbmNEn8H2Uv_yB7hQ7gtpr7Da5Rq1ws9Q3al6tyWixuKxv-AlfS7kM
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrZ07T8MwEMctKEiwUJ6iPD2wutR5OWarUCsQpVMR3aLED6iUJqhNO_Dp8eXRxwAMMEcXRbbvznbufn-EbljkCqm5TTxzViaO4oyEUdgiJjVCdudUiUJsgvX7_nDIV3thoKwSztC6AEXksRqcGy6jq5K4W0DOwB8qc7yzaJPyPOlvoi3X5Frg5w-6r1U0drlFC94eswjYVF08371mLT-t0UtX8k63_h9fvI_2yl0nbhfL5ABtqOQQ1StFB1w6-BFKOwv4N041DmdZmiNdMRDC41jFZdcmDuO3dDLK3sdTnKUY-CTj0afC0LeZ64HN1dJkOsZQJ2qivpze4XaCl6oCx-il2xncP5BSkoEIsw_MSOQqYUUW1cbXpfFn2dK2dKiWPIK9F2VSCF8xW0vPlYy5kfAED1seD10OXbn2CaolaaJOEeY-DV3tW9q2tOP5gstICM-sG8kAwscbyKkmIhAlrxxkM-KAVljTclADGNSgHNQGai7MPgpgx28GfHWWgyy_KdGFrElg_2h79gfba7TzMHjuBb3H_tM52oVHeRmwc4Fq2WSmLtG2mGej6eQqX9BfddjybQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELagIMTCG_HGA6uhzssxWwWtQKCqQxHdosQPqJQmqAkM_Hp8iUPpAAwwRxdZ53smd9-H0BlLfCE1d0lgemXiKc5InMRtYlIjZHdOlajJJli_H45GfGCnCQs7Vgk9tK6BIqpYDc79InUzEXcBiDPwg8p0dw49p7zK-YtoyZTOARj5sPfYBGOfO7SG22MOAZlmiee718ylpznw0i9pp7f-DwfeQGu25sSd2kg20YLKttB6w-eArXtvo7z7Cf2Nc43j1zKvAF0x4IOnqUrtziaO06d8Oi6fJwUucwzoJJPxu8KwtVmxgb2pmUgxwTAlamK-LC5xJ8MzToEd9NDrDq9uiCVkIMJUgSVJfCWcxKHaeLo03izb2pUe1ZInUHlRJoUIFXO1DHzJmJ-IQPC4HfDY57CT6-6iVpZnag9hHtLY16GjXUd7QSi4TIQIjNVIBhB8fB95zT1EwqKVA2lGGtEG1NQqNQKlRlap--j8U-ylhuv4TYB_veSorL6T6JrUJHJ_lD34g-wpWhlc96L72_7dIVqFJ9UMsHeEWuX0VR2jZfFWjovpSWXOH6JU8R8
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