{"id":"https://openalex.org/W3149651344","doi":"https://doi.org/10.1109/date.2010.5456915","title":"Multithreaded code from synchronous programs: Extracting independent threads for OpenMP","display_name":"Multithreaded code from synchronous programs: Extracting independent threads for OpenMP","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W3149651344","doi":"https://doi.org/10.1109/date.2010.5456915","mag":"3149651344"},"language":"en","primary_location":{"id":"doi:10.1109/date.2010.5456915","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2010.5456915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)","raw_type":"proceedings-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/A5027012950","display_name":"Daniel Baudisch","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Daniel Baudisch","raw_affiliation_strings":["Department of Computer Science, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053832606","display_name":"Jens Brandt","orcid":"https://orcid.org/0000-0003-1193-5496"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jens Brandt","raw_affiliation_strings":["Department of Computer Science, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081184867","display_name":"Klaus Schneider","orcid":"https://orcid.org/0000-0002-1305-7132"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Schneider","raw_affiliation_strings":["Department of Computer Science, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027012950"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":2.4969,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.90517491,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"949","last_page":"952"},"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.9998999834060669,"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.9998999834060669,"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":0.9998999834060669,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991000294685364,"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/computer-science","display_name":"Computer science","score":0.9036747813224792},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7988385558128357},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7573267221450806},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.7341464757919312},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7300388216972351},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6301025152206421},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.49814629554748535},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.48240530490875244},{"id":"https://openalex.org/keywords/multithreading","display_name":"Multithreading","score":0.4581223726272583},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.45440879464149475},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43169158697128296},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4187219738960266}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9036747813224792},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7988385558128357},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7573267221450806},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.7341464757919312},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7300388216972351},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6301025152206421},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.49814629554748535},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.48240530490875244},{"id":"https://openalex.org/C201410400","wikidata":"https://www.wikidata.org/wiki/Q1064412","display_name":"Multithreading","level":3,"score":0.4581223726272583},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.45440879464149475},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43169158697128296},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4187219738960266},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2010.5456915","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2010.5456915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1576648414","https://openalex.org/W2000805517","https://openalex.org/W2068308783","https://openalex.org/W2127335869","https://openalex.org/W3184710042"],"related_works":["https://openalex.org/W2115561485","https://openalex.org/W1985089255","https://openalex.org/W2010970156","https://openalex.org/W2153202644","https://openalex.org/W2105895556","https://openalex.org/W2733115356","https://openalex.org/W2377593213","https://openalex.org/W4235861380","https://openalex.org/W2106625514","https://openalex.org/W2974157558"],"abstract_inverted_index":{"Synchronous":[0],"languages":[1,19],"offer":[2],"a":[3,24,68,123,133],"deterministic":[4],"model":[5,100],"of":[6,11,38,48,62,101,107,122,129],"concurrency":[7],"at":[8,59],"the":[9,35,46,60,78,83,90,97,104,108,120,127],"level":[10,61],"actions.":[12,40,110],"However,":[13],"essentially":[14],"all":[15],"compilers":[16],"for":[17,34,72],"synchronous":[18,49,63,73,99],"compile":[20],"these":[21,39],"actions":[22,65,121],"into":[23],"single":[25],"thread":[26],"by":[27,132],"sophisticated":[28],"methods":[29],"to":[30,51,77,96],"guarantee":[31],"dynamic":[32],"schedules":[33],"sequential":[36],"execution":[37],"In":[41,75],"this":[42],"paper,":[43],"we":[44],"present":[45],"compilation":[47],"programs":[50],"multi-threaded":[52],"OpenMP-based":[53],"C":[54],"programs.":[55],"We":[56,111],"thereby":[57],"start":[58],"guarded":[64,109],"which":[66,93],"is":[67,94],"comfortable":[69],"intermediate":[70],"language":[71],"languages.":[74],"addition":[76],"explicit":[79],"parallelism":[80,92],"given":[81],"in":[82],"source":[84],"program,":[85],"our":[86,130],"method":[87],"also":[88],"exploits":[89],"implicit":[91],"due":[95],"underlying":[98],"computation":[102],"and":[103,125],"data":[105],"dependencies":[106],"show":[112,126],"how":[113],"viable":[114],"tasks":[115],"can":[116],"be":[117],"constructed":[118],"from":[119],"program":[124],"feasibility":[128],"approach":[131],"small":[134],"example.":[135]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}