{"id":"https://openalex.org/W2005741110","doi":"https://doi.org/10.1145/1073970.1074016","title":"Dynamic page migration with stochastic requests","display_name":"Dynamic page migration with stochastic requests","publication_year":2005,"publication_date":"2005-07-18","ids":{"openalex":"https://openalex.org/W2005741110","doi":"https://doi.org/10.1145/1073970.1074016","mag":"2005741110"},"language":"en","primary_location":{"id":"doi:10.1145/1073970.1074016","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1074016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth 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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045471772"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":0.5191,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7149467,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"270","last_page":"278"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"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.801220178604126},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.616733193397522},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5738241672515869},{"id":"https://openalex.org/keywords/page-fault","display_name":"Page fault","score":0.549141526222229},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45125943422317505},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.42109981179237366},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.40010714530944824},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.2420598566532135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23117628693580627}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.801220178604126},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.616733193397522},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5738241672515869},{"id":"https://openalex.org/C193343404","wikidata":"https://www.wikidata.org/wiki/Q1928607","display_name":"Page fault","level":5,"score":0.549141526222229},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45125943422317505},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.42109981179237366},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.40010714530944824},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.2420598566532135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23117628693580627},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C76399640","wikidata":"https://www.wikidata.org/wiki/Q189401","display_name":"Virtual memory","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1073970.1074016","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1074016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8899999856948853,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W421157177","https://openalex.org/W1486124781","https://openalex.org/W1536568197","https://openalex.org/W1552828154","https://openalex.org/W1562466228","https://openalex.org/W1977894976","https://openalex.org/W2007513370","https://openalex.org/W2009239786","https://openalex.org/W2030810980","https://openalex.org/W2041645394","https://openalex.org/W2073083283","https://openalex.org/W2075784392","https://openalex.org/W2076914069","https://openalex.org/W2092340542","https://openalex.org/W2129764333","https://openalex.org/W2145417574","https://openalex.org/W2148252813","https://openalex.org/W2157005274","https://openalex.org/W2159472851","https://openalex.org/W2396766219","https://openalex.org/W2990081450","https://openalex.org/W3008609509","https://openalex.org/W6633003778","https://openalex.org/W6643388834"],"related_works":["https://openalex.org/W3086346548","https://openalex.org/W4324137540","https://openalex.org/W2753300869","https://openalex.org/W2797349320","https://openalex.org/W2059368477","https://openalex.org/W2001850337","https://openalex.org/W1979064639","https://openalex.org/W2075784392","https://openalex.org/W1009057809","https://openalex.org/W2951962248"],"abstract_inverted_index":{"The":[0,53,114],"page":[1,25,49,62,79],"migration":[2],"problem":[3,54,73],"is":[4,44,55,74,99,131,144,163,217,249,273],"one":[5,22],"of":[6,8,19,26,36,61,97,116,128,161,167,183,226],"subproblems":[7],"data":[9,37],"management":[10],"in":[11,15,91,121,165,194,199,220,223,237,244],"networks.":[12,93],"It":[13,81],"occurs":[14],"a":[16,34,59,110,155,233,242,258],"distributed":[17],"network":[18,86,203,247],"processors":[20,32,105],"sharing":[21],"indivisible":[23],"memory":[24],"size":[27],"D.":[28],"During":[29],"runtime,":[30],"the":[31,39,42,48,51,66,78,85,95,102,117,122,134,159,172,180,184,190,195,214,224,227,246,252],"access":[33],"unit":[35],"from":[38],"page,":[40],"and":[41,158,205,222,269,277],"system":[43],"allowed":[45],"to":[46,56,64,77,83,133,139,179],"migrate":[47],"between":[50,104,125,136],"processors.":[52],"compute":[57],"(on-line)":[58],"schedule":[60],"movements":[63],"minimize":[65],"total":[67,191],"communication":[68,123,162],"cost.The":[69],"Dynamic":[70],"Page":[71],"Migration":[72],"an":[75,211,263],"extension":[76],"migration.":[80],"attempts":[82],"model":[84],"dynamics,":[87],"occurring,":[88],"for":[89,146,170,232,266],"example,":[90],"mobile":[92,147],"However,":[94],"pace":[96],"changes":[98,120],"restricted,":[100],"i.e.":[101],"distances":[103],"can":[106,152],"change":[107],"only":[108],"by":[109,175,210,257],"constant":[111,156],"per":[112],"round.":[113],"movement":[115],"nodes":[118,151],"induce":[119],"cost":[124,160,186],"each":[126],"pair":[127],"nodes,":[129],"which":[130,245],"proportional":[132],"distance":[135],"them":[137],"raised":[138],"some":[140],"power":[141],"\u03b1.":[142],"This":[143],"typical":[145],"wireless":[148],"networks,":[149],"where":[150],"move":[153],"with":[154,278],"speed,":[157],"measured":[164],"terms":[166],"energy":[168,192],"used":[169],"sending":[171],"data.":[173],"Thus,":[174],"setting":[176],"\u03b1":[177],"equal":[178],"propagation":[181],"exponent":[182],"medium,":[185],"minimization":[187],"becomes":[188],"minimizing":[189],"consumption":[193],"system.However,":[196],"as":[197],"proven":[198],"[7],":[200],"if":[201],"both":[202],"mobility":[204,248],"request":[206],"sequence":[207],"are":[208,254],"created":[209],"adversary,":[212],"then":[213],"competitive":[215],"ratio":[216],"polynomially":[218],"large":[219],"D":[221],"number":[225],"nodes.":[228],"In":[229],"our":[230],"search":[231],"reasonable,":[234],"close-to-reality":[235],"model,":[236],"this":[238,267],"paper":[239],"we":[240],"consider":[241],"scenario":[243],"adversarial,":[250],"but":[251],"requests":[253],"generated":[255],"randomly":[256],"stochastic":[259],"process.":[260],"We":[261],"design":[262],"algorithm":[264],"MTFR":[265],"scenario,":[268],"prove":[270],"that":[271],"it":[272],"O(1)-competitive,":[274],"on":[275],"expectation":[276],"high":[279],"probability.":[280]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}