{"id":"https://openalex.org/W2034223254","doi":"https://doi.org/10.1142/s012962649400020x","title":"COMPUTING LINEAR DATA DEPENDENCIES IN NESTED LOOP PROGRAMS","display_name":"COMPUTING LINEAR DATA DEPENDENCIES IN NESTED LOOP PROGRAMS","publication_year":1994,"publication_date":"1994-09-01","ids":{"openalex":"https://openalex.org/W2034223254","doi":"https://doi.org/10.1142/s012962649400020x","mag":"2034223254"},"language":"en","primary_location":{"id":"doi:10.1142/s012962649400020x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962649400020x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5035915552","display_name":"Christian Heckler","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"CHRISTIAN HECKLER","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, Lehrstuhl f\u00fcr Mikroelektronik, Postfach 1150, 66041 Saarbr\u016bcken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, Lehrstuhl f\u00fcr Mikroelektronik, Postfach 1150, 66041 Saarbr\u016bcken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060999697","display_name":"Lothar Thiele","orcid":"https://orcid.org/0000-0001-6139-868X"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"LOTHAR THIELE","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, Lehrstuhl f\u00fcr Mikroelektronik, Postfach 1150, 66041 Saarbr\u016bcken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, Lehrstuhl f\u00fcr Mikroelektronik, Postfach 1150, 66041 Saarbr\u016bcken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":1.1284,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79821235,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"04","issue":"03","first_page":"193","last_page":"204"},"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.996999979019165,"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.996999979019165,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/nested-loop-join","display_name":"Nested loop join","score":0.8018117547035217},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7659320831298828},{"id":"https://openalex.org/keywords/diophantine-equation","display_name":"Diophantine equation","score":0.6124459505081177},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5824676156044006},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5762238502502441},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.499586820602417},{"id":"https://openalex.org/keywords/linear-inequality","display_name":"Linear inequality","score":0.4880906343460083},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4842964708805084},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.43052470684051514},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4237889051437378},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41386646032333374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19364339113235474},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1327495276927948},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12301865220069885},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.08018907904624939}],"concepts":[{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.8018117547035217},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7659320831298828},{"id":"https://openalex.org/C206530611","wikidata":"https://www.wikidata.org/wiki/Q905896","display_name":"Diophantine equation","level":2,"score":0.6124459505081177},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5824676156044006},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5762238502502441},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.499586820602417},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.4880906343460083},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4842964708805084},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.43052470684051514},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4237889051437378},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41386646032333374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19364339113235474},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1327495276927948},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12301865220069885},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.08018907904624939},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":1,"locations":[{"id":"doi:10.1142/s012962649400020x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962649400020x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2025770640","https://openalex.org/W2029234250","https://openalex.org/W2379447811","https://openalex.org/W1553843799","https://openalex.org/W4298335810","https://openalex.org/W2462246956","https://openalex.org/W2351522589","https://openalex.org/W2387613912","https://openalex.org/W1755263897","https://openalex.org/W4313233328"],"abstract_inverted_index":{"An":[0],"important":[1],"topic":[2],"in":[3,78,89],"automatically":[4],"parallelizing":[5],"nested":[6],"loop":[7],"programs":[8],"(for":[9],"the":[10,18,24,40,75,90,95,104],"implementation":[11],"on":[12,39],"a":[13,43,82,107],"parallel":[14],"machine":[15],"or":[16],"for":[17,59],"mapping":[19],"onto":[20],"VLSI":[21],"circuits)":[22],"is":[23,37,53,103],"computation":[25],"of":[26,42,71,84,98,106,109],"linear":[27,46,110],"data":[28],"dependencies.":[29],"Recently,":[30],"Feautrier":[31],"has":[32],"developed":[33],"an":[34],"algorithm":[35,97],"which":[36],"based":[38],"solution":[41,105],"parametric":[44],"integer":[45],"program.":[47],"In":[48],"this":[49,79],"paper":[50,80],"another":[51],"method":[52,56],"presented.":[54],"This":[55],"only":[57],"works":[58],"special":[60,73],"cases":[61,74],"but":[62],"it":[63],"should":[64],"be":[65],"simpler":[66],"and":[67,87],"more":[68],"efficient.":[69],"Apart":[70],"these":[72],"extensions":[76],"suggested":[77],"provide":[81],"system":[83,108],"fewer":[85],"inequalities":[86],"variables":[88],"general":[91],"case":[92],"compared":[93],"to":[94],"original":[96],"Feautrier.":[99],"The":[100],"key":[101],"idea":[102],"diophantine":[111],"equations.":[112]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}