{"id":"https://openalex.org/W2396766219","doi":"https://doi.org/10.1090/dimacs/007/10","title":"Randomized algorithms for multiprocessor page migration","display_name":"Randomized algorithms for multiprocessor page migration","publication_year":1992,"publication_date":"1992-03-10","ids":{"openalex":"https://openalex.org/W2396766219","doi":"https://doi.org/10.1090/dimacs/007/10","mag":"2396766219"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/007/10","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/007/10","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5034718361","display_name":"Jeffery Westbrook","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jeffery Westbrook","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034718361"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.218,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.96643783,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"135","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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":0.9994999766349792,"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 and Parallel Computing Systems","score":0.9983000159263611,"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.9940000176429749,"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/competitive-analysis","display_name":"Competitive analysis","score":0.709022045135498},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6260294914245605},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.546557605266571},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5464169383049011},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5437700152397156},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5412745475769043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5103697180747986},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.49112817645072937},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4815954864025116},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.42831069231033325},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4213992953300476},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37429094314575195},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3368983864784241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2829248309135437},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.18265491724014282}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.709022045135498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6260294914245605},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.546557605266571},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5464169383049011},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5437700152397156},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5412745475769043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5103697180747986},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.49112817645072937},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4815954864025116},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.42831069231033325},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4213992953300476},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37429094314575195},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3368983864784241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2829248309135437},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.18265491724014282},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/007/10","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/007/10","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7900000214576721,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2058681277","https://openalex.org/W1996806106","https://openalex.org/W2951573806","https://openalex.org/W2090027528","https://openalex.org/W4241266436","https://openalex.org/W2208110155","https://openalex.org/W96431103","https://openalex.org/W2047204419","https://openalex.org/W2073006754","https://openalex.org/W2070734629"],"abstract_inverted_index":{"The":[0,64,217],"page":[1,18,32,47,61],"migration":[2,141],"problem":[3,65,142],"is":[4,21,66,79,95,126,160,163,183,188,225],"to":[5,30,40,55,67],"manage":[6],"a":[7,13,24,37,60,81,220],"globally":[8],"addressed":[9],"shared":[10],"memory":[11,20,28,77],"in":[12],"multiprocessor":[14],"system.":[15],"Each":[16],"physical":[17],"of":[19,76,85,219],"located":[22],"at":[23,52],"given":[25],"processor,":[26],"and":[27,99,115,147,211],"references":[29,78],"that":[31,72,92,143,175],"by":[33],"other":[34],"processors":[35,51],"incur":[36],"cost":[38,53,75],"proportional":[39,54],"the":[41,46,56,73,86,140,194],"network":[42],"distance.":[43],"At":[44],"times":[45,58],"may":[48],"migrate":[49],"between":[50],"distance":[57],"$D$,":[59],"size":[62],"factor.":[63],"schedule":[68],"movements":[69],"on-line":[70,104],"so":[71,94],"total":[74],"within":[80],"constant":[82],"factor":[83],"$c$":[84],"best":[87],"off-line":[88],"schedule.":[89],"An":[90,155],"algorithm":[91,125,156,174,187,224],"does":[93],"called":[96],"c-competitive.":[97],"Black":[98],"Sleator":[100],"gave":[101],"3-competitive":[102,150],"deterministic":[103,124],"algorithms":[105,136,202],"for":[106,116,128,139,157,197],"uniform":[107,158],"networks":[108,130],"(complete":[109],"graphs":[110,159,178],"with":[111,118,131,179],"unit":[112],"edge":[113,120,133,181],"lengths)":[114],"trees":[117],"arbitrary":[119,132,180],"lengths.":[121,134],"No":[122],"good":[123],"known":[127],"general":[129],"\r\nRandomized":[135],"are":[137,144],"presented":[138],"both":[145],"simple":[146,222],"better":[148],"than":[149],"against":[151],"an":[152,208],"oblivious":[153],"adversary.":[154],"given.":[161,185],"It":[162],"approximately":[164,189],"2.28-competitive":[165],"as":[166],"$D$":[167],"grows":[168],"large.":[169],"A":[170],"second,":[171],"more":[172],"powerful":[173],"works":[176],"on":[177,214],"distances":[182],"also":[184,226],"This":[186],"2.62-competitive":[190],"(or,":[191],"1":[192],"plus":[193],"golden":[195],"ratio)":[196],"large":[198],"$D$.":[199],"Both":[200],"these":[201],"use":[203],"random":[204],"bits":[205],"only":[206],"during":[207],"initialization":[209],"phase,":[210],"from":[212],"then":[213],"run":[215],"deterministically.":[216],"competitiveness":[218],"very":[221],"coin-flipping":[223],"examined.":[227]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-18T06:27:02.140700","created_date":"2025-10-10T00:00:00"}