{"id":"https://openalex.org/W2012158330","doi":"https://doi.org/10.3166/tsi.31.1251-1271","title":"\u00c9quilibrage dynamique avec nombre variable de processeurs par une m\u00e9thode de repartitionnement de graphe","display_name":"\u00c9quilibrage dynamique avec nombre variable de processeurs par une m\u00e9thode de repartitionnement de graphe","publication_year":2012,"publication_date":"2012-12-30","ids":{"openalex":"https://openalex.org/W2012158330","doi":"https://doi.org/10.3166/tsi.31.1251-1271","mag":"2012158330"},"language":"fr","primary_location":{"id":"doi:10.3166/tsi.31.1251-1271","is_oa":false,"landing_page_url":"https://doi.org/10.3166/tsi.31.1251-1271","pdf_url":null,"source":{"id":"https://openalex.org/S4210191397","display_name":"Techniques et sciences informatiques","issn_l":"0752-4072","issn":["0752-4072","2116-5920"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Techniques et sciences informatiques","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/A5028711605","display_name":"Cl\u00e9ment Vuchener","orcid":null},"institutions":[{"id":"https://openalex.org/I86122600","display_name":"Numerical Algorithms Group (United Kingdom)","ror":"https://ror.org/04pcnys31","country_code":"GB","type":"company","lineage":["https://openalex.org/I86122600"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Cl\u00e9ment Vuchener","raw_affiliation_strings":["High-End Parallel Algorithms for Challenging Numerical Simulations"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"High-End Parallel Algorithms for Challenging Numerical Simulations","institution_ids":["https://openalex.org/I86122600"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051446286","display_name":"Aur\u00e9lien Esnard","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Aur\u00e9lien Esnard","raw_affiliation_strings":["Laboratoire Bordelais de Recherche en Informatique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09078319,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"8-10","first_page":"1251","last_page":"1271"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9843000173568726,"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/T11478","display_name":"Caching and Content Delivery","score":0.9783999919891357,"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/mathematics","display_name":"Mathematics","score":0.5654048919677734}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5654048919677734}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3166/tsi.31.1251-1271","is_oa":false,"landing_page_url":"https://doi.org/10.3166/tsi.31.1251-1271","pdf_url":null,"source":{"id":"https://openalex.org/S4210191397","display_name":"Techniques et sciences informatiques","issn_l":"0752-4072","issn":["0752-4072","2116-5920"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Techniques et sciences informatiques","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1488913773","https://openalex.org/W1591454964","https://openalex.org/W1984872340","https://openalex.org/W1998658698","https://openalex.org/W2016358147","https://openalex.org/W2059946383","https://openalex.org/W2065472596","https://openalex.org/W2122403196","https://openalex.org/W2166820607","https://openalex.org/W4233901445","https://openalex.org/W4235597383"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"L'\u00e9quilibrage":[0],"dynamique":[1],"de":[2,17,39,51,60,62,74,76,79,84,111,113],"charge":[3,19,90],"est":[4,20,41,93],"une":[5],"\u00e9tape":[6],"cruciale":[7],"qui":[8],"conditionne":[9],"la":[10,18,63,89,99,102],"performance":[11,137],"des":[12,24,65,104],"codes":[13,140],"adaptatifs":[14],"dont":[15],"l'\u00e9volution":[16],"difficilement":[21],"pr\u00e9visible.N\u00e9anmoins,":[22],"l'ensemble":[23],"travaux":[25,122],"dans":[26,68],"ce":[27],"domaine":[28],"se":[29],"limitent":[30],"-\u00e0":[31],"notre":[32],"connaissance":[33],"-au":[34],"cas":[35],"o\u00f9":[36],"le":[37,82],"nombre":[38,83],"processeurs":[40],"fix\u00e9":[42],"initialement":[43],"et":[44,101],"n'est":[45],"pas":[46],"remis":[47],"en":[48,86,106,123],"cause":[49],"lors":[50],"l'\u00e9quilibrage.Cela":[52],"peut":[53],"s'av\u00e9rer":[54],"particuli\u00e8rement":[55],"inefficace,":[56],"notamment":[57],"du":[58,91],"point":[59],"vue":[61],"consommation":[64],"ressources.Nous":[66],"proposons":[67],"cet":[69],"article":[70],"deux":[71],"nouveaux":[72],"algorithmes":[73,96],"repartitionnement":[75],"graphe":[77,92,114],"permettant":[78],"faire":[80],"varier":[81],"processeurs,":[85],"supposant":[87],"que":[88],"d\u00e9j\u00e0":[94],"\u00e9quilibr\u00e9e.Ces":[95],"optimisent":[97],"conjointement":[98],"coupe":[100],"migration":[103,212],"donn\u00e9es":[105],"s'appuyant":[107],"sur":[108],"un":[109],"mod\u00e8le":[110],"partitionnement":[112],"\u00e0":[115,126],"sommets":[116],"fixes.Des":[117],"r\u00e9sultats":[118],"exp\u00e9rimentaux":[119],"valident":[120],"nos":[121],"les":[124],"comparant":[125],"d'autres":[127],"approches.ABSTRACT.Dynamic":[128],"load":[129,142,201],"balancing":[130,170],"is":[131,144,165,202],"an":[132,158],"important":[133],"step":[134],"affecting":[135],"the":[136,169,200],"of":[138,162,180,197],"adaptive":[139],"whose":[141],"evolution":[143],"difficult":[145],"to":[146,157],"predict.Nevertheless,":[147],"as":[148,150],"far":[149],"we":[151,185],"know,":[152],"other":[153,226],"studies":[154],"are":[155],"limited":[156],"initially":[159],"fixed":[160,217],"number":[161,196],"processors":[163],"which":[164,192],"not":[166],"modified":[167],"during":[168],"phase.It":[171],"can":[172],"be":[173],"very":[174],"inefficient,":[175],"more":[176],"particularly":[177],"in":[178],"terms":[179],"resource":[181],"consumption.In":[182],"this":[183],"paper,":[184],"present":[186],"two":[187],"new":[188],"graph":[189,214],"repartitioning":[190],"algorithms":[191,205],"permit":[193],"a":[194],"variable":[195],"processors,":[198],"assuming":[199],"already":[203],"balanced.These":[204],"optimize":[206],"both":[207],"edge":[208],"cut":[209],"and":[210],"data":[211],"using":[213],"partitioning":[215],"with":[216,225],"vertices.Experimental":[218],"results":[219],"validate":[220],"our":[221],"work":[222],"comparing":[223],"it":[224],"approaches.":[227],"MOTS-CL\u00c9S":[228],":":[229]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}