{"id":"https://openalex.org/W2165254807","doi":"https://doi.org/10.1109/ipdps.2004.1303173","title":"Models for scheduling on large scale platforms: which policy for which application?","display_name":"Models for scheduling on large scale platforms: which policy for which application?","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2165254807","doi":"https://doi.org/10.1109/ipdps.2004.1303173","mag":"2165254807"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1303173","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303173","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"},"type":"preprint","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/A5004264253","display_name":"Pierre-Fran\u00e7ois Dutot","orcid":"https://orcid.org/0000-0002-1992-3388"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P.-F. Dutot","raw_affiliation_strings":["ID-IMAG, Montbonnot Saint Martin, France","Parallel algorithms and load sharing","Informatique et Distribution"],"affiliations":[{"raw_affiliation_string":"ID-IMAG, Montbonnot Saint Martin, France","institution_ids":[]},{"raw_affiliation_string":"Parallel algorithms and load sharing","institution_ids":[]},{"raw_affiliation_string":"Informatique et Distribution","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042887038","display_name":"Lionel Eyraud","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L. Eyraud","raw_affiliation_strings":["ID-IMAG, Montbonnot Saint Martin, France","Informatique et Distribution","Parallel algorithms and load sharing"],"affiliations":[{"raw_affiliation_string":"ID-IMAG, Montbonnot Saint Martin, France","institution_ids":[]},{"raw_affiliation_string":"Informatique et Distribution","institution_ids":[]},{"raw_affiliation_string":"Parallel algorithms and load sharing","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086790943","display_name":"Gr\u00e9gory Mouni\u00e9","orcid":"https://orcid.org/0000-0002-6757-7432"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. Mounie","raw_affiliation_strings":["ID-IMAG, Montbonnot Saint Martin, France","Informatique et Distribution","Parallel algorithms and load sharing"],"affiliations":[{"raw_affiliation_string":"ID-IMAG, Montbonnot Saint Martin, France","institution_ids":[]},{"raw_affiliation_string":"Informatique et Distribution","institution_ids":[]},{"raw_affiliation_string":"Parallel algorithms and load sharing","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106430515","display_name":"Denis Trystram","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Trystram","raw_affiliation_strings":["ID-IMAG, Montbonnot Saint Martin, France","Parallel algorithms and load sharing","Informatique et Distribution"],"affiliations":[{"raw_affiliation_string":"ID-IMAG, Montbonnot Saint Martin, France","institution_ids":[]},{"raw_affiliation_string":"Parallel algorithms and load sharing","institution_ids":[]},{"raw_affiliation_string":"Informatique et Distribution","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5004264253"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.23625326,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.64016528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"178"},"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.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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing 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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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.8452171087265015},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6594682931900024},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5903687477111816},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5813037753105164},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.512607753276825},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.43657395243644714},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4308525323867798},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23764142394065857},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.13362804055213928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07931920886039734}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8452171087265015},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6594682931900024},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5903687477111816},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5813037753105164},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.512607753276825},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.43657395243644714},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4308525323867798},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23764142394065857},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.13362804055213928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07931920886039734},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2004.1303173","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303173","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4699999988079071,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W606453859","https://openalex.org/W1850405760","https://openalex.org/W1983347794","https://openalex.org/W2009356031","https://openalex.org/W2016559894","https://openalex.org/W2032392871","https://openalex.org/W2036894611","https://openalex.org/W2038438147","https://openalex.org/W2050487400","https://openalex.org/W2064757275","https://openalex.org/W2065689629","https://openalex.org/W2078678742","https://openalex.org/W2084606150","https://openalex.org/W2093979815","https://openalex.org/W2125266303","https://openalex.org/W2142932691","https://openalex.org/W2148204686","https://openalex.org/W2151038512","https://openalex.org/W2165606466","https://openalex.org/W2167170540","https://openalex.org/W2179639784"],"related_works":["https://openalex.org/W1993039745","https://openalex.org/W1581129489","https://openalex.org/W2369252416","https://openalex.org/W1809394610","https://openalex.org/W2128410848","https://openalex.org/W2014085448","https://openalex.org/W2102390841","https://openalex.org/W2118368532","https://openalex.org/W3047653192","https://openalex.org/W2096289371"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"In":[4],"recent":[5],"years,":[6],"there":[7],"was":[8],"a":[9,43,77,94,109,112,156],"huge":[10],"development":[11],"of":[12,21,35,46,86,111,115,126,178,183],"low":[13],"cost":[14],"large":[15,113],"scale":[16],"parallel":[17,23,82],"systems.":[18],"The":[19],"design":[20],"efficient":[22],"algorithms":[24,150],"has":[25],"to":[26,29,60,131,136,140,166,174],"be":[27],"reconsidered":[28],"take":[30,61],"into":[31,62],"account":[32,63],"new":[33,65,124,160],"parameters":[34],"such":[36],"execution":[37,161],"platforms":[38],"which":[39],"are":[40],"characterized":[41],"by":[42],"larger":[44],"number":[45,114],"heterogeneous":[47],"processors,":[48],"often":[49],"organized":[50],"as":[51,108],"hierarchical":[52],"subsystems.":[53],"Alternative":[54],"computational":[55,181],"models":[56],"have":[57],"been":[58],"designed":[59],"these":[64,168],"characteristics.":[66],"Parallel":[67],"tasks":[68],"model":[69,101,154,173],"/spl":[70],"times/":[71],"PT":[72,153],"in":[73],"short":[74],"-":[75,117,119],"is":[76,92,97,106],"promising":[78],"alternative":[79],"for":[80,151],"scheduling":[81],"applications.":[83],"Another":[84],"way":[85],"looking":[87],"at":[88],"the":[89,98,127,152,171,176],"problem":[90,128],"(which":[91],"somehow":[93],"dual":[95],"view)":[96],"divisible":[99],"load":[100],"(DL)":[102],"where":[103],"an":[104,179],"application":[105],"considered":[107],"collection":[110],"elementary":[116],"sequential":[118],"computing":[120],"units.":[121],"These":[122],"two":[123],"views":[125],"allow":[129],"us":[130],"consider":[132],"communications":[133],"implicitly":[134],"or":[135],"mask":[137],"them,":[138],"leading":[139],"more":[141],"tractable":[142],"problems.":[143],"This":[144],"paper,":[145],"first,":[146],"presents":[147],"some":[148],"approximation":[149],"with":[155,170],"special":[157],"emphasis":[158],"on":[159],"platforms.":[162],"We":[163],"show":[164],"how":[165],"mix":[167],"results":[169],"DL":[172],"manage":[175],"resources":[177],"actual":[180],"grid":[182],"600":[184],"processors.":[185]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}