{"id":"https://openalex.org/W4232059819","doi":"https://doi.org/10.1109/micro.2003.1253245","title":"Reducing design complexity of the load/store queue","display_name":"Reducing design complexity of the load/store queue","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W4232059819","doi":"https://doi.org/10.1109/micro.2003.1253245"},"language":"en","primary_location":{"id":"doi:10.1109/micro.2003.1253245","is_oa":false,"landing_page_url":"https://doi.org/10.1109/micro.2003.1253245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 36th Annual IEEE/ACM International Symposium on Microarchitecture, 2003. MICRO-36.","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/A5003271080","display_name":"I. Park","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I. Park","raw_affiliation_strings":["Purdue University","School of Electrical and Computer Engineering, Purdue University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023947767","display_name":"Chong Liang Ooi","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chong Liang Ooi","raw_affiliation_strings":["Purdue University","School of Electrical and Computer Engineering, Purdue University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103145581","display_name":"T. N. Vijaykumar","orcid":"https://orcid.org/0000-0001-6624-4372"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T.N. Vijaykumar","raw_affiliation_strings":["Purdue University","School of Electrical and Computer Engineering, Purdue University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":6.0605,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.97164682,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"411","last_page":"422"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8216496706008911},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6129259467124939},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6117388010025024},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.49271276593208313},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.4631836414337158},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15806832909584045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08641445636749268}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8216496706008911},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6129259467124939},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6117388010025024},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.49271276593208313},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4631836414337158},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15806832909584045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08641445636749268},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/micro.2003.1253245","is_oa":false,"landing_page_url":"https://doi.org/10.1109/micro.2003.1253245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 36th Annual IEEE/ACM International Symposium on Microarchitecture, 2003. MICRO-36.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.2618","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.2618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.microarch.org/micro36/html/./pdf/park-ReducingDesign.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.5799999833106995,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2916411819","https://openalex.org/W4236892585","https://openalex.org/W4237835763","https://openalex.org/W4242771098","https://openalex.org/W4243665729","https://openalex.org/W4244227015","https://openalex.org/W4244495268","https://openalex.org/W6657727070"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W2382290278","https://openalex.org/W4395014643"],"abstract_inverted_index":{"With":[0],"faster":[1],"CPU":[2],"clocks":[3],"and":[4,26,51,66,74,106,115,132,161,182,184,188,192],"wider":[5],"pipelines,":[6],"all":[7,172],"relevant":[8],"microarchitecture":[9],"components":[10],"should":[11],"scale":[12,83,95,120],"accordingly.":[13],"There":[14],"have":[15],"been":[16,32],"many":[17],"proposals":[18],"for":[19,34,158,163,190],"scaling":[20,35],"the":[21,36,40,44,84,96,111,121,148],"issue":[22],"queue,":[23,38],"register":[24],"file,":[25],"cache":[27],"hierarchy.":[28],"However,":[29],"nothing":[30],"has":[31],"done":[33],"load/store":[37,45,55,85,97,127,144,169,200],"despite":[39],"increasing":[41],"pressure":[42],"on":[43,178],"queue":[46,56,128,170],"in":[47],"terms":[48],"of":[49,156,173],"capacity":[50],"search":[52,112],"bandwidth.":[53],"The":[54],"is":[57,80],"a":[58,126,141,197],"CAM":[59],"structure":[60],"which":[61],"holds":[62],"in-flight":[63],"memory":[64,72,75],"instructions":[65],"supports":[67],"simultaneous":[68],"searches":[69],"to":[70,82,94,109,119,139,147,186],"honor":[71],"dependencies":[73],"consistency":[76],"models.":[77],"Therefore,":[78],"it":[79],"difficult":[81],"queue.":[86,98,145,201],"In":[87],"this":[88],"study,":[89],"we":[90],"introduce":[91],"novel":[92],"techniques":[93,175],"We":[99,123],"propose":[100],"two":[101],"techniques,":[102],"store-load":[103],"pair":[104],"predictor":[105,131],"load":[107,133],"buffer,":[108],"reduce":[110],"bandwidth":[113],"requirement;":[114],"one":[116,137],"technique,":[117],"segmentation,":[118],"size.":[122],"show":[124],"that":[125],"using":[129,171],"our":[130,174],"buffer":[134],"needs":[135],"only":[136],"port":[138],"outperform":[140],"conventional":[142,199],"two-ported":[143,198],"Compared":[146],"same":[149],"base":[150],"case,":[151],"segmentation":[152],"alone":[153],"achieves":[154],"speedups":[155],"5%":[157],"integer":[159,191],"benchmarks":[160],"19%":[162],"floating":[164],"point":[165],"benchmarks.":[166],"A":[167],"one-ported":[168],"improves":[176],"performance":[177],"average":[179],"by":[180],"6%":[181],"23%,":[183],"up":[185],"15%":[187],"59%,":[189],"floating-point":[193],"benchmarks,":[194],"respectively,":[195],"over":[196]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}