{"id":"https://openalex.org/W2162081125","doi":"https://doi.org/10.1109/icpp.2002.1040919","title":"Optimal code size reduction for software-pipelined loops on DSP applications","display_name":"Optimal code size reduction for software-pipelined loops on DSP applications","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2162081125","doi":"https://doi.org/10.1109/icpp.2002.1040919","mag":"2162081125"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.2002.1040919","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2002.1040919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Conference on Parallel Processing","raw_type":"proceedings-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/A5005358696","display_name":"Qingfeng Zhuge","orcid":"https://orcid.org/0000-0002-1107-3470"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Qingfeng Zhuge","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101639532","display_name":"Zili Shao","orcid":"https://orcid.org/0000-0002-2173-2847"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zili Shao","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077381252","display_name":"Edwin H.\u2010M. Sha","orcid":"https://orcid.org/0000-0001-5605-5631"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E.H.-M. Sha","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005358696"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":1.9787,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87256918,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"613","last_page":"620"},"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/T10904","display_name":"Embedded Systems Design 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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"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/software-pipelining","display_name":"Software pipelining","score":0.8999450206756592},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8100025057792664},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5360100269317627},{"id":"https://openalex.org/keywords/retiming","display_name":"Retiming","score":0.5314143300056458},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5113010406494141},{"id":"https://openalex.org/keywords/dead-code","display_name":"Dead code","score":0.4928407669067383},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.46842801570892334},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.42803049087524414},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.3284684419631958},{"id":"https://openalex.org/keywords/redundant-code","display_name":"Redundant code","score":0.21255427598953247},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19381794333457947},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10994422435760498}],"concepts":[{"id":"https://openalex.org/C188854837","wikidata":"https://www.wikidata.org/wiki/Q268469","display_name":"Software pipelining","level":3,"score":0.8999450206756592},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8100025057792664},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5360100269317627},{"id":"https://openalex.org/C41112130","wikidata":"https://www.wikidata.org/wiki/Q2146175","display_name":"Retiming","level":2,"score":0.5314143300056458},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5113010406494141},{"id":"https://openalex.org/C47434764","wikidata":"https://www.wikidata.org/wiki/Q1770035","display_name":"Dead code","level":5,"score":0.4928407669067383},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.46842801570892334},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.42803049087524414},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.3284684419631958},{"id":"https://openalex.org/C151578736","wikidata":"https://www.wikidata.org/wiki/Q1251793","display_name":"Redundant code","level":4,"score":0.21255427598953247},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19381794333457947},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10994422435760498},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/icpp.2002.1040919","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2002.1040919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Conference on Parallel Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.224","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.224","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.utd.edu/~zlshao/papers/icpp02.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.377.1988","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.1988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cecs.uci.edu/~papers/compendium94-03/papers/2002/isss02/pdffiles/p144.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.870.6416","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.870.6416","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Edwin_Sha/publication/4033436_Optimal_code_size_reduction_for_software-pipelined_and_unfolded_loops/links/02e7e52b8697af15b4000000.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2087656024","https://openalex.org/W2140656851","https://openalex.org/W2157758640","https://openalex.org/W2170713926","https://openalex.org/W4232919122","https://openalex.org/W4244938410"],"related_works":["https://openalex.org/W2155325307","https://openalex.org/W2155582075","https://openalex.org/W4256142740","https://openalex.org/W1519734376","https://openalex.org/W1869918998","https://openalex.org/W4241609064","https://openalex.org/W2110618453","https://openalex.org/W2056616949","https://openalex.org/W4250147604","https://openalex.org/W2106473597"],"abstract_inverted_index":{"Code":[0],"size":[1,16,21,46,120,136],"expansion":[2,47],"of":[3,41,70,85,128],"software-pipelined":[4,138],"loops":[5,139],"is":[6,88],"a":[7,58,115],"critical":[8],"problem":[9],"for":[10,137],"DSP":[11],"systems":[12],"with":[13,78,118],"strict":[14],"code":[15,20,45,102,119,135,143],"constraint.":[17],"Some":[18],"ad-hoc":[19],"reduction":[22],"techniques":[23],"were":[24],"used":[25],"to":[26,28,113],"try":[27],"reduce":[29],"the":[30,38,42,53,79,93,106,126,134,142],"prologue/epilogue":[31],"produced":[32],"by":[33],"software":[34,49,80,98,107],"pipelining.":[35,50],"We":[36,72],"present":[37,57],"fundamental":[39],"understanding":[40],"relationship":[43],"between":[44,96],"and":[48,64,100,140],"Based":[51],"on":[52,67],"retiming":[54],"concept,":[55],"we":[56],"powerful":[59],"Code-size":[60],"REDuction":[61],"(CRED)":[62],"technique":[63],"its":[65],"application":[66],"various":[68],"kinds":[69],"processors.":[71],"also":[73],"provide":[74],"CRED":[75],"algorithms":[76,87,130],"integrated":[77],"pipelining":[81,99,108],"process.":[82],"One":[83],"advantage":[84],"our":[86,129],"that":[89],"it":[90],"can":[91,110],"explore":[92],"trade-off":[94,145],"space":[95],"\"perfect\"":[97],"constrained":[101],"size.":[103],"That":[104],"is,":[105],"process":[109],"be":[111],"controlled":[112],"generate":[114],"schedule":[116],"concerned":[117],"requirement.":[121],"The":[122],"experiment":[123],"results":[124],"show":[125],"effectiveness":[127],"in":[131],"both":[132],"reducing":[133],"exploring":[141],"size/performance":[144],"space.":[146]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}