Zobrazeno 1 - 10
of 152
pro vyhledávání: '"Graph500"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tiejun Li, Jie Liu, Ruibo Wang, Yiming Zhang, Tiaojie Xiao, Kai Lu, Zeng Ruigeng, Xinbiao Gan
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 33:941-951
As the era of exascale supercomputing is coming, it is vital for next-generation supercomputers to find appropriate applications with high social and economic benefit. In recent years, it has been widely accepted that extremely-large graph computatio
Publikováno v:
CCF Transactions on High Performance Computing. 3:271-285
Graphs are an effective approach for data representation and organization, and graph analysis is a promising killer application for AI systems. However, recently emerging extremely large graphs (consisting of trillions of vertices and edges) exceed t
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030787127
ISC
ISC
In this paper, we present the performance of the supercomputer Fugaku for breadth-first search (BFS) problem in the Graph500 benchmark, which is known as a ranking benchmark used to evaluate large-scale graph processing performance on supercomputer s
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Transactions on Computers. 69:749-763
Automated performance modeling and performance prediction of parallel programs are highly valuable in many use cases, such as in guiding task management and job scheduling, offering insights of application behaviors, and assisting resource requiremen
Autor:
Ihre Sherif, Alan
On certain CPUs part of the Intel Xeon Scalable CPU family, the level three (L3) cache is shared among the CPU cores residing on the same CPU socket. This has benefits in that a larger and more scalable cache space is available to the CPU cores. Howe
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-306728
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 16:1-27
Memory prefetchers are designed to identify and prefetch specific access patterns, including spatiotemporal locality (e.g., strides, streams), recurring patterns (e.g., varying strides, temporal correlation), and specific irregular patterns (e.g., po
Publikováno v:
IEEE Transactions on Computers. 68:1019-1034
In-memory computing has inspired researchers to consider integrating large-capacity persistent memory (PM) into the main memory subsystem. However, several challenges still remain for providing an integration approach for DRAM-comparable PM on existi
Publikováno v:
2021 5th International Conference on High Performance Compilation, Computing and Communications.
Performance tuning faces challenges of the heterogeneousness, complexity and flexibility of the modern processors. Due to the limited knowledge of the underlining architecture, users are usually confused about which optimizing should be enabled to sp