Abstract
A multi-thread scheduling method, a server, and a computer system, are described. The method includes: determining an affinity between the first thread and the second thread based on first memory access information of the first thread in a first running phase and second memory access information of the second thread in a second running phase; determining a first node based on the first memory access information, the second memory access information, and the affinity; determining that a resource measurement value of the first node is less than a resource threshold; and selecting, from the first node, a processor configured to run the first thread and the second thread.
Full Text
What is claimed is:
A multi-thread scheduling method, a server, and a computer system, are described. The method includes: determining an affinity between the first thread and the second thread based on first memory access information of the first thread in a first running phase and second memory access information of the second thread in a second running phase; determining a first node based on the first memory access information, the second memory access information, and the affinity; determining that a resource measurement value of the first node is less than a resource threshold; and selecting, from the first node, a processor configured to run the first thread and the second thread.
Timeline
Filed
04/20/2026Published
08/27/2026Granted
Not AvailableIPC Codes(1)
G06F 9/50:Allocation of resources, e.g. of the central processing unit [CPU]