Evidence map›Paper›PMID 35300320›Full record

ArticleFPGA. ACM International Symposium on Field-Programmable Gate Arrays2022

Accelerating SSSP for Power-Law Graphs.

Yuze Chi, Licheng Guo, Jason Cong

Abstract read
In one paragraph

Article in FPGA. ACM International Symposium on Field-Programmable Gate Arrays, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Yuze ChiUniversity of California, Los Angeles.
Licheng GuoUniversity of California, Los Angeles.
Jason CongUniversity of California, Los Angeles.

Funding

Dendritome mapping of genetically-defined and sparsely-labeled cortical and striatal projection neuronsU01MH117079 · NIMH · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI DONG, HONG-WEI, YANG, XIANGDONG WILLIAM · 2018 to 2022
$4.3M
NIMH NIH HHS U01 MH117079
6 · The paper itself

Abstract

The single-source shortest path (SSSP) problem is one of the most important and well-studied graph problems widely used in many application domains, such as road navigation, neural image reconstruction, and social network analysis. Although we have known various SSSP algorithms for decades, implementing one for large-scale power-law graphs efficiently is still highly challenging today, because ① a work-efficient SSSP algorithm requires priority-order traversal of graph data, ② the priority queue needs to be scalable both in throughput

Indexed as

cacheFPGAgraphHLSpower-lawpriority queueSSSP

Identifiers

PMID35300320
PMCPMC8926441

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.