{"id":"https://openalex.org/W2167574751","doi":"https://doi.org/10.1142/s0218126696000212","title":"A UNIFIED ALGORITHM FOR THE ESTIMATION AND SCHEDULING OF DATA FLOW GRAPHS","display_name":"A UNIFIED ALGORITHM FOR THE ESTIMATION AND SCHEDULING OF DATA FLOW GRAPHS","publication_year":1996,"publication_date":"1996-06-01","ids":{"openalex":"https://openalex.org/W2167574751","doi":"https://doi.org/10.1142/s0218126696000212","mag":"2167574751"},"language":"en","primary_location":{"id":"doi:10.1142/s0218126696000212","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126696000212","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-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/A5103275029","display_name":"Yuan Hu","orcid":"https://orcid.org/0000-0003-0589-3779"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"YUAN HU","raw_affiliation_strings":["HaL Computer Systems, 1315 Dell Avenue, Campbell, CA 95008, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HaL Computer Systems, 1315 Dell Avenue, Campbell, CA 95008, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019287169","display_name":"B.S. Carlson","orcid":null},"institutions":[{"id":"https://openalex.org/I1327163397","display_name":"State University of New York","ror":"https://ror.org/01q1z8k08","country_code":"US","type":"education","lineage":["https://openalex.org/I1327163397"]},{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"BRADLEY S. CARLSON","raw_affiliation_strings":["The NSF Center for the Design of Analog/Digital Integrated Circuits (CDADIC) and the Department of Electrical Engineering State University of New York at Stony Brook Stony Brook, NY 11794\u20132350, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The NSF Center for the Design of Analog/Digital Integrated Circuits (CDADIC) and the Department of Electrical Engineering State University of New York at Stony Brook Stony Brook, NY 11794\u20132350, USA","institution_ids":["https://openalex.org/I59553526","https://openalex.org/I1327163397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3878,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70438328,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"06","issue":"03","first_page":"287","last_page":"318"},"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.9986000061035156,"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.9986000061035156,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9966999888420105,"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"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.993399977684021,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6500157117843628},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6048072576522827},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.589928388595581},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5576999187469482},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46613118052482605},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.46191975474357605},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4328491687774658},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.423086941242218},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.39872902631759644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33444744348526},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09746164083480835}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6500157117843628},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6048072576522827},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.589928388595581},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5576999187469482},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46613118052482605},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.46191975474357605},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4328491687774658},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.423086941242218},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.39872902631759644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33444744348526},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09746164083480835},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218126696000212","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126696000212","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2012754152","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2838819579","https://openalex.org/W2949165180","https://openalex.org/W131757205","https://openalex.org/W2384952691","https://openalex.org/W2538210412"],"abstract_inverted_index":{"A":[0],"unified":[1,108],"algorithm":[2,20,89,109,117,126,138,148],"is":[3,90,172],"presented":[4],"to":[5,37,76,84,94,102,118,154],"solve":[6,119],"the":[7,31,39,46,49,54,65,68,78,81,91,120,132,155,161,164],"problem":[8,122],"of":[9,33,67,80,135,160],"estimation":[10,100],"and":[11,43,169],"scheduling":[12,45,121,147],"for":[13],"performance":[14,40],"constrained":[15],"data":[16],"flow":[17],"graphs.":[18],"The":[19,58],"achieves":[21],"superior":[22],"results":[23,151],"by":[24],"first":[25,92],"computing":[26],"a":[27,74,96,115,128],"lower":[28,55,59,98,130,156,170],"bound":[29,56,60,99],"on":[30],"number":[32],"functional":[34],"units":[35],"required":[36],"satisfy":[38],"constraint":[41],"T,":[42],"then":[44],"operations":[47],"into":[48,114],"best":[50],"control":[51],"steps":[52],"using":[53],"algorithm.":[57],"not":[61,173],"only":[62],"greatly":[63,141],"reduces":[64],"size":[66],"solution":[69,83],"space,":[70],"but":[71],"also":[72],"provides":[73],"means":[75],"measure":[77],"proximity":[79],"final":[82],"an":[85,136],"optimal":[86,137],"one.":[87,176],"Our":[88],"one":[93],"use":[95],"sharp":[97,129],"technique":[101],"direct":[103],"scheduling.":[104],"In":[105],"addition,":[106],"our":[107,125,146,167],"can":[110,139,149],"easily":[111],"be":[112,140],"incorporated":[113],"branch-and-bound":[116],"optimally.":[123],"Since":[124],"computes":[127],"bound,":[131],"computation":[133],"time":[134],"reduced.":[142],"Experiments":[143],"indicate":[144],"that":[145],"produce":[150],"very":[152],"close":[153],"bound.":[157],"For":[158],"all":[159],"test":[162],"cases":[163],"difference":[165],"between":[166],"upper":[168],"bounds":[171],"greater":[174],"than":[175]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}