Improved Computing Performance for Algorithm Finding the Shortest Path for all-pair in the MapReduce architectures

Improved Computing Performance for Algorithm Finding the Shortest Path for all-pair in the MapReduce architectures | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Improved Computing Performance for Algorithm Finding the Shortest Path for all-pair in the MapReduce architectures Nguyen Dinh Lau, Le Thanh tuan This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4407938/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract The problem of finding All Pair Shortest Path (APSP). APSP is performed on many structures such as: MPI, OpenMP, Cuda, …. When the input data is large, we need to find ways to improve computing power to reduce calculation time for the APSP algorithm. In this paper, we present a contribution for the All-Pair Shortest Path algorithm (APSP) in the MapReduce architectures. The MapReduce algorithm has two functions Map and Reduce. There receive key/value pairs based on an adjacency list. Algorithm perform in MapReduce and our results prove that the proposed approach improved Computing Performance for Algorithm Finding the Shortest Path for all-pair. Shortest path Graph Algorithm Hadoop MapReduce Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4407938","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":305214163,"identity":"69dd0abc-3a0f-4336-9744-72f1d8c6418d","order_by":0,"name":"Nguyen Dinh Lau","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAsElEQVRIiWNgGAWjYFCC5AYGhgogfYCBQYJILYlALWdI1sLYRooWc/bExs+88w7L8R3gMbxdwHA4j6AWy56HzdK82w4bSx7gMbaewXC4mKAWgxuJDSAtiRsO8JhJ8zCkgbxGUEvzb945h+tJ0tImzdtwOMEAosWGCC1nHrZZzjmWbjjzMFuxNY8BMVqOJx++8abGWp7vePPG2zwVEoS1IAAz2ATi1Y+CUTAKRsEowAMA7zs7tLBUCCoAAAAASUVORK5CYII=","orcid":"","institution":"University of Education and Science, University of Da Nang","correspondingAuthor":true,"prefix":"","firstName":"Nguyen","middleName":"Dinh","lastName":"Lau","suffix":""},{"id":305214164,"identity":"3200f721-bd18-4bb5-8c4e-eb658082c1ad","order_by":1,"name":"Le Thanh tuan","email":"","orcid":"","institution":"University of Education and Science, University of Da Nang","correspondingAuthor":false,"prefix":"","firstName":"Le","middleName":"Thanh","lastName":"tuan","suffix":""}],"badges":[],"createdAt":"2024-05-12 09:27:19","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4407938/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4407938/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":60035944,"identity":"d7260b67-79b0-467e-8ce7-40b510fb65d2","added_by":"auto","created_at":"2024-07-11 00:32:19","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":682556,"visible":true,"origin":"","legend":"","description":"","filename":"PaperAllpaironMapReduceNguyenDinhLau712.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4407938/v1_covered_97e923f4-c85d-4bc1-8080-11ae5084d915.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Improved Computing Performance for Algorithm Finding the Shortest Path for all-pair in the MapReduce architectures","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Shortest path, Graph, Algorithm, Hadoop, MapReduce","lastPublishedDoi":"10.21203/rs.3.rs-4407938/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4407938/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"The problem of finding All Pair Shortest Path (APSP). APSP is performed on many structures such as: MPI, OpenMP, Cuda, …. When the input data is large, we need to find ways to improve computing power to reduce calculation time for the APSP algorithm. In this paper, we present a contribution for the All-Pair Shortest Path algorithm (APSP) in the MapReduce architectures. The MapReduce algorithm has two functions Map and Reduce. There receive key/value pairs based on an adjacency list. Algorithm perform in MapReduce and our results prove that the proposed approach improved Computing Performance for Algorithm Finding the Shortest Path for all-pair.","manuscriptTitle":"Improved Computing Performance for Algorithm Finding the Shortest Path for all-pair in the MapReduce architectures","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-05-22 08:19:55","doi":"10.21203/rs.3.rs-4407938/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"6c327968-2d6d-4480-a0c0-b91bc8f20960","owner":[],"postedDate":"May 22nd, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-07-11T00:24:12+00:00","versionOfRecord":[],"versionCreatedAt":"2024-05-22 08:19:55","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4407938","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4407938","identity":"rs-4407938","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}