{"id":"https://openalex.org/W2145219443","doi":"https://doi.org/10.1109/icpp.2002.1040917","title":"Power aware scheduling for AND/OR graphs in multiprocessor real-time systems","display_name":"Power aware scheduling for AND/OR graphs in multiprocessor real-time systems","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2145219443","doi":"https://doi.org/10.1109/icpp.2002.1040917","mag":"2145219443"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.2002.1040917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2002.1040917","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/A5012210223","display_name":"Dakai Zhu","orcid":"https://orcid.org/0000-0002-1938-9947"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dakai Zhu","raw_affiliation_strings":["Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023267014","display_name":"Nevine AbouGhazaleh","orcid":null},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. AbouGhazaleh","raw_affiliation_strings":["Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088337929","display_name":"Daniel Moss\u00e9","orcid":"https://orcid.org/0000-0002-9508-9815"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Mosse","raw_affiliation_strings":["Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038997010","display_name":"Rami Melhem","orcid":"https://orcid.org/0000-0001-6403-5446"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Melhem","raw_affiliation_strings":["Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5012210223"],"corresponding_institution_ids":["https://openalex.org/I170201317"],"apc_list":null,"apc_paid":null,"fwci":3.4628,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.92660808,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"593","last_page":"601"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994999766349792,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994999766349792,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9979000091552734,"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.9926000237464905,"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.8452717065811157},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6220279932022095},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5835204124450684},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.541902482509613},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.524367094039917},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.5185295343399048},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4267335534095764},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41960546374320984},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20735198259353638},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19841870665550232}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8452717065811157},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6220279932022095},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5835204124450684},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.541902482509613},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.524367094039917},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.5185295343399048},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4267335534095764},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41960546374320984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20735198259353638},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19841870665550232},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/icpp.2002.1040917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2002.1040917","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.12.8982","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8982","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.pitt.edu/PARTS/papers/ICPP02_zhu.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.577.3697","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.577.3697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utsa.edu/~dzhu/papers/ICPP02-zhu.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.5657","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.5657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.pitt.edu/~nevine/papers/icpp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1496667578","https://openalex.org/W1503149663","https://openalex.org/W1525641234","https://openalex.org/W1597523750","https://openalex.org/W1633471522","https://openalex.org/W1976631888","https://openalex.org/W2005456951","https://openalex.org/W2019285863","https://openalex.org/W2032094184","https://openalex.org/W2062984764","https://openalex.org/W2088337139","https://openalex.org/W2093582532","https://openalex.org/W2128991755","https://openalex.org/W2132195400","https://openalex.org/W2133079932","https://openalex.org/W2145815796","https://openalex.org/W2148215864","https://openalex.org/W2155237069","https://openalex.org/W2166243422","https://openalex.org/W3143607145","https://openalex.org/W4236165415","https://openalex.org/W6630058691","https://openalex.org/W6631471275","https://openalex.org/W6666054337","https://openalex.org/W6671972007"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1993210935","https://openalex.org/W1979183926"],"abstract_inverted_index":{"Power":[0],"aware":[1],"computing":[2],"has":[3],"become":[4],"popular":[5],"recently":[6],"and":[7,72,169],"many":[8],"techniques":[9],"have":[10,23,50],"been":[11],"proposed":[12,25],"to":[13,66,93,120,152],"manage":[14],"the":[15,68,103,107,125,132,137,140,146,160,171,184],"energy":[16,122,153],"consumption":[17],"for":[18,33,90],"traditional":[19,91],"real-time":[20,47],"applications.":[21],"We":[22],"previously":[24],"(2001)":[26],"two":[27],"greedy":[28,86,161,172],"slack":[29,87],"sharing":[30,88],"scheduling":[31,116],"algorithms":[32,117,147],"such":[34],"applications":[35,48,92,96,138],"on":[36],"multi-processor":[37],"systems.":[38],"In":[39],"this":[40,78],"paper,":[41],"we":[42,83,109],"are":[43],"concerned":[44],"mainly":[45],"with":[46,95,150],"that":[49,118,136,159,170],"different":[51,56],"execution":[52],"paths":[53],"consisting":[54],"of":[55,58,77,114,127,145],"number":[57,126],"tasks.":[59],"The":[60,75,143,155],"AND/OR":[61,99],"graph":[62],"model":[63],"is":[64,80,148,163,174],"used":[65],"represent":[67],"application":[69],"data":[70],"dependence":[71],"control":[73],"flow.":[74],"contribution":[76],"paper":[79],"twofold.":[81],"First,":[82],"extend":[84],"our":[85],"algorithm":[89],"deal":[94],"represented":[97],"by":[98,123],"graphs.":[100],"Then,":[101],"using":[102],"statistical":[104],"information":[105],"about":[106],"applications,":[108],"propose":[110],"a":[111,178],"few":[112],"variations":[113],"speculative":[115,167],"intend":[119],"save":[121],"reducing":[124],"speed":[128,181],"changes":[129],"(and":[130],"thus":[131],"overhead)":[133],"while":[134],"ensuring":[135],"meet":[139],"timing":[141],"constraints.":[142],"performance":[144],"analyzed":[149],"respect":[151],"savings.":[154],"results":[156],"obtained":[157],"show":[158],"scheme":[162,173],"better":[164],"than":[165],"some":[166],"schemes":[168],"good":[175],"enough":[176],"when":[177],"reasonable":[179],"minimal":[180],"exists":[182],"in":[183],"system.":[185]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}