{"id":"https://openalex.org/W3184408564","doi":"https://doi.org/10.1145/3409801","title":"Big Data Processing on Volunteer Computing","display_name":"Big Data Processing on Volunteer Computing","publication_year":2021,"publication_date":"2021-07-22","ids":{"openalex":"https://openalex.org/W3184408564","doi":"https://doi.org/10.1145/3409801","mag":"3184408564"},"language":"en","primary_location":{"id":"doi:10.1145/3409801","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409801","pdf_url":null,"source":{"id":"https://openalex.org/S97833917","display_name":"ACM Transactions on Internet Technology","issn_l":"1533-5399","issn":["1533-5399","1557-6051"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Internet Technology","raw_type":"journal-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/A5108044017","display_name":"Zhihan Lv","orcid":"https://orcid.org/0009-0005-9452-5768"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhihan Lv","raw_affiliation_strings":["School of Data Science and Software Engineering, Qingdao, China"],"affiliations":[{"raw_affiliation_string":"School of Data Science and Software Engineering, Qingdao, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060271452","display_name":"Dongliang Chen","orcid":"https://orcid.org/0000-0001-7700-4729"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dongliang Chen","raw_affiliation_strings":["School of Data Science and Software Engineering, Qingdao, China"],"affiliations":[{"raw_affiliation_string":"School of Data Science and Software Engineering, Qingdao, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100634925","display_name":"Amit Kumar Singh","orcid":"https://orcid.org/0000-0001-7359-2068"},"institutions":[{"id":"https://openalex.org/I11793825","display_name":"National Institute of Technology Patna","ror":"https://ror.org/056wyhh33","country_code":"IN","type":"education","lineage":["https://openalex.org/I11793825","https://openalex.org/I4210152752"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amit Kumar Singh","raw_affiliation_strings":["Department of Computer Science & Engineering, National Institute of Technology Patna, (An Institute under MHRD, Govt. of India), India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, National Institute of Technology Patna, (An Institute under MHRD, Govt. of India), India","institution_ids":["https://openalex.org/I11793825"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108044017"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.428,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.81870135,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"21","issue":"4","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9882000088691711,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9876999855041504,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8454979658126831},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7219773530960083},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6166554093360901},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.535297691822052},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4666576087474823},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4175945520401001},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37768951058387756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37491607666015625},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3647318482398987},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2023514211177826}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8454979658126831},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7219773530960083},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6166554093360901},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.535297691822052},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4666576087474823},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4175945520401001},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37768951058387756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37491607666015625},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3647318482398987},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2023514211177826},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3409801","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3409801","pdf_url":null,"source":{"id":"https://openalex.org/S97833917","display_name":"ACM Transactions on Internet Technology","issn_l":"1533-5399","issn":["1533-5399","1557-6051"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Internet Technology","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G5801954405","display_name":null,"funder_award_id":"61902203","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W2331973420","https://openalex.org/W2587622726","https://openalex.org/W2616591171","https://openalex.org/W2616862267","https://openalex.org/W2758793404","https://openalex.org/W2771928994","https://openalex.org/W2772960527","https://openalex.org/W2777034682","https://openalex.org/W2777781531","https://openalex.org/W2786010746","https://openalex.org/W2795841196","https://openalex.org/W2796518500","https://openalex.org/W2804851328","https://openalex.org/W2804949946","https://openalex.org/W2842402481","https://openalex.org/W2890278565","https://openalex.org/W2890863075","https://openalex.org/W2894212516","https://openalex.org/W2896041704","https://openalex.org/W2904701238","https://openalex.org/W2905323256","https://openalex.org/W2911243956","https://openalex.org/W2912717503","https://openalex.org/W2914984626","https://openalex.org/W2920846036","https://openalex.org/W2954094501","https://openalex.org/W2954529315","https://openalex.org/W2963470155","https://openalex.org/W2966284741","https://openalex.org/W2966618927","https://openalex.org/W2970935782","https://openalex.org/W2980099541","https://openalex.org/W2982653275","https://openalex.org/W2987366832","https://openalex.org/W3104214067","https://openalex.org/W3166574963"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2349797546","https://openalex.org/W2161960576","https://openalex.org/W2366342492"],"abstract_inverted_index":{"In":[0,384],"order":[1],"to":[2,81,333,391],"calculate":[3,82],"the":[4,14,28,31,44,51,54,88,93,105,113,119,171,178,182,186,191,197,202,212,220,228,234,238,241,246,252,258,264,268,272,283,287,294,301,304,312,322,327,348,362,382,392,404],"node":[5,114],"big":[6,395],"data":[7,249],"contained":[8],"in":[9,50,286,345],"complex":[10,18,409],"networks":[11,318],"and":[12,47,53,66,71,74,83,95,116,135,157,162,227,245,262,278,293,306,335,354,369,376],"realize":[13],"efficient":[15],"calculation":[16,97,115,284],"of":[17,57,92,118,145,153,160,173,181,193,201,214,222,230,237,254,267,303,326,358,394,407],"networks,":[19,338],"based":[20,37,149],"on":[21,38,150],"voluntary":[22,39,386],"computing,":[23],"taking":[24],"ICE":[25],"middleware":[26],"as":[27,87],"communication":[29,72],"medium,":[30],"loose":[32],"coupling":[33],"distributed":[34,405],"framework":[35,60,94,184,203,239],"DCBV":[36,59,183],"computing":[40,387],"is":[41,108,126,176,185,225,232,240,271,275,290,296,309],"proposed.":[42,109],"Then,":[43],"Master,":[45],"Worker,":[46],"MiddleWare":[48],"layers":[49],"framework,":[52],"development":[55],"structure":[56],"a":[58,399],"are":[61,78,122,260,315,361,380],"designed.":[62],"The":[63,124,166,373],"task":[64],"allocation":[65],"recovery":[67],"strategy,":[68],"message":[69],"passing":[70],"mode,":[73],"fault":[75],"tolerance":[76],"processing":[77,393],"discussed.":[79],"Finally,":[80],"verify":[84],"parameters":[85],"such":[86],"average":[89,351],"shortest":[90,102,146,187,242],"path":[91,103,147],"shorten":[96],"time,":[98,350,353],"an":[99],"improved":[100],"accurate":[101],"algorithm,":[104,107],"N-SPFA":[106,120,269,305,359],"Under":[110],"different":[111,346],"datasets,":[112,347],"performance":[117,295,302],"algorithm":[121,125,144,270,329,360],"explored.":[123],"compared":[127,341],"with":[128,251,319,342],"four":[129],"approximate":[130],"shortest-path":[131],"algorithms:":[132],"Combined":[133],"Link":[134],"Attribute":[136],"(CLA),":[137],"Lexicographic":[138],"Breadth":[139],"First":[140],"Search":[141],"(LBFS),":[142],"Approximate":[143],"length":[148],"center":[151],"distance":[152],"area":[154,161],"division":[155],"(CDZ),":[156],"Hub":[158],"Vertex":[159],"Core":[163],"Expressway":[164],"(HEA-CE).":[165],"results":[167],"show":[168],"that":[169],"when":[170],"number":[172,192,213,221,229],"CPU":[174,194,210],"threads":[175],"4,":[177],"computation":[179,199,235,265],"time":[180,200,236,266,285,357],"(514.63":[188],"ms).":[189],"As":[190],"cores":[195],"increases,":[196],"overall":[198,355],"decreases":[204],"gradually.":[205],"For":[206,317],"every":[207],"2":[208],"additional":[209],"cores,":[211],"tasks":[215],"increases":[216],"by":[217],"1.":[218],"When":[219,257,340],"Worker":[223,255],"nodes":[224,231],"8":[226],"1,":[233],"(210,979":[243],"ms),":[244],"IO":[247],"statistics":[248],"increase":[250,253],"nodes.":[256],"datasets":[259],"Undirected01":[261],"Undirected02,":[263],"shortest,":[273,363],"which":[274,397],"4520":[276],"ms":[277],"7324":[279],"ms,":[280,292,366,368,371],"respectively.":[281,372],"However,":[282],"ca-condmat_undirected":[288],"dataset":[289],"175,292":[291],"slightly":[297],"worse.":[298],"Overall,":[299],"however,":[300],"SPFA":[307,328],"algorithms":[308,314,344],"good.":[310],"Therefore,":[311],"two":[313],"combined.":[316],"less":[320],"complexity,":[321],"computational":[323],"scale":[324],"coefficient":[325],"can":[330,388],"be":[331,389],"set":[332],"0.06,":[334],"for":[336,403],"general":[337],"0.2.":[339],"other":[343],"pretreatment":[349],"query":[352,356],"being":[364],"49.67":[365],"5.12":[367],"94,720":[370],"accuracy":[374],"(1.0087)":[375],"error":[377],"rate":[378],"(0.024)":[379],"also":[381],"best.":[383],"conclusion,":[385],"applied":[390],"data,":[396],"has":[398],"good":[400],"reference":[401],"significance":[402],"analysis":[406],"large-scale":[408],"networks.":[410]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}