{"id":"https://openalex.org/W2127799876","doi":"https://doi.org/10.1109/date.2011.5763118","title":"Parallelization of while loops in nested loop programs for shared-memory multiprocessor systems","display_name":"Parallelization of while loops in nested loop programs for shared-memory multiprocessor systems","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2127799876","doi":"https://doi.org/10.1109/date.2011.5763118","mag":"2127799876"},"language":"en","primary_location":{"id":"doi:10.1109/date.2011.5763118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2011.5763118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Design, Automation &amp; Test in Europe","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/A5033173132","display_name":"Stefan J. Geuns","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"S J Geuns","raw_affiliation_strings":["Eindhovan University of Technology, Netherlands","EINDHOVEN UNIVERSITY OF TECHNOLOGY"],"affiliations":[{"raw_affiliation_string":"Eindhovan University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"EINDHOVEN UNIVERSITY OF TECHNOLOGY","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111443523","display_name":"Marco J.G. Bekooij","orcid":null},"institutions":[{"id":"https://openalex.org/I109147379","display_name":"NXP (Netherlands)","ror":"https://ror.org/059be4e97","country_code":"NL","type":"company","lineage":["https://openalex.org/I109147379"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"M J G Bekooij","raw_affiliation_strings":["NXP Semiconductors, Netherlands","[NXP Semiconductors]"],"affiliations":[{"raw_affiliation_string":"NXP Semiconductors, Netherlands","institution_ids":["https://openalex.org/I109147379"]},{"raw_affiliation_string":"[NXP Semiconductors]","institution_ids":["https://openalex.org/I109147379"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004725710","display_name":"Tjerk Bijlsma","orcid":"https://orcid.org/0000-0003-0806-4845"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"T Bijlsma","raw_affiliation_strings":["University of Twente, Netherlands","Twente University"],"affiliations":[{"raw_affiliation_string":"University of Twente, Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"Twente University","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081768631","display_name":"Henk Corporaal","orcid":"https://orcid.org/0000-0003-4506-5732"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"H Corporaal","raw_affiliation_strings":["Eindhovan University of Technology, Netherlands","EINDHOVEN UNIVERSITY OF TECHNOLOGY"],"affiliations":[{"raw_affiliation_string":"Eindhovan University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"EINDHOVEN UNIVERSITY OF TECHNOLOGY","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5033173132"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":3.3499,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.93002486,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8773699998855591},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.7503355741500854},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7351877689361572},{"id":"https://openalex.org/keywords/loop-fission","display_name":"Loop fission","score":0.6446988582611084},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5677173137664795},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5441258549690247},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.5172329545021057},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5156677961349487},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.49354684352874756},{"id":"https://openalex.org/keywords/loop-fusion","display_name":"Loop fusion","score":0.4853602945804596},{"id":"https://openalex.org/keywords/automatic-parallelization","display_name":"Automatic parallelization","score":0.4413205087184906},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32203400135040283},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.30691784620285034},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.27294260263442993},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1719307005405426},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.17022845149040222}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8773699998855591},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.7503355741500854},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7351877689361572},{"id":"https://openalex.org/C134718785","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fission","level":3,"score":0.6446988582611084},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5677173137664795},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5441258549690247},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.5172329545021057},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5156677961349487},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.49354684352874756},{"id":"https://openalex.org/C82653869","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fusion","level":3,"score":0.4853602945804596},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.4413205087184906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32203400135040283},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.30691784620285034},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27294260263442993},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1719307005405426},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.17022845149040222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/date.2011.5763118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2011.5763118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Design, Automation &amp; Test in Europe","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:publications/3af28957-289b-4b04-b1ee-9a6ac79c74db","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/3af28957-289b-4b04-b1ee-9a6ac79c74db","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Geuns, S J, Bekooij, M J G, Bijlsma, T & Corporaal, H 2011, Parallelization of while loops in nested loop programs for shared-memory multiprocessor systems. in Proceedings - Design, Automation and Test in Europe Conference and Exhibition, DATE 2011., 5763118, pp. 697-702, 14th Design, Automation and Test in Europe Conference and Exhibition, DATE 2011, Grenoble, France, 14/03/11.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/b1af3f09-c7c0-4d03-a7c5-c54036fe95f1","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/b1af3f09-c7c0-4d03-a7c5-c54036fe95f1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Geuns, S J, Bekooij, M J G, Bijlsma, T & Corporaal, H 2011, Parallelization of While Loops in Nested Loop Programs for Shared-Memory Multiprocessor Systems. in Design, Automation & Test in Europe Conference & Exhibition, DATE 2011. IEEE, USA, pp. 1-6, 2011 Design, Automation & Test in Europe Conference & Exhibition, DATE 2011, Grenoble, France, 14/03/11. < http://eprints.eemcs.utwente.nl/secure2/20437/01/geuns-2011-parallelization_of_while_loops_in_nested_loop_programs_for_shared_memory_multiprocessor_systems.pdf >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:publications/b1af3f09-c7c0-4d03-a7c5-c54036fe95f1","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5763118","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1537951533","https://openalex.org/W1557064363","https://openalex.org/W1565725930","https://openalex.org/W2034073536","https://openalex.org/W2039977046","https://openalex.org/W2101811680","https://openalex.org/W2110579225","https://openalex.org/W2115090673","https://openalex.org/W2120349549","https://openalex.org/W2152962419","https://openalex.org/W2157758640","https://openalex.org/W3148714927","https://openalex.org/W3149651344","https://openalex.org/W4232919122","https://openalex.org/W4240190490","https://openalex.org/W6677361687"],"related_works":["https://openalex.org/W2074495974","https://openalex.org/W2040522199","https://openalex.org/W2114948246","https://openalex.org/W1602571691","https://openalex.org/W154155438","https://openalex.org/W1532159642","https://openalex.org/W2342605656","https://openalex.org/W2052992886","https://openalex.org/W2583056912","https://openalex.org/W2954733970"],"abstract_inverted_index":{"Many":[0],"applications":[1],"contain":[2],"loops":[3,11],"with":[4,52],"an":[5,25,141],"undetermined":[6,142],"number":[7],"of":[8,70,85,92,144],"iterations.":[9],"These":[10],"have":[12],"to":[13,18,34,82,105],"be":[14],"parallelized":[15,57,102],"in":[16,100],"order":[17],"increase":[19],"the":[20,56,68,86,90,93,101,107,112,121,135,147],"throughput":[21],"when":[22],"executed":[23],"on":[24,42],"embedded":[26],"multiprocessor":[27],"platform.":[28],"This":[29],"paper":[30],"presents":[31],"a":[32,37,47,71],"method":[33],"automatically":[35],"extract":[36],"parallel":[38,94,123],"task":[39,58,95,103,124],"graph":[40,59,104,125],"based":[41],"function":[43],"level":[44],"parallelism":[45],"from":[46],"sequential":[48,113],"nested":[49,114],"loop":[50,60,88,115],"program":[51],"while":[53,87],"loops.":[54],"In":[55],"iterations":[61,84],"can":[62,78,137],"overlap":[63,83],"during":[64,89],"execution.":[65],"We":[66],"introduce":[67,128],"notion":[69],"single":[72,80],"assignment":[73,81],"section":[74],"such":[75],"that":[76,120],"we":[77],"exploit":[79],"execution":[91],"graph.":[96],"Synchronization":[97],"is":[98,118],"inserted":[99],"ensure":[106],"same":[108],"functional":[109],"behavior":[110],"as":[111],"program.":[116],"It":[117],"shown":[119],"generated":[122],"does":[126],"not":[127],"deadlock.":[129],"A":[130],"DVB-T":[131],"radio":[132],"receiver":[133],"where":[134],"user":[136],"switch":[138],"channels":[139],"after":[140],"amount":[143],"time":[145],"illustrates":[146],"approach.":[148]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}