{"id":"https://openalex.org/W1606313797","doi":null,"title":"A dynamically adaptive parallelization model based on speculative multithreading","display_name":"A dynamically adaptive parallelization model based on speculative multithreading","alternate_titles":[],"publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1606313797","mag":"1606313797"},"language":"en","primary_location":{"id":"mag:1606313797","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=931717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1606313797"],"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/A5090091276","display_name":"David J. Lilja","orcid":"https://orcid.org/0000-0003-3785-8206","observed_orcids":["https://orcid.org/0000-0003-3785-8206"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"David J. Lilja","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072693324","display_name":"Iffat H. Kazi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Iffat H. Kazi","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":0.4145,"has_fulltext":false,"cited_by_count":2,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.65167061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.0003000000142492354,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.0,"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/speculative-multithreading","display_name":"speculative multithreading","score":0.9160000085830688},{"id":"https://openalex.org/keywords/loop-level-parallelism","display_name":"loop-level parallelism","score":0.8690000176429749},{"id":"https://openalex.org/keywords/dynamic-processor-allocation","display_name":"dynamic processor allocation","score":0.6909999847412109},{"id":"https://openalex.org/keywords/pipelined-execution","display_name":"pipelined execution","score":0.7540000081062317},{"id":"https://openalex.org/keywords/control-speculation","display_name":"control speculation","score":0.8579999804496765},{"id":"https://openalex.org/keywords/parallelizing-compilers","display_name":"parallelizing compilers","score":0.7059999704360962},{"id":"https://openalex.org/keywords/do-while-loop","display_name":"do-while loop","score":0.7049999833106995},{"id":"https://openalex.org/keywords/dynamic-load-balancing","display_name":"dynamic load balancing","score":0.38199999928474426}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9117693901062012},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8465923070907593},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7868804335594177},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.6769205331802368},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6601873636245728},{"id":"https://openalex.org/C15296174","wikidata":"https://www.wikidata.org/wiki/Q7575343","display_name":"Speculative multithreading","level":4,"score":0.6454436182975769},{"id":"https://openalex.org/C201410400","wikidata":"https://www.wikidata.org/wiki/Q1064412","display_name":"Multithreading","level":3,"score":0.6364303231239319},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.6254937052726746},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.534711480140686},{"id":"https://openalex.org/C3543717","wikidata":"https://www.wikidata.org/wiki/Q6007302","display_name":"Implicit parallelism","level":4,"score":0.5066316723823547},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.4985499382019043},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.46728047728538513},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.4011898636817932},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23023727536201477}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1606313797","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=931717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"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/W2068203359","https://openalex.org/W2088119230","https://openalex.org/W7096374919","https://openalex.org/W2104643467","https://openalex.org/W2028157367","https://openalex.org/W7098664187","https://openalex.org/W2069366701","https://openalex.org/W7100270250","https://openalex.org/W1990386838","https://openalex.org/W2074301136"],"abstract_inverted_index":{"A":[0,254],"wide":[1],"variety":[2],"of":[3,32,47,56,140,240,291,321,334],"application":[4],"programs":[5,245,306],"have":[6],"inherent":[7,54],"loop-level":[8,34,242],"parallelism":[9,35,50,88],"that":[10,25,64,261],"can":[11,26,92,146],"be":[12,93],"exploited":[13,94],"on":[14,217,324,342],"shared-memory":[15,222,345],"multiprocessor":[16,223,346],"systems":[17,224],"for":[18,220],"performance":[19,182],"improvement.":[20],"Parallelizing":[21],"compilers":[22],"are":[23,65,80,203],"available":[24,49,110],"automatically":[27],"identify":[28],"and":[29,249,271,328],"extract":[30,45],"some":[31],"the":[33,48,53,102,138,153,159,168,177,179,206,227,238,289,311,329,335],"in":[36,78,89,127,162,190,205,296],"sequential":[37,73,251],"programs.":[38],"Traditional":[39],"parallelizing":[40,232],"compilers,":[41],"however,":[42,150],"often":[43],"cannot":[44,136],"much":[46],"due":[51,185,195],"to":[52,82,105,123,129,186,196,225,274,287,307,310],"limitations":[55],"compile-time":[57],"information.":[58],"Loops":[59],"with":[60,72,230,246,267],"potential":[61],"data":[62],"dependences":[63],"caused":[66],"by":[67,96,176,315],"run-time":[68,98,247,268],"values,":[69],"or":[70,158,194],"loops":[71,91,108],"constructs":[74],"(e.g.":[75],"do-while":[76],"loops),":[77],"particular":[79],"impossible":[81],"parallelize":[83,106,275],"using":[84,97,340],"these":[85,107],"compilers.":[86,233],"The":[87,332],"such":[90,276],"only":[95,111],"parallelization":[99,214,257],"techniques":[100],"since":[101],"information":[103],"required":[104],"is":[109,121,259,285,338],"at":[112],"run-time.":[113],"Once":[114],"a":[115,142,163,172,211,263,279,297],"program":[116,154,169,326],"has":[117],"been":[118],"parallelized,":[119],"it":[120,126],"necessary":[122],"efficiently":[124,148,295],"execute":[125],"parallel":[128,143,180,192,293,305],"improve":[130],"its":[131],"performance.":[132],"Compiler":[133],"parallelized":[134],"code":[135,144],"predetermine":[137],"number":[139,320],"processors":[141,322],"region":[145],"most":[147],"use,":[149],"especially,":[151],"if":[152],"behavior":[155,327],"changes":[156,166],"dynamically":[157,212,308,316],"system":[160,330],"load":[161],"multiprogrammed":[164,221,298],"environment":[165,314],"as":[167],"executes.":[170],"With":[171],"static":[173],"mapping":[174],"assigned":[175],"compiler,":[178],"execution":[181,265,313],"may":[183],"suffer":[184],"an":[187,318],"insufficient":[188],"workload":[189],"each":[191],"task,":[193],"resource":[197],"contention":[198],"when":[199],"too":[200],"many":[201],"processes":[202],"running":[204],"system.":[207],"\r\nThis":[208],"thesis":[209],"proposes":[210],"adaptive":[213],"model":[215,258,266],"based":[216,323],"speculative":[218,255],"multithreading":[219,256],"address":[226,288],"problems":[228],"associated":[229],"traditional":[231],"This":[234,300],"work":[235],"first":[236],"addresses":[237],"problem":[239,290],"extracting":[241],"parallelism.":[243],"from":[244],"data-dependences":[248],"traditionally":[250],"loop":[252],"constructs.":[253],"proposed":[260,286,336],"uses":[262],"pipelined":[264],"data-dependence":[269],"checking":[270],"control":[272],"speculation":[273],"loops.":[277],"Next,":[278],"comprehensive":[280],"dynamic":[281],"processor":[282,301],"allocation":[283,302],"scheme":[284],"executing":[292],"applications":[294],"environment.":[299],"mechanism":[303],"allows":[304],"adapt":[309],"current":[312,325],"allocating":[317],"appropriate":[319],"load.":[331],"efficiency":[333],"mechanisms":[337],"evaluated":[339],"experiments":[341],"several":[343],"off-the-shelf":[344],"systems.":[347]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1606313797","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
