{"id":"https://openalex.org/W1500189228","doi":"https://doi.org/10.1109/iscas.2003.1206201","title":"Loop scheduling for minimizing schedule length and switching activities","display_name":"Loop scheduling for minimizing schedule length and switching activities","publication_year":2003,"publication_date":"2003-11-04","ids":{"openalex":"https://openalex.org/W1500189228","doi":"https://doi.org/10.1109/iscas.2003.1206201","mag":"1500189228"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2003.1206201","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2003.1206201","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.","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/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","Dept. of Comput. Sci., Texas Univ. at Dallas, Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Texas Univ. at Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","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":false,"raw_author_name":"Qingfeng Zhuge","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","Dept. of Comput. Sci., Texas Univ. at Dallas, Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Texas Univ. at Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","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","Dept. of Comput. Sci., Texas Univ. at Dallas, Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Texas Univ. at Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052904035","display_name":"Chantana Chantrapornchai","orcid":"https://orcid.org/0000-0002-8699-5736"},"institutions":[{"id":"https://openalex.org/I86677382","display_name":"Silpakorn University","ror":"https://ror.org/02d0tyt78","country_code":"TH","type":"education","lineage":["https://openalex.org/I86677382"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"C. Chantrapornchai","raw_affiliation_strings":["Department of Mathematics, Silpakorn University, Nakhon Pathom, Thailand","Silpakorn  University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Silpakorn University, Nakhon Pathom, Thailand","institution_ids":["https://openalex.org/I86677382"]},{"raw_affiliation_string":"Silpakorn  University","institution_ids":["https://openalex.org/I86677382"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"V","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"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.9994000196456909,"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.6350487470626831},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5728485584259033},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5608502626419067},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5526184439659119},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4813738167285919},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4712555706501007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23120221495628357}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6350487470626831},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5728485584259033},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5608502626419067},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5526184439659119},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4813738167285919},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4712555706501007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23120221495628357},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscas.2003.1206201","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2003.1206201","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.114.9343","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.9343","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.utdallas.edu/~zlshao/papers/iscas03.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":13,"referenced_works":["https://openalex.org/W1821321308","https://openalex.org/W2011039300","https://openalex.org/W2050718739","https://openalex.org/W2066194644","https://openalex.org/W2087656024","https://openalex.org/W2127623895","https://openalex.org/W2135320678","https://openalex.org/W2144282545","https://openalex.org/W2162859502","https://openalex.org/W2166475245","https://openalex.org/W2170713926","https://openalex.org/W2476096155","https://openalex.org/W6610072603"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W3003077338","https://openalex.org/W2225350526","https://openalex.org/W1545991362","https://openalex.org/W3036719625"],"abstract_inverted_index":{"Switching":[0],"activity":[1],"is":[2,52,60,65,93],"one":[3,71],"of":[4],"the":[5,15,39,55,74,83,124,131,144,152],"most":[6],"important":[7],"factors":[8],"in":[9],"power":[10],"dissipation.":[11],"This":[12],"paper":[13],"studies":[14],"scheduling":[16,58,108,134,148],"problem":[17,59,75],"that":[18,32,37,116,122,146],"minimizes":[19],"both":[20,100],"schedule":[21,36,104],"length":[22,105],"and":[23,103,109,149],"switching":[24,41,80,101,125],"activities":[25,42,81,102,126],"for":[26],"applications":[27],"with":[28,47],"loops.":[29],"We":[30],"show":[31,115],"to":[33,98,130],"find":[34],"a":[35],"has":[38],"minimal":[40],"among":[43],"all":[44],"minimum-latency":[45],"schedules":[46,121],"or":[48,69],"without":[49],"resource":[50,67],"constraints":[51,68],"NP-complete.":[53],"Although":[54],"minimum":[56],"latency":[57],"polynomial-time":[61],"solvable":[62],"if":[63],"there":[64],"no":[66],"only":[70],"function":[72],"unit,":[73],"becomes":[76],"NP-complete":[77],"when":[78],"considering":[79],"as":[82],"second":[84],"constraint.":[85],"An":[86],"algorithm,":[87],"Power":[88],"Reduction":[89],"Rotation":[90],"Scheduling":[91],"(PRRS),":[92],"proposed.":[94],"The":[95,112],"algorithm":[96,118,138],"attempts":[97],"minimize":[99],"while":[106],"performing":[107],"allocation":[110,150],"simultaneously.":[111],"experimental":[113],"results":[114],"our":[117],"produces":[119],"effective":[120],"give":[123],"58.5%":[127],"less":[128],"compared":[129],"traditional":[132],"rotation":[133],"on":[135],"average.":[136],"Our":[137],"also":[139],"shows":[140],"better":[141],"performance":[142],"than":[143],"approach":[145],"considers":[147],"at":[151],"separate":[153],"phases.":[154]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}