OpenAlex
PricingAboutJobs
Log inGet started
Work

Parallel-Friendly and Work-Efficient Single Source Shortest Path Algorithm on Single-Node System

HTML

Year: 2022
Type: conference-paper
Source: IEEE International Conference on High Performance Computing and Communications; IEEE International Conference on Smart City; IEEE International Conference on Data Science and Systems (HPCC/SmartCity/DSS)
DOI: 10.1109/hpcc-dss-smartcity-dependsys57074.2022.00176
Authors: Jie Zhang, Yuan Zhang, Yiming Sun, Huawei Cao, Xuejun An, Xiaochun Ye
Institutions: Chinese Academy of Sciences, Institute of Computing Technology, University of Chinese Academy of Sciences
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: single-source shortest path, parallel graph algorithms, shared memory, work efficiency, atomic operations, race conditions, subgraph partitioning, scale-free networks, graph processing

Open Access status: closed

Funder: National Natural Science Foundation of China
Award: G4241695538
OpenAlex ID: W4361732748
FWCI: 0.171
Cites: 35
Cited by: 2
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security