Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Haifeng Sun 0002

dblp:00/11044-2 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Software-defined and programmable networks · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › programmable data plane
in-network computation
1.012026
Rearchitecting Programmable Networks For In-Network Computing: From Hardware To Language · EuroSys 2026
Software-defined and programmable networks
programmable data plane
1.012026
Rearchitecting Programmable Networks For In-Network Computing: From Hardware To Language · EuroSys 2026
Programming languages and type systems
domain-specific languages
1.012026
Rearchitecting Programmable Networks For In-Network Computing: From Hardware To Language · EuroSys 2026
Processor architecture and microarchitecture › special-purpose processor
network processor
0.312026
Rearchitecting Programmable Networks For In-Network Computing: From Hardware To Language · EuroSys 2026

Methods — techniques the papers use, named apart from their topics

operation-action table · 3.0hierarchical memory pool · 3.0
YearPublicationVenuePosition
2026 Rearchitecting Programmable Networks For In-Network Computing: From Hardware To Language
abstract
In-network computing (INC) offers orders-of-magnitude performance gains for various applications. However, the existing pipeline-based switch architecture, though well-suited for stateless packet forwarding, imposes three constraints on stateful INC applications: (i) control-plane table management, (ii) scarce memory resources under per-stage layout, and (iii) a strict memory access model. To address these constraints, this paper provides a full-stack solution, covering a programmable chipset Solar-NP, a programming language NPC, and a complete toolchain XuanWu. First, Solar-NP adopts a run-to-completion-based (RTC-based) architecture with three new hardware features: data-plane table management, a hierarchical memory pool, and built-in data structures with atomic access guarantees. Second, to fully exploit the hardware features, our language NPC introduces a new abstraction, namely operation-action table (OAT), that allows table manipulations in the data plane. Finally, our XuanWu toolchain provides various utility software covering the complete workflow of developing, testing, debugging, and deployment. To show the power of our solution, we implement three types of INC cases, including in-network control, in-network telemetry, and in-network storage. Experimental results demonstrate that our solution allows more operations to be offloaded and achieves higher performance than today's pipeline-based solutions.
Haifeng Sun 0002, Taixu Tian, Jinbo Sun, Jintao He, Qun Huang 0001, Luyou He, Xiangcan Xu, Junyi Guo, Yongqiang Yang
EuroSys1
2015 X-ray pulsar-based navigation using pulse phase and Doppler frequency measurements
Meng-fan Xue, Xiaoping Li 0004, LingZhong Fu, Haiyan Fang, Haifeng Sun 0002, Li-rong Shen
Sci. China Inf. Sci.5
2015 A novel period estimation method for X-ray pulsars based on frequency subdivision
abstract
Period estimation of X-ray pulsars plays an important role in X-ray pulsar based navigation (XPNAV). The fast Lomb periodogram is suitable for period estimation of X-ray pulsars, but its performance in terms of frequency resolution is limited by data length and observation time. Longer observation time or oversampling can be employed to improve frequency analysis results, but with greatly increased computational complexity and large amounts of sampling data. This greatly restricts real-time autonomous navigation based on X-ray pulsars. To resolve this issue, a new method based on frequency subdivision and the continuous Lomb periodogram (CLP) is proposed to improve precision of period estimation using short-time observation data. In the proposed method, an initial frequency is first calculated using fast Lomb periodogram. Then frequency subdivision is performed near the initial frequency to obtain frequencies with higher precision. Finally, a refined period is achieved by calculating the CLP in the obtained frequencies. Real data experiments show that when observation time is shorter than 135 s, the proposed method improves period estimation precision by 1–3 orders of magnitude compared with the fast Lomb periodogram and fast Fourier transform (FFT) methods, with only a slight increase in computational complexity. Furthermore, the proposed method performs better than efsearch (a period estimation method of HEAsoft) with lower computational complexity. The proposed method is suitable for estimating periods of X-ray pulsars and obtaining the rotation period of variable stars and other celestial bodies.
Li-rong Shen, Xiaoping Li 0004, Haifeng Sun 0002, Haiyan Fang, Meng-fan Xue
Frontiers Inf. Technol. Electron. Eng.3