{"id":"https://openalex.org/W2076914069","doi":"https://doi.org/10.1145/1007912.1007923","title":"Fighting against two adversaries","display_name":"Fighting against two adversaries","publication_year":2004,"publication_date":"2004-06-27","ids":{"openalex":"https://openalex.org/W2076914069","doi":"https://doi.org/10.1145/1007912.1007923","mag":"2076914069"},"language":"en","primary_location":{"id":"doi:10.1145/1007912.1007923","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007912.1007923","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","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/A5045471772","display_name":"Marcin Bie\u0144kowski","orcid":"https://orcid.org/0000-0002-2453-7772"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Marcin Bienkowski","raw_affiliation_strings":["University of Paderborn, Germany","[University of Paderborn., Germany]"],"affiliations":[{"raw_affiliation_string":"University of Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"[University of Paderborn., Germany]","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111909754","display_name":"Miroslaw Korzeniowski","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Miroslaw Korzeniowski","raw_affiliation_strings":["University of Paderborn, Germany","[University of Paderborn., Germany]"],"affiliations":[{"raw_affiliation_string":"University of Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"[University of Paderborn., Germany]","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109961260","display_name":"Friedhelm Meyer auf der Heide","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Friedhelm Meyer auf der Heide","raw_affiliation_strings":["University of Paderborn, Germany","[University of Paderborn., Germany]"],"affiliations":[{"raw_affiliation_string":"University of Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"[University of Paderborn., Germany]","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5045471772"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":1.1587,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.82839666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"64","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":"Optimization and Search Problems","score":1.0,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8475068807601929},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6346045732498169},{"id":"https://openalex.org/keywords/page-fault","display_name":"Page fault","score":0.5690576434135437},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5581557750701904},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5490069389343262},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5489129424095154},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5403563976287842},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5095270276069641},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4729316532611847},{"id":"https://openalex.org/keywords/pace","display_name":"Pace","score":0.4506344199180603},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.44243016839027405},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4289109408855438},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3213258385658264},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.20230433344841003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16076192259788513},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.11580926179885864}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8475068807601929},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6346045732498169},{"id":"https://openalex.org/C193343404","wikidata":"https://www.wikidata.org/wiki/Q1928607","display_name":"Page fault","level":5,"score":0.5690576434135437},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5581557750701904},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5490069389343262},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5489129424095154},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5403563976287842},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5095270276069641},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4729316532611847},{"id":"https://openalex.org/C2777526511","wikidata":"https://www.wikidata.org/wiki/Q691543","display_name":"Pace","level":2,"score":0.4506344199180603},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.44243016839027405},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4289109408855438},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3213258385658264},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.20230433344841003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16076192259788513},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.11580926179885864},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C76399640","wikidata":"https://www.wikidata.org/wiki/Q189401","display_name":"Virtual memory","level":4,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1007912.1007923","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007912.1007923","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W421157177","https://openalex.org/W1486124781","https://openalex.org/W1532521488","https://openalex.org/W1552828154","https://openalex.org/W1972442117","https://openalex.org/W1977894976","https://openalex.org/W2018807138","https://openalex.org/W2041645394","https://openalex.org/W2047657708","https://openalex.org/W2049943172","https://openalex.org/W2073083283","https://openalex.org/W2074756264","https://openalex.org/W2129497745","https://openalex.org/W2129764333","https://openalex.org/W2295428206","https://openalex.org/W2913000079","https://openalex.org/W6633003778","https://openalex.org/W6644917440","https://openalex.org/W6759134498"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W1979064639","https://openalex.org/W2075784392"],"abstract_inverted_index":{"Page":[0],"migration":[1],"is":[2,33,54,150,153,273],"one":[3,25,36,61],"of":[4,11,22,29,37,99,123,147,163,176,198,204,214,243,256,269],"the":[5,9,38,49,52,58,69,77,100,110,113,121,124,135,145,148,161,171,177,180,195,199,202,212,241,251],"fundamental":[6],"subproblems":[7],"in":[8,14,18,35,65,76,133,140,155],"framework":[10],"data":[12,46],"management":[13],"networks.":[15],"It":[16],"occurs":[17],"a":[19,93,96,131,191,231,236,259,263,267],"distributed":[20],"network":[21,178],"processors":[23,42,117,257],"sharing":[24],"indivisible":[26],"memory":[27],"page":[28,59,172],"size":[30,45,203],"D,":[31],"which":[32,134,228],"stored":[34],"processors.":[39],"During":[40],"runtime,":[41],"access":[43],"unit":[44],"items":[47],"from":[48,60],"page,":[50],"and":[51,85,158,179,223,247],"system":[53],"allowed":[55],"to":[56,63,67,91,170,209],"move":[57],"processor":[62,229],"another":[64],"order":[66],"minimize":[68],"total":[70],"communication":[71,114,136,215],"cost.This":[72],"problem":[73],"was":[74],"considered":[75],"online":[78,87],"setting":[79],"numerous":[80],"times":[81],"by":[82,185,219],"many":[83],"researchers,":[84],"some":[86,186,220],"algorithms":[88],"were":[89,107,118],"proven":[90],"achieve":[92],"cost":[94],"within":[95],"constant":[97,254],"factor":[98],"optimal":[101],"offline":[102],"solution.":[103],"However,":[104,201],"all":[105],"results":[106],"achieved":[108],"under":[109],"assumption":[111],"that":[112,165,211],"costs":[115,137,216],"between":[116],"fixed":[119],"during":[120],"execution":[122],"whole":[125],"process.In":[126],"this":[127,205],"paper":[128],"we":[129,189,239],"consider":[130],"model":[132],"can":[138],"change":[139],"each":[141],"time":[142],"step,":[143],"but":[144],"pace":[146],"changes":[149,175,213],"restricted.":[151],"This":[152],"typical":[154],"mobile":[156],"networks,":[157],"also":[159],"models":[160],"dynamics":[162],"networks":[164],"are":[166,183,217],"not":[167],"exclusively":[168],"dedicated":[169],"migration.If":[173],"both":[174],"request":[181],"sequence":[182],"given":[184],"adversarial":[187],"entity,":[188],"prove":[190,248],"tight":[192],"bound":[193],"on":[194,262,266],"competitive":[196,245],"ratio":[197,206,246],"problem.":[200],"motivates":[207],"us":[208],"assume":[210],"modeled":[218],"stochastic":[221],"process,":[222],"an":[224],"adversary":[225],"dictates":[226],"only":[227],"issues":[230],"request.":[232],"To":[233],"analyze":[234],"such":[235],"hybrid":[237],"case,":[238],"introduce":[240],"notion":[242],"expected":[244],"that,":[249],"for":[250],"case":[252],"where":[253],"number":[255],"perform":[258],"random":[260],"walk":[261],"torus":[264],"or":[265],"mesh":[268],"diameter":[270],"\u221aD,":[271],"it":[272],"O(log2D).":[274]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}