Delay-based I/O request scheduling in SSDs
To pave the way for fast data access, multiple parallel components (eg, multiple dies) in
SSDs are crafted. Therefore, how to fully utilize the parallel resources has become a …
SSDs are crafted. Therefore, how to fully utilize the parallel resources has become a …
High‐speed end‐to‐edge data caching and forwarding architecture based on field programmable gate array
X Liu, S Liu, J Wu, S Song, Z Cai, G Tu - ETRI Journal, 2024 - Wiley Online Library
The application of the Internet of Things generates massive end‐device data. Traditional
end‐to‐edge data caching methods lack parallelism, consume numerous resources, and …
end‐to‐edge data caching methods lack parallelism, consume numerous resources, and …
Research and Design of Nand Flash Array from Host to Flash Translation Layer
B Ding, S Liu, T Lv, Y Liu, W Lu - IEEE Access, 2023 - ieeexplore.ieee.org
Given the inherent limitations of flash memory, solid-state storage devices require a host
controller and a flash translation layer (FTL) to address two major conflicts: the conflict …
controller and a flash translation layer (FTL) to address two major conflicts: the conflict …
[PDF][PDF] 改进尺度不变特征变换算法的图像配准
范雪婷， 赵朝贺， 潘九宝， 王玮 - 计算机与数字工程, 2020 - jsj.journal.cssc709.net
摘要为了提高尺度不变特征变换(SIFT) 算法的配准精度和适应性, 对匹配框架和匹配方法进行
改进. 匹配算法优化为初始匹配, 中间匹配及精确匹配三个阶段, 首先利用最近邻值 …
改进. 匹配算法优化为初始匹配, 中间匹配及精确匹配三个阶段, 首先利用最近邻值 …
A High-performance Open-channel Open-way NAND Flash Controller Architecture
Y Qiu, W Yin, L Wang - 2021 31st International Conference on …, 2021 - ieeexplore.ieee.org
NAND-Flash-based SSDs have been widely employed in diverse computing domains and
storage systems due to their higher performance and lower power consumption than HDDs …
storage systems due to their higher performance and lower power consumption than HDDs …
Fast truss decomposition in memory
Y Xing, N Xiao, Y Lu, R Li, S Yu, S Gao - Security, Privacy, and Anonymity …, 2017 - Springer
The k-truss is a type of cohesive subgraphs proposed for the analysis of massive network.
Existing in-memory algorithms for computing k-truss are inefficient for searching and …
Existing in-memory algorithms for computing k-truss are inefficient for searching and …
[PDF][PDF] 一种针对混合存储系统的高效缓存算法
张剑 - 计算机与数字工程, 2020 - jsj.journal.cssc709.net
一种针对混合存储系统的高效缓存算法∗ Page 1 第48 卷 收稿日期:2019年11月13日,修回日期:2019年
12月26日 作者简介:张剑,男,硕士,工程师,研究方向:舰船电子信息系统. ∗ 总第367 期 2020 年第 …
12月26日 作者简介:张剑,男,硕士,工程师,研究方向:舰船电子信息系统. ∗ 总第367 期 2020 年第 …
Collaborative compaction optimization system using near-data processing for LSM-tree-based key-value stores
H Sun, W Liu, J Huang, W Shi - Journal of Parallel and Distributed …, 2019 - Elsevier
Log-structured merge tree (LSM-tree) based key–value stores are widely employed in large-
scale storage systems. In compaction, high-level sorted string table files (ie, SSTables) are …
scale storage systems. In compaction, high-level sorted string table files (ie, SSTables) are …
Research on Graph Processing Systems on a Single Machine
Y Xing, S Gao, N Xiao, F Liu, W Chen - Security, Privacy, and Anonymity in …, 2017 - Springer
With the rapid development of technologies such as cloud computing, the increasingly
popularity of social network and other Internet applications, the data scale that human can …
popularity of social network and other Internet applications, the data scale that human can …
Guest Editorial: The Parallel Storage, Processing and Analysis for Big Data
M Li, Z Tang - International Journal of Parallel Programming, 2017 - Springer
Big data has received a significant amount of attention from both the academia and industry
since the US government announced the Big Data Initiative in 2012. Big data is featured …
since the US government announced the Big Data Initiative in 2012. Big data is featured …