{"id":"https://openalex.org/W7097445633","doi":null,"title":"Author manuscript, published in \"19th High Performance Computing Symposium- HPC 2011 (2011)\" Adaptive Runtime Selection of Parallel Schedules in the Polytope Model","display_name":"Author manuscript, published in \"19th High Performance Computing Symposium- HPC 2011 (2011)\" Adaptive Runtime Selection of Parallel Schedules in the Polytope Model","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7097445633"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.7358","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.7358","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"http://hal.inria.fr/docs/00/56/43/11/PDF/papier.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7097445633"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5029485225","display_name":"Beno\u00eet Pradelle","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Beno\u00eet Pradelle","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033502921","display_name":"Vincent Loechner","orcid":"https://orcid.org/0000-0003-3481-4881","observed_orcids":["https://orcid.org/0000-0003-3481-4881"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vincent Loechner","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"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/T10904","display_name":"Embedded Systems Design Techniques","score":9.999999747378752e-05,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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-loop-scheduling","display_name":"parallel loop scheduling","score":0.6859999895095825},{"id":"https://openalex.org/keywords/polytope-model","display_name":"polytope model","score":0.9860000014305115},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"loop tiling","score":0.6549999713897705},{"id":"https://openalex.org/keywords/compiler-optimization","display_name":"compiler optimization","score":0.550000011920929},{"id":"https://openalex.org/keywords/execution-time-prediction","display_name":"execution time prediction","score":0.4950000047683716},{"id":"https://openalex.org/keywords/profiling","display_name":"profiling","score":0.5239999890327454},{"id":"https://openalex.org/keywords/dynamic-scheduling","display_name":"dynamic scheduling","score":0.3659999966621399}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8945000171661377},{"id":"https://openalex.org/C187191949","wikidata":"https://www.wikidata.org/wiki/Q1138496","display_name":"Profiling (computer programming)","level":2,"score":0.708899974822998},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6615999937057495},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6061000227928162},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5939000248908997},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.5656999945640564},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.4645000100135803},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.4641999900341034},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.4172999858856201},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.41200000047683716},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3822999894618988},{"id":"https://openalex.org/C2780870223","wikidata":"https://www.wikidata.org/wiki/Q1004415","display_name":"Runtime system","level":2,"score":0.3822000026702881},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.36090001463890076},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3499000072479248},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3221000134944916},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.3158999979496002},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.3091999888420105},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3003000020980835},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.2736000120639801},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.2558000087738037},{"id":"https://openalex.org/C2777138346","wikidata":"https://www.wikidata.org/wiki/Q1714153","display_name":"Performance tuning","level":2,"score":0.25200000405311584},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.7358","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.7358","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"http://hal.inria.fr/docs/00/56/43/11/PDF/papier.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2250315017","https://openalex.org/W2105897359","https://openalex.org/W2741217114","https://openalex.org/W207528040","https://openalex.org/W2516091146","https://openalex.org/W2144335215","https://openalex.org/W4231661959","https://openalex.org/W4234399034","https://openalex.org/W1504023529","https://openalex.org/W7100791748"],"abstract_inverted_index":{"There":[0],"is":[1,55,94,109,131],"often":[2],"no":[3],"unique":[4,194],"version":[5,93,108,130,173,195],"of":[6,51,67,79,105,123,139,169,192],"a":[7,44,175,193],"program":[8],"that":[9,163],"provides":[10],"the":[11,35,58,87,102,112,115,121,145,150,153,170,190],"best":[12,36,129],"performance":[13,37],"in":[14,38,96,196],"all":[15],"circumstances.":[16],"Compilers":[17],"should":[18],"rely":[19],"on":[20,159],"an":[21],"adaptive":[22,46],"runtime":[23,165,178],"decision":[24],"to":[25,34,186,189],"choose":[26],"which":[27],"optimizing":[28],"and":[29,62,71,120,152,182],"parallelizing":[30],"transformations":[31],"will":[32],"lead":[33],"any":[39],"execution":[40,98,103,198],"context.":[41,199],"We":[42,157],"present":[43],"new":[45],"framework":[47,135],"solving":[48],"two":[49],"drawbacks":[50],"existing":[52],"methods:":[53],"it":[54,63],"effective":[56],"since":[57],"very":[59,176],"first":[60],"execution,":[61],"handles":[64,136],"slight":[65],"variations":[66],"input":[68,117],"data":[69,118],"shape":[70,119],"size.":[72],"In":[73],"our":[74,164],"proposal,":[75],"different":[76,97],"code":[77,107],"versions":[78,138],"parallel":[80,142],"loop":[81],"nests":[82],"are":[83],"statically":[84],"generated":[85],"by":[86],"compiler.":[88],"At":[89,100],"install":[90],"time,":[91],"each":[92,106],"profiled":[95],"contexts.":[99],"runtime,":[101],"time":[104],"predicted":[110,128],"using":[111,144],"profiling":[113,151],"results,":[114],"current":[116],"number":[122],"available":[124],"processor":[125],"cores.":[126],"The":[127],"then":[132],"run.":[133],"Our":[134],"several":[137,160],"possibly":[140],"tiled":[141],"loops,":[143],"polytope":[146],"model":[147],"for":[148],"both":[149],"dynamic":[154],"selection":[155,184],"phases.":[156],"show":[158],"benchmark":[161],"programs":[162],"system":[166],"selects":[167],"one":[168],"most":[171],"efficient":[172,183],"with":[174],"low":[177],"overhead.":[179],"This":[180],"quick":[181],"leads":[185],"speedups":[187],"compared":[188],"usage":[191],"every":[197]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}