{"id":"https://openalex.org/W2146781005","doi":"https://doi.org/10.1109/ipdps.2003.1213089","title":"Improving speculative thread-level parallelism through module run-length prediction","display_name":"Improving speculative thread-level parallelism through module run-length prediction","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2146781005","doi":"https://doi.org/10.1109/ipdps.2003.1213089","mag":"2146781005"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2003.1213089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},"type":"conference-paper","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/A5039584788","display_name":"Fredrik Warg","orcid":"https://orcid.org/0000-0003-4069-6252"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"F. Warg","raw_affiliation_strings":["Department of Computer Engineering, Chalmers University of Technology and G\u00f6teborg University, Sweden","Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Chalmers University of Technology and G\u00f6teborg University, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103284108","display_name":"Per Stenstr\u00f6m","orcid":"https://orcid.org/0000-0002-4280-3843"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"P. Stenstrom","raw_affiliation_strings":["Department of Computer Engineering, Chalmers University of Technology and G\u00f6teborg University, Sweden","Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Chalmers University of Technology and G\u00f6teborg University, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8","last_page":"8"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9976000189781189,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/speedup","display_name":"Speedup","score":0.9116256237030029},{"id":"https://openalex.org/keywords/speculative-multithreading","display_name":"Speculative multithreading","score":0.8579674363136292},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8104513883590698},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7867980003356934},{"id":"https://openalex.org/keywords/speculation","display_name":"Speculation","score":0.7239788770675659},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6416397094726562},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6248322129249573},{"id":"https://openalex.org/keywords/instruction-level-parallelism","display_name":"Instruction-level parallelism","score":0.4547107517719269},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.4443264603614807},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4233739972114563},{"id":"https://openalex.org/keywords/multithreading","display_name":"Multithreading","score":0.3931567966938019},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.33156388998031616},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.21431827545166016}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.9116256237030029},{"id":"https://openalex.org/C15296174","wikidata":"https://www.wikidata.org/wiki/Q7575343","display_name":"Speculative multithreading","level":4,"score":0.8579674363136292},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8104513883590698},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7867980003356934},{"id":"https://openalex.org/C47941915","wikidata":"https://www.wikidata.org/wiki/Q107885","display_name":"Speculation","level":2,"score":0.7239788770675659},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6416397094726562},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6248322129249573},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.4547107517719269},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.4443264603614807},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4233739972114563},{"id":"https://openalex.org/C201410400","wikidata":"https://www.wikidata.org/wiki/Q1064412","display_name":"Multithreading","level":3,"score":0.3931567966938019},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.33156388998031616},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.21431827545166016},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/ipdps.2003.1213089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.1095","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.1095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ce.chalmers.se/~pers/pub/c54.pdf","raw_type":"text"},{"id":"pmh:oai:publications.lib.chalmers.se:17980","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/17980-improving-speculative-thread-level-parallelism-through-module-run-length-prediction","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:17980","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/17980","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W133053153","https://openalex.org/W1525227808","https://openalex.org/W1579674405","https://openalex.org/W1733564367","https://openalex.org/W1920053666","https://openalex.org/W1958945689","https://openalex.org/W2002549773","https://openalex.org/W2029479717","https://openalex.org/W2128767431","https://openalex.org/W2135470015","https://openalex.org/W2136798749","https://openalex.org/W2136958529","https://openalex.org/W2137239834","https://openalex.org/W2143876993","https://openalex.org/W2296006986","https://openalex.org/W4229693072","https://openalex.org/W4244841987","https://openalex.org/W4247496551","https://openalex.org/W6605511539","https://openalex.org/W6637859861","https://openalex.org/W6640197266"],"related_works":["https://openalex.org/W2003935582","https://openalex.org/W2950520577","https://openalex.org/W2009213655","https://openalex.org/W1638215063","https://openalex.org/W1229628","https://openalex.org/W74409296","https://openalex.org/W2105992728","https://openalex.org/W4236721623","https://openalex.org/W2082701182","https://openalex.org/W2169040626"],"abstract_inverted_index":{"Exploiting":[0],"speculative":[1],"thread-level":[2],"parallelism":[3],"across":[4],"modules,":[5],"e.g.,":[6],"methods,":[7],"procedures,":[8],"or":[9,72],"functions,":[10],"have":[11],"shown":[12,164],"promise.":[13],"However,":[14],"misspeculations":[15],"and":[16,103,157],"task":[17],"creation":[18],"overhead":[19,92,99,126],"are":[20,32],"known":[21],"to":[22,37,45,80,165],"adversely":[23],"impact":[24,40],"the":[25,39,81,91,98,104,113,125,135,147,167],"speedup":[26,88,122],"if":[27,61,90,97],"too":[28],"many":[29],"small":[30],"modules":[31,49,66,174],"executed":[33],"speculatively.":[34],"Our":[35],"approach":[36],"reduce":[38],"of":[41,112,146,169],"these":[42],"overheads":[43],"is":[44,63,100,107,163],"disable":[46],"speculation":[47,62,171],"on":[48,65,143],"with":[50,67,175],"a":[51,54,77,131],"run-length":[52,73,105,136,161],"below":[53],"certain":[55],"threshold.":[56],"We":[57,128],"first":[58],"confirm":[59],"that":[60],"disabled":[64],"an":[68,153],"execution":[69],"time":[70],"-":[71,74],"shorter":[75],"than":[76],"threshold":[78,106],"comparable":[79],"overheads,":[82],"we":[83,116],"obtain":[84],"nearly":[85,119],"as":[86,89,120,123],"high":[87,121],"was":[93],"zero.":[94,127],"For":[95],"example,":[96],"200":[101],"cycles":[102],"500":[108],"cycles,":[109],"six":[110],"out":[111],"nine":[114],"applications":[115],"ran":[117],"enjoyed":[118],"were":[124],"then":[129],"propose":[130],"mechanism":[132],"by":[133,172],"which":[134],"can":[137],"be":[138],"predicted":[139],"at":[140],"run-time":[141],"based":[142],"previous":[144],"invocations":[145],"module.":[148],"This":[149],"simple":[150],"predictor":[151,162],"achieves":[152],"accuracy":[154],"between":[155],"83%":[156],"99%.":[158],"Finally,":[159],"our":[160],"improve":[166],"efficiency":[168],"module-level":[170],"preventing":[173],"short":[176],"run-lengths":[177],"from":[178],"occupying":[179],"precious":[180],"processing":[181],"resources.":[182]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}