7c62a12918
kfdtest: dynamically increase timeout for P2PBandWidthTest
...
Incease more timeout according to peers number to pass the
test on some PCIe link platforms.
Change-Id: Ifcb8c7297d6960c96fc18d29bc0a48733ca50165
Signed-off-by: Eric Huang <jinhuieric.huang@amd.com >
2022-01-11 11:01:11 -05:00
8e94dde685
kfdtest: check peer accessible with new function
...
check GPU peer accessible with p2p_links in system
Signed-off-by: Gang Ba <gaba@amd.com >
Change-Id: I026f16564303b687811d6648f0b7f84be6819979
2020-11-26 10:34:06 -05:00
af249159ee
kfdtest: do not request host accessible memory for P2P tests
...
Do not request host accessible memory otherwise small-bar XGMI fails.
Change-Id: I6b1e750839ae66a34c85405fa8d0a4aa455399ef
Signed-off-by: Jonathan Kim <Jonathan.Kim@amd.com >
2020-04-17 23:42:10 -04:00
0174377351
kfdtest: add xgmi path for p2p tests
...
When large bar is not available, we can use
xgmi to do p2p tests.
Change-Id: Ib7b59fb8a4d41f605739a0428973f6b2f1a3450f
Signed-off-by: Eric Huang <JinhuiEric.Huang@amd.com >
2019-10-17 10:21:10 -04:00
e65685df19
KFDTest: simply P2PBandwidthTest case for specified source/destination
...
Only run the P2P test over the specified source and destination nodes if user already specify them
Change-Id: Ia3c0195cead7f46e3e28507f3255d8c59a287ab8
Signed-off-by: shaoyunl <shaoyun.liu@amd.com >
2019-08-06 18:57:33 -04:00
918a45a430
kfdtest: add P2POverheadTest
...
This is to measure the laterncy + overhead of sdma packet
consumption on p2p.
It is Similar with QueueLatency test. What's more, the queue's overhead
with different workload show more details.
test result on two gfx900.
[ RUN ] KFDPerformanceTest.P2POverheadTest
[ ] Test (avg. ns) | Size 4 8 16 64 256 1024
[ ] -----------------------------------------------------------------------
[ ] [push] [1 -> 0] 333 148 185 111 148 148
[ ] [push] [1 -> 1] 370 222 333 74 148 111
[ ] [push] [1 -> 2] 333 148 148 148 148 148
[ ] [push] [2 -> 0] 111 333 259 148 148 148
[ ] [push] [2 -> 1] 222 148 185 148 148 148
[ ] [push] [2 -> 2] 222 111 370 111 74 148
[ ] [pull] [1 -> 0] 370 296 296 148 185 148
[ ] [pull] [1 -> 1] 185 333 222 148 222 148
[ ] [pull] [1 -> 2] 222 444 259 148 185 111
[ ] [pull] [2 -> 0] 148 148 148 148 148 148
[ ] [pull] [2 -> 1] 148 148 148 148 148 148
[ ] [pull] [2 -> 2] 185 148 148 74 222 296
[ ] [push|pull][1 -> 0] 1259 1222 1259 1074 1037 962
[ ] [push|pull][1 -> 1] 1037 1037 1037 740 740 1000
[ ] [push|pull][1 -> 2] 1259 1259 1296 1037 1000 1074
[ ] [push|pull][2 -> 0] 1037 1037 1037 1074 1037 1148
[ ] [push|pull][2 -> 1] 1037 1037 1037 1037 925 1074
[ ] [push|pull][2 -> 2] 666 666 740 740 703 925
[ OK ] KFDPerformanceTest.P2POverheadTest (459 ms)
Change-Id: I422263cb52f7ce184f6f1ff4466d04c239fbe9c9
Signed-off-by: xinhui pan <xinhui.pan@amd.com >
2018-09-24 09:28:00 -04:00
e5a541eaf2
kfdtest: Add P2P bandwidth test
...
The test measures the bandwidth between GPUs. Currently we do not
care numa topology as some products really support across PCI-e root
complex p2p.
test result on two gfx900 system.
[ RUN ] KFDPerformanceTest.P2PBandWidthTest
[ ] Copy from node to node by [push, NONE]
[ ] [1 -> 0] 6.13477 - 6.12695 GB/s
[ ] [1 -> 2] 3.77734 - 3.76855 GB/s
[ ] [2 -> 0] 6.67676 - 6.6543 GB/s
[ ] [2 -> 1] 6.14453 - 6.12793 GB/s
[ ] Copy from node to node by [pull, NONE]
[ ] [1 -> 0] 6.10547 - 6.08105 GB/s
[ ] [1 -> 2] 9.65527 - 9.65039 GB/s
[ ] [2 -> 0] 6.49805 - 6.4873 GB/s
[ ] [2 -> 1] 8.95508 - 8.85254 GB/s
[ ] Full duplex copy from node to node by [push|pull, NONE]
[ ] [1 -> 0] 11.0986 - 11.0986 GB/s
[ ] [1 -> 2] 7.54297 - 7.54297 GB/s
[ ] [2 -> 0] 12.0264 - 11.9639 GB/s
[ ] [2 -> 1] 12.0469 - 12.0371 GB/s
[ ] Full duplex copy from node to node by [push, push]
[ ] [1 <-> 2] 11.7324 - 11.4541 GB/s
[ ] Full duplex copy from node to node by [pull, pull]
[ ] [1 <-> 2] 11.4824 - 11.0508 GB/s
[ ] Copy from node to multiple nodes by [push, NONE]
[ ] [1 -> [0...2]] 5.625 - 5.73633 GB/s
[ ] [2 -> [0...2]] 6.45801 - 6.4707 GB/s
[ ] Copy from multiple nodes to node by [push, NONE]
[ ] [[1...2] -> 0] 12.8379 - 12.2578 GB/s
Now we can get more timestamp info like below.
Copy from node to node by [push, NONE]
[1 -> 0]
[1 : 0] #-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-##-#-#-#-#-###############################
[1 : 1] ####################################################################################################
[1 -> 2]
[1 : 0] #--#-#-#-#-#--#-#-#-#-#--#-#-#-#-#--#-#-#-#-#-#--#-#-#-#-#--#-#-#-#-#--#-#-#-#-#-#--#-#-#-#-#--#-#-######################################
[1 : 1] ##################################################################################################-#
[2 -> 0]
[2 : 0] ##-###-##-###-###-##-###-##-###-###-##-###-###-##-###-###-##-###-##-###-###-##-###-###-##-###-###-#################
[2 : 1] ###############################################################################-#############-###-##
[2 -> 1]
[2 : 0] ##-##-##-##-##-###-##-##-##-##-##-###-##-##-##-##-###-##-##-##-##-##-###-##-##-##-##-###-##-##-##-####################
[2 : 1] ################################################################################-###-############-##
[snip]
Full duplex copy from node to node by [push, push]
[1 <-> 2]
[1 : 0] #-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-#-#-#-####################################
[1 : 1] ################-###################################################-############-####-#############
[2 : 2] #-##-##-##-#-##-##-##-##-#-##-##-##-##-#-##-##-##-##-#-##-##-##-##-#-##-##-##-##-##-#-##-##-##-##-#-##-##-##-##-##-#-##################
[2 : 3] #####-######-#####-######-#####-######-#####-######-#####-######-#####-######-#####-######-#####-######-#####-#####-##
Full duplex copy from node to node by [pull, pull]
[1 <-> 2]
[1 : 0] ######################################################################-##-#-###############-####-###
[1 : 1] #-#-#-##-#-#-##-#-#-##-#-#-##-#-#-##-#-#-##-#-#-##-#-#-#-##-#-#-##-#-#-##-#-#-##-#-#-##-#-#-##-#-#-############################
[2 : 2] ##-##-##-##-###-##-##-##-##-###-##-##-##-###-##-##-##-##-###-##-##-##-###-##-##-##-##-###-##-##-##-##-###-##-##-##-###-##-##-############
[2 : 3] #-#-#-#-#-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#########-#############
Copy from node to multiple nodes by [push, NONE]
[1 -> [0...2]]
[1 : 0] #-#--#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-###############################
[1 : 1] ########################################################################################-###-###-###
[2 -> [0...2]]
[2 : 0] ##-##-##-###-##-###-##-##-###-##-###-##-##-###-##-###-##-###-##-##-###-##-###-##-##-###-##-###-##-##################
[2 : 1] -################################################################################################-##
Copy from multiple nodes to node by [push, NONE]
[[1...2] -> 0]
[1 : 0] #-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-##-#-#-#-#-#-#-#-#-##-#-#-#-###############################
[1 : 1] ################################################################################################-#-#
[2 : 2] ##-##-##-###-##-##-###-##-##-##-###-##-##-###-##-##-###-##-##-###-##-##-##-###-##-##-###-##-##-###-##-##################
[2 : 3] #########################-#########################-#########################-#########################
[ OK ] KFDPerformanceTest.P2PBandWidthTest (15982 ms)
Change-Id: Ia90044191d51650ccb220476d31fb317aa3ad6ce
Signed-off-by: xinhui pan <xinhui.pan@amd.com >
2018-09-19 12:03:05 +08:00
Eric Huang
Gang Ba
Jonathan Kim
shaoyunl
xinhui pan