{"id":"https://openalex.org/W2011340911","doi":"https://doi.org/10.1080/01495730108935265","title":"EFFECTIVE PARALLELIZATION TECHNIQUES FOR LOOP NESTS WITH NON-UNIFORM DEPENDENCES","display_name":"EFFECTIVE PARALLELIZATION TECHNIQUES FOR LOOP NESTS WITH NON-UNIFORM DEPENDENCES","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2011340911","doi":"https://doi.org/10.1080/01495730108935265","mag":"2011340911"},"language":"en","primary_location":{"id":"doi:10.1080/01495730108935265","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495730108935265","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065202073","display_name":"Der-Lin Pean","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"DER-LIN PEAN","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan, ROC","Department of Computer Science and Information Engineering , National Chiao Tung University , Hsinchu, Taiwan, ROC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan, ROC","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering , National Chiao Tung University , Hsinchu, Taiwan, ROC","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100420610","display_name":"Cheng Chen","orcid":"https://orcid.org/0009-0009-8134-983X"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"CHENG CHEN","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan, ROC","Department of Computer Science and Information Engineering , National Chiao Tung University , Hsinchu, Taiwan, ROC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan, ROC","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering , National Chiao Tung University , Hsinchu, Taiwan, ROC","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12536443,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"1","first_page":"37","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7954084873199463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7560405731201172},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6827086210250854},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6701874136924744},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6457719802856445},{"id":"https://openalex.org/keywords/automatic-parallelization","display_name":"Automatic parallelization","score":0.6306858062744141},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6286327242851257},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.555868923664093},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.4846987724304199},{"id":"https://openalex.org/keywords/loop-fission","display_name":"Loop fission","score":0.4521988034248352},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.4452049136161804},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16357353329658508},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.10696682333946228}],"concepts":[{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7954084873199463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7560405731201172},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6827086210250854},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6701874136924744},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6457719802856445},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.6306858062744141},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6286327242851257},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.555868923664093},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.4846987724304199},{"id":"https://openalex.org/C134718785","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fission","level":3,"score":0.4521988034248352},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.4452049136161804},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16357353329658508},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.10696682333946228},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01495730108935265","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495730108935265","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.47999998927116394,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W156127891","https://openalex.org/W1524877046","https://openalex.org/W1973923211","https://openalex.org/W2010997912","https://openalex.org/W2087524530","https://openalex.org/W2107204490","https://openalex.org/W2111516947","https://openalex.org/W2124090717","https://openalex.org/W2139440055","https://openalex.org/W2143382238","https://openalex.org/W2156165554","https://openalex.org/W2156172744","https://openalex.org/W2164890169","https://openalex.org/W2168442270","https://openalex.org/W2188450683","https://openalex.org/W2296218291","https://openalex.org/W2920966226"],"related_works":["https://openalex.org/W2727330431","https://openalex.org/W2569455035","https://openalex.org/W1543710109","https://openalex.org/W2586845463","https://openalex.org/W2017719803","https://openalex.org/W4316252342","https://openalex.org/W2128467905","https://openalex.org/W2052992886","https://openalex.org/W2379214396","https://openalex.org/W2011340911"],"abstract_inverted_index":{"The":[0,93],"parallelism":[1,30,150],"of":[2,31,83,114,123],"loop":[3,32,73,94],"nests":[4,33],"with":[5,34,90],"non-uniform":[6,35,91,104],"dependences":[7,36],"is":[8],"difficult":[9],"to":[10,135,163],"extract":[11],"and":[12,51,75,118,147],"ineffectively":[13],"explored":[14],"by":[15,159],"the":[16,112,152],"existing":[17,153],"parallelization":[18,64,69],"schemes.":[19],"In":[20],"this":[21,41],"paper,":[22],"we":[23,156],"propose":[24],"new":[25],"efficient":[26],"techniques":[27],"in":[28,97,103],"extracting":[29],"using":[37],"their":[38],"irregularity.":[39],"By":[40],"way,":[42],"current":[43],"highly":[44],"parallel":[45,85,121],"multiprocessor":[46,53],"systems":[47,54],"such":[48],"as":[49],"multithreaded":[50],"clustering":[52],"can":[55],"be":[56],"fully":[57],"utilized.":[58],"These":[59],"four":[60],"mechanisms":[61,134],"are":[62,100,157],"(a)":[63],"part":[65],"splitting,":[66],"(b)":[67],"partial":[68],"decomposition,":[70],"(c)":[71],"irregular":[72],"interchange":[74],"(d)":[76],"growing":[77],"pattern":[78],"detection.":[79],"They":[80],"explore":[81],"parallelisms":[82],"special":[84,120],"patterns":[86,122],"for":[87],"nested":[88],"loops":[89,99,106],"dependences.":[92],"transformations":[95],"used":[96],"uniform":[98],"also":[101,127],"applied":[102],"dependence":[105,124],"after":[107],"legality":[108],"tests.":[109],"We":[110,126,138],"apply":[111],"results":[113],"classical":[115],"convex":[116],"theory":[117],"detect":[119],"vectors.":[125],"proposed":[128],"an":[129],"algorithm":[130],"that":[131,140],"combines":[132],"above":[133],"enhance":[136],"parallelism.":[137],"demonstrate":[139],"our":[141],"technique":[142],"gives":[143],"much":[144],"better":[145],"speedup":[146],"extracts":[148],"more":[149],"than":[151],"techniques.":[154],"Thus,":[155],"encouraged":[158],"these":[160],"apparent":[161],"enhancements":[162],"pursue":[164],"further":[165],"development.":[166]},"counts_by_year":[],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}