乐胖代购免代理版

{"id":"https://openalex.org/W2746038368","doi":"https://doi.org/10.1109/pyhpc.2016.014","title":"Mrs: High Performance MapReduce for Iterative and Asynchronous Algorithms in Python","display_name":"Mrs: High Performance MapReduce for Iterative and Asynchronous Algorithms in Python","publication_year":2016,"publication_date":"2016-11-01","ids":{"openalex":"https://openalex.org/W2746038368","doi":"https://doi.org/10.1109/pyhpc.2016.014","mag":"2746038368"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/pyhpc.2016.014","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/A5082626147","display_name":"Jeffrey Lund","orcid":null},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Lund","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, Utah"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, Utah","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028530447","display_name":"Chace Ashcraft","orcid":null},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chace Ashcraft","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, Utah"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, Utah","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086467440","display_name":"Andrew McNabb","orcid":null},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew McNabb","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, Utah"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, Utah","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029074659","display_name":"Kevin Seppi","orcid":"https://orcid.org/0000-0002-4932-2700"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin Seppi","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, Utah"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, Utah","institution_ids":["https://openalex.org/I100005738"]}]}],"institution_assertions":[],"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,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":66},"biblio":{"volume":null,"issue":null,"first_page":"76","last_page":"85"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9976,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9976,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9964,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9951,"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/python","display_name":"Python","score":0.6752782}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9005773},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7259824},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.6752782},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5270636},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47933683},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.43621203},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.4299704},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.41789287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38225472},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23267552},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/pyhpc.2016.014","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":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":36,"referenced_works":["https://openalex.org/W1487337216","https://openalex.org/W1493526108","https://openalex.org/W1515830568","https://openalex.org/W1605569224","https://openalex.org/W1813030236","https://openalex.org/W1880262756","https://openalex.org/W1976860187","https://openalex.org/W1981493461","https://openalex.org/W1984080553","https://openalex.org/W1995552830","https://openalex.org/W2013344760","https://openalex.org/W2014779797","https://openalex.org/W2030640142","https://openalex.org/W2036631599","https://openalex.org/W2043218896","https://openalex.org/W2067818150","https://openalex.org/W2070996757","https://openalex.org/W2094531871","https://openalex.org/W2108739216","https://openalex.org/W2109472859","https://openalex.org/W2109722477","https://openalex.org/W2120458882","https://openalex.org/W2127042504","https://openalex.org/W2138924491","https://openalex.org/W2139386984","https://openalex.org/W2144839971","https://openalex.org/W2150174329","https://openalex.org/W2152195021","https://openalex.org/W2158583877","https://openalex.org/W2189465200","https://openalex.org/W2221554372","https://openalex.org/W2243050385","https://openalex.org/W2310963158","https://openalex.org/W4239429564","https://openalex.org/W4241298546","https://openalex.org/W4297789040"],"related_works":["https://openalex.org/W4297799326","https://openalex.org/W4287027380","https://openalex.org/W4285822516","https://openalex.org/W3193760048","https://openalex.org/W3187193180","https://openalex.org/W3116064965","https://openalex.org/W2505261959","https://openalex.org/W2341492732","https://openalex.org/W1699080303","https://openalex.org/W106542691"],"abstract_inverted_index":{"Mrs":[0,35,61,72],"[1]":[1],"is":[2],"a":[3,98,128,158],"lightweight":[4],"Python-based":[5],"MapReduce":[6,11,54],"implementation":[7],"designed":[8],"to":[9,14,18,69,76,80,97,102,118,132],"make":[10],"programs":[12],"easy":[13],"write":[15,96],"and":[16,24,93,111,122,181],"quick":[17],"run,":[19],"particularly":[20],"useful":[21],"for":[22,90,134],"research":[23],"academia.":[25],"A":[26],"common":[27],"set":[28],"of":[29,140,151,162,173],"algorithms":[30,48,145],"that":[31],"would":[32],"benefit":[33],"from":[34],"are":[36,146],"iterative":[37,47,82,144,175],"algorithms,":[38],"like":[39],"those":[40],"frequently":[41],"found":[42],"in":[43,52,60,137,149,170],"machine":[44],"learning;":[45],"however,":[46],"typically":[49],"perform":[50,81],"poorly":[51],"the":[53,70,74,109,138,171],"framework,":[55],"meaning":[56],"potentially":[57],"poor":[58],"performance":[59,169],"as":[62],"well.":[63],"Therefore,":[64],"we":[65,85,107,126,156],"propose":[66,127,157],"four":[67],"modifications":[68],"original":[71],"with":[73],"intent":[75],"improve":[77],"its":[78],"ability":[79],"algorithms.":[83],"First,":[84],"used":[86],"direct":[87],"task-to-task":[88],"communication":[89,121],"most":[91],"iterations":[92,117],"only":[94],"occasionally":[95],"distributed":[99],"file":[100],"system":[101],"preserve":[103],"fault":[104],"tolerance.":[105],"Second,":[106],"combine":[108],"reduce":[110],"map":[112],"tasks":[113],"which":[114],"span":[115],"successive":[116],"eliminate":[119],"unnecessary":[120],"scheduling":[123,139],"latency.":[124],"Third,":[125],"generator-callback":[129],"programming":[130],"model":[131],"allow":[133],"greater":[135],"flexibility":[136],"tasks.":[141],"Finally,":[142],"some":[143],"naturally":[147],"expressed":[148],"terms":[150],"asynchronous":[152,160],"message":[153],"passing,":[154],"so":[155],"fully":[159],"variant":[161],"MapReduce.":[163],"We":[164],"then":[165],"demonstrate":[166],"Mrs'":[167],"enhanced":[168],"context":[172],"two":[174],"applications:":[176],"particle":[177],"swarm":[178],"optimization":[179],"(PSO),":[180],"expectation":[182],"maximization":[183],"(EM).":[184]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2746038368","counts_by_year":[],"updated_date":"2024-12-07T11:29:14.620292","created_date":"2017-08-31"}