{"id":"https://openalex.org/W1500022468","doi":"https://doi.org/10.3217/jucs-007-04-0291","title":"The Message-Minimizing Load Redistribution Problem","display_name":"The Message-Minimizing Load Redistribution Problem","publication_year":2020,"publication_date":"2020-04-07","ids":{"openalex":"https://openalex.org/W1500022468","doi":"https://doi.org/10.3217/jucs-007-04-0291","mag":"1500022468"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/02fd7578-6f0e-447e-9a7a-db7d769687b3","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/02fd7578-6f0e-447e-9a7a-db7d769687b3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Haglin, D J & Ford, R W 2001, 'The Message-Minimizing Load Redistribution Problem', Journal of Universal Computer Science, vol. 7, no. 4, pp. 291-306.","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/6995971","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005082862","display_name":"David J. Haglin","orcid":null},"institutions":[{"id":"https://openalex.org/I152014189","display_name":"Minnesota State University, Mankato","ror":"https://ror.org/04att9732","country_code":"US","type":"education","lineage":["https://openalex.org/I152014189","https://openalex.org/I91221267"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David J. Haglin","raw_affiliation_strings":["Minnesota State University\u2013Mankato"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Minnesota State University\u2013Mankato","institution_ids":["https://openalex.org/I152014189"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110246189","display_name":"Rupert Ford","orcid":"https://orcid.org/0000-0001-5483-4965"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rupert W. Ford","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.00190004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"4","first_page":"291","last_page":"306"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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.8696212768554688},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6638841032981873},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6061331033706665},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5101666450500488},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4965594410896301},{"id":"https://openalex.org/keywords/redistribution","display_name":"Redistribution (election)","score":0.4939296841621399},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4845484793186188},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47344347834587097},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17213255167007446},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.09762111306190491}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8696212768554688},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6638841032981873},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6061331033706665},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5101666450500488},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4965594410896301},{"id":"https://openalex.org/C74080474","wikidata":"https://www.wikidata.org/wiki/Q7305975","display_name":"Redistribution (election)","level":3,"score":0.4939296841621399},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4845484793186188},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47344347834587097},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17213255167007446},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.09762111306190491},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","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/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/02fd7578-6f0e-447e-9a7a-db7d769687b3","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/02fd7578-6f0e-447e-9a7a-db7d769687b3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Haglin, D J & Ford, R W 2001, 'The Message-Minimizing Load Redistribution Problem', Journal of Universal Computer Science, vol. 7, no. 4, pp. 291-306.","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:zenodo.org:6995971","is_oa":true,"landing_page_url":"https://zenodo.org/record/6995971","pdf_url":"https://zenodo.org/record/6995971","source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science 7((4)) 291-306","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/02fd7578-6f0e-447e-9a7a-db7d769687b3","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/the-messageminimizing-load-redistribution-problem(02fd7578-6f0e-447e-9a7a-db7d769687b3).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Haglin, D J & Ford, R W 2001, 'The Message-Minimizing Load Redistribution Problem', Journal of Universal Computer Science, vol. 7, no. 4, pp. 291-306.","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.3217/jucs-007-04-0291","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-007-04-0291","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"DataPaper"},{"id":"mag:1500022468","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/jucs/jucs7.html#HaglinF01","pdf_url":null,"source":{"id":"https://openalex.org/S58563349","display_name":"JUCS - Journal of Universal Computer Science","issn_l":"0948-695X","issn":["0948-695X","0948-6968"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317875","host_organization_name":"Verlag der Technischen Universit\u00e4t Graz","host_organization_lineage":["https://openalex.org/P4310317875"],"host_organization_lineage_names":["Verlag der Technischen Universit\u00e4t Graz"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"JUCS - Journal of Universal Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:zenodo.org:6995971","is_oa":true,"landing_page_url":"https://zenodo.org/record/6995971","pdf_url":"https://zenodo.org/record/6995971","source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science 7((4)) 291-306","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","score":0.8399999737739563,"display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1500022468.pdf","grobid_xml":"https://content.openalex.org/works/W1500022468.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1512572660","https://openalex.org/W1963542516","https://openalex.org/W1968143987","https://openalex.org/W2011039300"],"related_works":["https://openalex.org/W2184219077","https://openalex.org/W97733791","https://openalex.org/W2908342275","https://openalex.org/W1583194654","https://openalex.org/W2184828253","https://openalex.org/W2786668312","https://openalex.org/W2185546816","https://openalex.org/W2795643643","https://openalex.org/W2320621834","https://openalex.org/W2336274760","https://openalex.org/W2784083101","https://openalex.org/W2991173101","https://openalex.org/W2899055460","https://openalex.org/W3150181840","https://openalex.org/W1581301671","https://openalex.org/W921402258","https://openalex.org/W2732353337","https://openalex.org/W2111345587","https://openalex.org/W2186689726","https://openalex.org/W2330080624"],"abstract_inverted_index":{"The":[0,61],"Message":[1],"Minimizing":[2],"Load":[3],"Redistribution":[4],"Problem":[5],"is":[6,67,93,106],"described":[7],"which":[8],"arises":[9],"from":[10],"the":[11,37,43,51,59,64,80,96,124],"need":[12],"to":[13,49,56,95],"redistribute":[14],"work":[15],"when":[16],"performing":[17],"load":[18],"balancing":[19],"in":[20,73],"a":[21,27,32,47],"parallel":[22],"computing":[23],"environment.":[24],"We":[25,41],"consider":[26],"global":[28],"perspective":[29],"and":[30,87,108,111],"seek":[31],"redistribution":[33],"plan":[34],"that":[35,121],"minimizes":[36],"overall":[38],"processing":[39],"time.":[40],"define":[42],"cost":[44],"associated":[45],"with":[46],"solution":[48],"be":[50],"number":[52],"of":[53,63,104,126],"packets":[54],"needed":[55],"balance":[57],"out":[58],"workload.":[60],"impact":[62,123],"interconnection":[65],"network":[66],"ignored.":[68],"This":[69,91],"problem":[70,92],"can":[71],"arise":[72],"many":[74],"applications.":[75],"One":[76],"such":[77],"example":[78],"being":[79],"U.K.":[81],"Meteorological":[82],"Office's":[83],"operational":[84],"weather":[85],"forecasting":[86],"climate":[88],"prediction":[89],"models.":[90],"equivalent":[94],"Pure":[97],"Unit-Cost":[98],"Transportation":[99],"Problem.":[100],"A":[101],"simple":[102],"proof":[103],"-completeness":[105],"given,":[107],"various":[109],"heuristics":[110],"approximation":[112],"issues":[113],"are":[114,119,131],"investigated.":[115],"Several":[116],"theoretical":[117],"results":[118,130],"shown":[120],"may":[122],"design":[125],"an":[127],"algorithm.":[128],"Simulation":[129],"presented.":[132]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}