{"id":"https://openalex.org/W2005209976","doi":"https://doi.org/10.1134/s0361768810010044","title":"Detection of parallel executable steps for programs with arrays","display_name":"Detection of parallel executable steps for programs with arrays","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2005209976","doi":"https://doi.org/10.1134/s0361768810010044","mag":"2005209976"},"language":"en","primary_location":{"id":"doi:10.1134/s0361768810010044","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s0361768810010044","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","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/A5066944279","display_name":"R. Nuriyev","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Nuriyev","raw_affiliation_strings":["Financial Frontier LLC, 8 Garnet Lane, Princeton, NJ, 08550, USA","Financial Frontier LLC, Princeton, USA 08550#TAB#"],"affiliations":[{"raw_affiliation_string":"Financial Frontier LLC, 8 Garnet Lane, Princeton, NJ, 08550, USA","institution_ids":[]},{"raw_affiliation_string":"Financial Frontier LLC, Princeton, USA 08550#TAB#","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066944279"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0851884,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"1","first_page":"19","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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.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/T11005","display_name":"Radiation Effects in Electronics","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7240564823150635},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.6890466213226318},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.47838345170021057},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4323461055755615},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4299900531768799},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42806482315063477},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.4248877763748169},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33124732971191406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23787471652030945},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12258905172348022}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7240564823150635},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.6890466213226318},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.47838345170021057},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4323461055755615},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4299900531768799},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42806482315063477},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4248877763748169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33124732971191406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23787471652030945},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12258905172348022},{"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.1134/s0361768810010044","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s0361768810010044","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W145372873","https://openalex.org/W2072213119","https://openalex.org/W4388780186"],"related_works":["https://openalex.org/W2350278424","https://openalex.org/W2071432835","https://openalex.org/W4234371507","https://openalex.org/W4299534542","https://openalex.org/W82161441","https://openalex.org/W1576042299","https://openalex.org/W1990602094","https://openalex.org/W2181943964","https://openalex.org/W1528423264","https://openalex.org/W2898214470"],"abstract_inverted_index":{"The":[0,42],"detection":[1],"of":[2,26,31,44,52,63,75,77,79,86,101,133,141,153,169,215],"informational":[3,131],"and":[4,34,55,150],"logical":[5],"program":[6,45,219],"step":[7],"dependencies":[8,132],"is":[9,47,96,115,172,191,234],"a":[10,72,99,117,139,197,213],"key":[11],"problem":[12,23,190],"when":[13,183],"performing":[14],"equivalent":[15],"transformations.":[16],"In":[17],"this":[18,22],"article":[19],"we":[20],"consider":[21],"for":[24,61,82,94,108,181,218,240],"systems":[25,171],"loops":[27,87],"which":[28],"represent":[29],"concentration":[30],"mass":[32],"computations":[33],"are":[35,122,136,165,186],"the":[36,109,160,167,184,189,208,241],"biggest":[37],"challenge":[38],"in":[39,207,246,251],"parallel":[40],"execution.":[41],"prototype":[43],"formalization":[46],"C":[48],"language":[49,60],"just":[50],"because":[51],"it\u2019s":[53],"popularity":[54],"it":[56],"being":[57],"an":[58,80,173,237],"intermediate":[59],"compilation":[62],"most":[64],"programming":[65,201],"languages":[66,202],"including":[67],"object-oriented":[68],"ones.":[69],"We":[70,211],"present":[71],"shorter":[73],"version":[74],"proof":[76],"existence":[78],"algorithm":[81],"transforming":[83],"any":[84,229],"system":[85,140],"to":[88,124,199,223],"separated":[89],"form":[90],"where":[91,162],"data":[92,105,216,226],"selection":[93],"processing":[95],"represented":[97],"as":[98,125,221],"chain":[100],"procedures":[102,121],"that":[103,145],"select":[104,224],"at":[106],"least":[107],"immediately":[110],"following":[111],"procedures.":[112],"Last":[113],"procedure":[114],"called":[116],"loop":[118,126,134,147,209],"kernel;":[119],"other":[120],"referred":[123],"controllers.":[127],"For":[128,159,177],"such":[129,170],"programs":[130,161],"iterations":[135],"determined":[137],"by":[138],"natural":[142],"number":[143],"equations":[144],"connect":[146],"controller":[148],"functions":[149,164,185],"index":[151],"expressions":[152],"array":[154,157,225],"variables":[155],"or":[156],"pointers.":[158],"these":[163],"linear,":[166],"solution":[168],"algorithmically":[174,192,204],"solvable":[175],"problem.":[176],"more":[178],"complex":[179],"cases,":[180],"example":[182],"arbitrary":[187],"polynomials,":[188],"unsolvable.":[193],"This":[194,232],"result":[195],"points":[196],"way":[198],"construct":[200],"with":[203,228],"detectable":[205],"parallelism":[206],"kernels.":[210],"introduce":[212],"notion":[214],"fullness":[217,239],"classes":[220],"ability":[222],"elements":[227],"algorithmic":[230,238],"function.":[231],"characteristic":[233],"different":[235],"from":[236],"classes-class":[242],"may":[243],"be":[244],"full":[245],"one":[247],"sense":[248],"but":[249],"not":[250],"another.":[252]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}