Zobrazeno 1 - 10
of 176
pro vyhledávání: '"Qiang-Sheng Hua"'
Publikováno v:
IEEE Access, Vol 8, Pp 116605-116616 (2020)
There is a growing gap between data explosion speed and the improvement of graph processing systems on conventional architectures. The main reason lies in the large overhead of random access and data movement, as well as the unbalanced and unordered
Externí odkaz:
https://doaj.org/article/93e0980fd6b342d7b94fe604e784b8d8
Publikováno v:
Wireless Communications and Mobile Computing. 2022:1-16
In vehicular edge computing (VEC), tasks and data collected by sensors on the vehicles can be offloaded to roadside units (RSUs) equipped with a set of servers through the wireless transmission. These tasks may be dependent of each other and can be m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6544f7413495f198aa903ed8d4e01ab7
https://doi.org/10.1155/2022/9013361
https://doi.org/10.1155/2022/9013361
Publikováno v:
IEEE Transactions on Big Data. 7:590-602
Most of existing graph processing systems essentially follow pull-based computation model to handle compute-intensive parts of graph iteration for high parallelism. Considering all vertices and edges are processed in each iteration, pull model may su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a582bcb60fa0c60b4396acea177d775
https://doi.org/10.1109/tbdata.2019.2921358
https://doi.org/10.1109/tbdata.2019.2921358
Publikováno v:
2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2fefd6f8b802b1bf6d46c1e44199a35
https://doi.org/10.1109/iwqos54832.2022.9812897
https://doi.org/10.1109/iwqos54832.2022.9812897
Publikováno v:
World Wide Web. 24:541-561
Coreness is an important index to reflect the cohesiveness of a graph. The problems of core computation in static graphs and core update in dynamic graphs, known as the core decomposition and core maintenance problems respectively, have been extensiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0d482e83329696562c452333eb4989d
https://doi.org/10.1007/s11280-020-00857-0
https://doi.org/10.1007/s11280-020-00857-0
Autor:
Hai Jin, Jiang Xiao, Xiaohai Dai, Kuan-Ching Li, Weifeng Hao, Jiajie Zeng, Hanhua Chen, Qiang-Sheng Hua
Publikováno v:
IEEE Transactions on Network and Service Management. 17:904-917
Blockchain technology offers an intelligent amalgamation of distributed ledger, Peer-to-Peer (P2P), cryptography, and smart contracts to enable trustworthy applications without any third parties. Existing blockchain systems have successfully either r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6dabd412871a542681427c9b89a9eb57
https://doi.org/10.1109/tnsm.2020.2980303
https://doi.org/10.1109/tnsm.2020.2980303
Autor:
Qiang-Sheng Hua, Hai Jin, Zhipeng Cai, Dongxiao Yu, Xiuzhen Cheng, Hanhua Chen, Shi Yuliang, Jiguo Yu
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 31:1287-1300
This article studies the core maintenance problem for dynamic graphs which requires to update each vertex's core number with the insertion/deletion of vertices/edges. Previous algorithms can either process one edge associated with a vertex in each it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::219a281072fd2cc964df00a580244aea
https://doi.org/10.1109/tpds.2019.2960226
https://doi.org/10.1109/tpds.2019.2960226
Publikováno v:
ICPP
Complete Event Trend (CET) detection over large-scale event streams is important and challenging in various applications such as financial services, real-time business analysis, and supply chain management. A potential large number of partial interme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::069f7ec42879be4718ba78cc08dff0a6
https://doi.org/10.1145/3472456.3472526
https://doi.org/10.1145/3472456.3472526
Publikováno v:
ICPP
In this paper, we propose a parallel algorithm for computing all-pairs shortest paths (APSP) for sparse graphs on the distributed memory system with p processors. To exploit the graph sparsity, we first preprocess the graph by utilizing several known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c2568c964ee1bad7993bcafdbee6ed1
https://doi.org/10.1145/3472456.3472524
https://doi.org/10.1145/3472456.3472524
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 30:1643-1656
Graph partitioning is a fundamental problem to enable scalable graph computation on large graphs. Existing partitioning models are either streaming based or offline based. In the streaming model, the current edge needs all previous edges’ partition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a10ed08c54555b45ca80a5a77f16e3e
https://doi.org/10.1109/tpds.2018.2890515
https://doi.org/10.1109/tpds.2018.2890515