{"id":"https://openalex.org/W2058229410","doi":"https://doi.org/10.1109/hpcsim.2013.6641407","title":"Using data-flow analysis in MAS for power-aware HPC runs","display_name":"Using data-flow analysis in MAS for power-aware HPC runs","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2058229410","doi":"https://doi.org/10.1109/hpcsim.2013.6641407","mag":"2058229410"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2013.6641407","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2013.6641407","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbilu.uni.lu/handle/10993/15700","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020868628","display_name":"S\u00e9bastien Varrette","orcid":"https://orcid.org/0000-0001-9011-851X"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":true,"raw_author_name":"Sebastien Varrette","raw_affiliation_strings":["Computer Science and Communications (CSC) Research Unit","Computer Science and Communications (CSC) Research Unit, University of Luxembourg, Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Computer Science and Communications (CSC) Research Unit","institution_ids":[]},{"raw_affiliation_string":"Computer Science and Communications (CSC) Research Unit, University of Luxembourg, Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107678280","display_name":"Gr\u00e9goire Danoy","orcid":"https://orcid.org/0000-0001-9419-4210"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gregoire Danoy","raw_affiliation_strings":["Computer Science and Communications (CSC) Research Unit"],"affiliations":[{"raw_affiliation_string":"Computer Science and Communications (CSC) Research Unit","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028181493","display_name":"Mateusz Guzek","orcid":"https://orcid.org/0000-0002-0488-6115"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Mateusz Guzek","raw_affiliation_strings":["Interdisciplinary Centre for Security, University of Luxembourg, Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Interdisciplinary Centre for Security, University of Luxembourg, Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058311932","display_name":"Pascal Bouvry","orcid":"https://orcid.org/0000-0001-9338-2834"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pascal Bouvry","raw_affiliation_strings":["Computer Science and Communications (CSC) Research Unit"],"affiliations":[{"raw_affiliation_string":"Computer Science and Communications (CSC) Research Unit","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5020868628"],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":null,"apc_paid":null,"fwci":0.3778,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67342426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"158","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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/computer-science","display_name":"Computer science","score":0.823474645614624},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.813052773475647},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5980453491210938},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.509793221950531},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.46621614694595337},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.4470337927341461},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4347035884857178},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4168759286403656},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.41481897234916687},{"id":"https://openalex.org/keywords/exascale-computing","display_name":"Exascale computing","score":0.4123760163784027},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.41143184900283813},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3930557668209076},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.34735244512557983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1561785638332367},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10938787460327148}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.823474645614624},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.813052773475647},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5980453491210938},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.509793221950531},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.46621614694595337},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.4470337927341461},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4347035884857178},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4168759286403656},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.41481897234916687},{"id":"https://openalex.org/C2778837361","wikidata":"https://www.wikidata.org/wiki/Q2450880","display_name":"Exascale computing","level":3,"score":0.4123760163784027},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.41143184900283813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3930557668209076},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.34735244512557983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1561785638332367},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10938787460327148},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/hpcsim.2013.6641407","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2013.6641407","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},{"id":"pmh:oai:orbilu.uni.lu:10993/15700","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/15700","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proc. of the IEEE Intl. Conf. on  High Performance Computing and Simulation (HPCS'13). IEEE Computer Society (2013).","raw_type":null}],"best_oa_location":{"id":"pmh:oai:orbilu.uni.lu:10993/15700","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/15700","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proc. of the IEEE Intl. Conf. on  High Performance Computing and Simulation (HPCS'13). IEEE Computer Society (2013).","raw_type":null},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8899999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1844153653","https://openalex.org/W1947134534","https://openalex.org/W2064073280","https://openalex.org/W2072725684","https://openalex.org/W2111289687","https://openalex.org/W2113941519","https://openalex.org/W2193008843","https://openalex.org/W6687226726"],"related_works":["https://openalex.org/W4318068934","https://openalex.org/W2290952066","https://openalex.org/W2355267286","https://openalex.org/W2056528600","https://openalex.org/W3128098196","https://openalex.org/W4320480730","https://openalex.org/W4320067870","https://openalex.org/W4297752063","https://openalex.org/W2366499652","https://openalex.org/W2670084885"],"abstract_inverted_index":{"With":[0],"a":[1,100,107,125,134,138,141,153,239,259,271],"growing":[2],"concern":[3],"on":[4,106,137,258,302],"the":[5,27,35,67,75,97,129,166,169,174,178,181,189,192,217,222,232,294],"considerable":[6],"energy":[7,24],"consumed":[8],"by":[9,204,235,270],"HPC":[10,80,119,265],"platforms":[11,88],"and":[12,46,63,102,224,244,253,281,299],"data":[13],"centers,":[14],"research":[15],"efforts":[16],"are":[17,55,256],"targeting":[18],"toward":[19],"green":[20],"approaches":[21,54],"with":[22],"higher":[23],"efficiency.":[25],"Hence,":[26],"use":[28,59,293],"of":[29,74,86,133,161,180,191,197,226,238,276],"low":[30],"power":[31],"processors":[32],"coming":[33],"from":[34],"mobile":[36],"market":[37],"(such":[38],"as":[39,152,287],"ARM":[40],"or":[41,114,185,290],"Intel":[42],"Atom)":[43],"gains":[44],"more":[45,47],"interest":[48],"[6].":[49],"In":[50,94,216,228],"parallel,":[51],"novel":[52],"software":[53],"mandatory":[56],"to":[57,66,78,83,111,165,188,297],"effectively":[58],"such":[60,286],"cutting-edge":[61],"technologies":[62],"dynamically":[64],"adapt":[65],"execution":[68,116,131,269,284],"being":[69],"performed.":[70],"This":[71],"remains":[72],"one":[73,176],"biggest":[76],"challenges":[77],"make":[79],"applications":[81],"able":[82],"take":[84],"advantage":[85],"Exascale":[87],"once":[89],"they":[90],"will":[91,220],"be":[92],"available.":[93],"this":[95],"context,":[96],"authors":[98],"propose":[99],"dynamic":[101],"flexible":[103],"scheme":[104],"based":[105],"Multi-Agent":[108],"System":[109],"(MAS)":[110],"handle":[112],"parallel":[113,135,278],"distributed":[115,130,260,303],"in":[117,200,213,251],"an":[118,264,268],"environment.":[120],"The":[121,158,194],"proposed":[122,212],"approach":[123],"uses":[124],"portable":[126],"representation":[127],"for":[128],"E":[132,255],"program":[136],"fixed":[139],"input:":[140],"bipartite":[142],"Direct":[143],"Acyclic":[144],"Graph":[145,156],"(DAG)":[146],"G":[147,201,243,252,296],"=":[148,206,246],"(v,":[149],"\u03b5)":[150],"known":[151],"macro":[154],"DataFlow":[155],"(DFG).":[157],"first":[159],"class":[160],"vertices":[162],"is":[163,202,211,274],"associated":[164],"tasks":[167,182,198],"(in":[168],"sequential":[170],"scheduling":[171],"sense)":[172],"whereas":[173],"second":[175],"represents":[177],"parameters":[179],"(either":[183],"inputs":[184],"outputs":[186],"according":[187],"direction":[190],"edge).":[193],"total":[195],"number":[196],"Tj":[199],"denoted":[203],"|G|":[205],"n.":[207],"A":[208],"DFG":[209],"example":[210],"Figure":[214],"1.":[215],"following,":[218],"we":[219],"adopt":[221],"notation":[223],"assumptions":[225],"[7].":[227],"particular,":[229],"G>(T)":[230,247],"denotes":[231],"sub-graph":[233],"induced":[234],"all":[236],"successors":[237],"task":[240],"T":[241],"\u2208":[242],"G\u2265(T)":[245],"\u222a":[248],"{T}.":[249],"Tasks":[250],"therefore":[254],"computed":[257],"computing":[261],"platform,":[262],"typically":[263],"system.":[266],"Modelling":[267],"data-flow":[272],"graph":[273,295],"part":[275],"many":[277],"programming":[279],"languages":[280],"some":[282],"efficient":[283],"engines":[285],"Kaapi":[288],"[3]":[289],"Cilk":[291],"[2]":[292],"schedule":[298],"execute":[300],"programs":[301],"architectures.":[304]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}