{"id":"https://openalex.org/W2000087529","doi":"https://doi.org/10.1109/trustcom.2013.117","title":"Bicriteria Load Balancing for Online Placement in Heterogeneous Servers with Pareto Upper Bounds","display_name":"Bicriteria Load Balancing for Online Placement in Heterogeneous Servers with Pareto Upper Bounds","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2000087529","doi":"https://doi.org/10.1109/trustcom.2013.117","mag":"2000087529"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/trustcom.2013.117","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5103924050","display_name":"Savio S. H. Tse","orcid":null},"institutions":[{"id":"https://openalex.org/I67581229","display_name":"Istanbul University","ror":"https://ror.org/03a5qrr21","country_code":"TR","type":"education","lineage":["https://openalex.org/I67581229"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Savio S. H. Tse","raw_affiliation_strings":["Computer Engineering Department Istanbul University, Istanbul, Turkey"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department Istanbul University, Istanbul, Turkey","institution_ids":["https://openalex.org/I67581229"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103924050"],"corresponding_institution_ids":["https://openalex.org/I67581229"],"apc_list":null,"apc_paid":null,"fwci":0.229,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.219499,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":65,"max":72},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Distributed Coordination in Online Robotics Research","score":0.9999,"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/T12288","display_name":"Distributed Coordination in Online Robotics Research","score":0.9999,"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/T10715","display_name":"Distributed Grid Computing Systems","score":0.9994,"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 Problems in Manufacturing Systems","score":0.9981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/task-scheduling","display_name":"Task Scheduling","score":0.5363},{"id":"https://openalex.org/keywords/online-algorithms","display_name":"Online Algorithms","score":0.518469},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling","score":0.504137},{"id":"https://openalex.org/keywords/hybrid-optimization","display_name":"Hybrid Optimization","score":0.502018},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4749677},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.4434966},{"id":"https://openalex.org/keywords/file-server","display_name":"File server","score":0.4411545}],"concepts":[{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.9224518},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7328434},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.6244599},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.576991},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.54199314},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4770809},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4749677},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4434966},{"id":"https://openalex.org/C4373008","wikidata":"https://www.wikidata.org/wiki/Q513349","display_name":"File server","level":2,"score":0.4411545},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.33278564},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32175773},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.30245566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1779516},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13304946},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/trustcom.2013.117","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.49}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":16,"referenced_works":["https://openalex.org/W1481967026","https://openalex.org/W1566757483","https://openalex.org/W1907505623","https://openalex.org/W1993260581","https://openalex.org/W1995733312","https://openalex.org/W2005159342","https://openalex.org/W2005168154","https://openalex.org/W2007755607","https://openalex.org/W2016757663","https://openalex.org/W2017483991","https://openalex.org/W2028981745","https://openalex.org/W2104680817","https://openalex.org/W2134373629","https://openalex.org/W2139106903","https://openalex.org/W2169990765","https://openalex.org/W4237265576"],"related_works":["https://openalex.org/W4378499136","https://openalex.org/W317165722","https://openalex.org/W312725187","https://openalex.org/W2728870795","https://openalex.org/W2586328217","https://openalex.org/W2073298047","https://openalex.org/W2049264236","https://openalex.org/W2033790662","https://openalex.org/W1999828099","https://openalex.org/W1963790170"],"abstract_inverted_index":{"We":[0,51,101],"study":[1],"the":[2,29,54,62,73,79,99,131,136,146,151],"online":[3,114],"load":[4,47],"balancing":[5,106],"problem":[6],"for":[7,45,105,113,148],"two":[8],"independent":[9],"criteria":[10],"in":[11,25,78],"heterogeneous":[12],"systems.":[13],"For":[14],"convenience,":[15],"we":[16],"choose":[17],"a":[18,26,88,103,143],"system":[19],"of":[20,56,64,133,145,153],"distributed":[21],"file":[22],"servers":[23,57],"located":[24],"cluster":[27],"as":[28],"scenario,":[30],"although":[31],"our":[32,154],"work":[33],"is":[34,41,58,95,120,125,130,142],"not":[35],"limited":[36],"to":[37],"it.":[38],"Every":[39],"server":[40,94],"assigned":[42],"upper":[43,74],"bounds":[44,75],"its":[46],"and":[48,86,109,117],"storage":[49,111],"space.":[50],"assume":[52],"that":[53,81,92],"heterogeneity":[55,152],"eventually":[59],"reflected":[60],"by":[61],"difference":[63],"these":[65],"assignments":[66],"among":[67],"different":[68],"servers.":[69],"In":[70],"this":[71],"paper,":[72],"are":[76,83],"designed":[77],"way":[80],"they":[82],"totally":[84],"different,":[85],"form":[87],"pareto":[89],"set":[90],"(such":[91],"no":[93],"more":[96],"capable":[97],"than":[98],"others).":[100],"propose":[102],"solution":[104],"their":[107],"loads":[108],"required":[110],"spaces":[112],"document":[115,118],"placements,":[116],"reallocation":[119,137],"allowed.":[121],"The":[122],"time":[123],"complexity":[124],"O(log":[126],"M),":[127],"where":[128],"M":[129],"number":[132],"servers,":[134],"plus":[135],"cost":[138,141],"incurred.":[139],"This":[140],"measure":[144],"price":[147],"coping":[149],"with":[150],"model.":[155]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2000087529","counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2024-11-22T13:01:30.063486","created_date":"2016-06-24"}