-
Notifications
You must be signed in to change notification settings - Fork 96
Raspberry Pi 2 (BCM2836)
Siarhei Siamashka edited this page Feb 14, 2015
·
1 revision
processor : 0 model name : ARMv7 Processor rev 5 (v7l) BogoMIPS : 57.60 Features : half thumb fastmult vfp edsp neon vfpv3 tls vfpv4 idiva idivt vfpd32 lpae evtstrm CPU implementer : 0x41 CPU architecture: 7 CPU variant : 0x0 CPU part : 0xc07 CPU revision : 5 processor : 1 model name : ARMv7 Processor rev 5 (v7l) BogoMIPS : 57.60 Features : half thumb fastmult vfp edsp neon vfpv3 tls vfpv4 idiva idivt vfpd32 lpae evtstrm CPU implementer : 0x41 CPU architecture: 7 CPU variant : 0x0 CPU part : 0xc07 CPU revision : 5 processor : 2 model name : ARMv7 Processor rev 5 (v7l) BogoMIPS : 57.60 Features : half thumb fastmult vfp edsp neon vfpv3 tls vfpv4 idiva idivt vfpd32 lpae evtstrm CPU implementer : 0x41 CPU architecture: 7 CPU variant : 0x0 CPU part : 0xc07 CPU revision : 5 processor : 3 model name : ARMv7 Processor rev 5 (v7l) BogoMIPS : 57.60 Features : half thumb fastmult vfp edsp neon vfpv3 tls vfpv4 idiva idivt vfpd32 lpae evtstrm CPU implementer : 0x41 CPU architecture: 7 CPU variant : 0x0 CPU part : 0xc07 CPU revision : 5 Hardware : BCM2709 Revision : a01041 Serial : 00000000ec797b2c
The standard 900MHz configuration without any overclocking or config.txt tweaks (2015-01-31-raspbian) and no monitor connected
tinymembench v0.3.9 (simple benchmark for memory throughput and latency)
==========================================================================
== Memory bandwidth tests ==
== ==
== Note 1: 1MB = 1000000 bytes ==
== Note 2: Results for 'copy' tests show how many bytes can be ==
== copied per second (adding together read and writen ==
== bytes would have provided twice higher numbers) ==
== Note 3: 2-pass copy means that we are using a small temporary buffer ==
== to first fetch data into it, and only then write it to the ==
== destination (source -> L1 cache, L1 cache -> destination) ==
== Note 4: If sample standard deviation exceeds 0.1%, it is shown in ==
== brackets ==
==========================================================================
C copy backwards : 819.5 MB/s
C copy : 970.1 MB/s (5.4%)
C copy prefetched (32 bytes step) : 920.6 MB/s
C copy prefetched (64 bytes step) : 920.2 MB/s
C 2-pass copy : 612.6 MB/s (0.3%)
C 2-pass copy prefetched (32 bytes step) : 624.8 MB/s
C 2-pass copy prefetched (64 bytes step) : 624.8 MB/s (0.8%)
C fill : 1209.9 MB/s (0.5%)
---
standard memcpy : 1006.9 MB/s
standard memset : 1210.3 MB/s (0.5%)
---
NEON read : 1341.3 MB/s (5.3%)
NEON read prefetched (32 bytes step) : 1370.8 MB/s
NEON read prefetched (64 bytes step) : 1364.3 MB/s (5.6%)
NEON read 2 data streams : 386.0 MB/s (0.1%)
NEON read 2 data streams prefetched (32 bytes step) : 718.6 MB/s
NEON read 2 data streams prefetched (64 bytes step) : 757.6 MB/s
NEON copy : 990.0 MB/s
NEON copy prefetched (32 bytes step) : 954.3 MB/s
NEON copy prefetched (64 bytes step) : 1028.2 MB/s
NEON unrolled copy : 941.5 MB/s
NEON unrolled copy prefetched (32 bytes step) : 916.5 MB/s
NEON unrolled copy prefetched (64 bytes step) : 983.7 MB/s
NEON copy backwards : 825.9 MB/s
NEON copy backwards prefetched (32 bytes step) : 784.6 MB/s
NEON copy backwards prefetched (64 bytes step) : 861.2 MB/s
NEON 2-pass copy : 628.8 MB/s
NEON 2-pass copy prefetched (32 bytes step) : 646.2 MB/s
NEON 2-pass copy prefetched (64 bytes step) : 652.2 MB/s
NEON unrolled 2-pass copy : 589.8 MB/s
NEON unrolled 2-pass copy prefetched (32 bytes step) : 583.8 MB/s
NEON unrolled 2-pass copy prefetched (64 bytes step) : 613.9 MB/s
NEON fill : 1210.4 MB/s
NEON fill backwards : 1209.8 MB/s
VFP copy : 950.9 MB/s
VFP 2-pass copy : 590.1 MB/s
ARM fill (STRD) : 1209.2 MB/s
ARM fill (STM with 8 registers) : 1210.3 MB/s
ARM fill (STM with 4 registers) : 1210.4 MB/s
ARM copy prefetched (incr pld) : 965.5 MB/s
ARM copy prefetched (wrap pld) : 833.2 MB/s
ARM 2-pass copy prefetched (incr pld) : 638.9 MB/s
ARM 2-pass copy prefetched (wrap pld) : 609.4 MB/s
==========================================================================
== Memory latency test ==
== ==
== Average time is measured for random memory accesses in the buffers ==
== of different sizes. The larger is the buffer, the more significant ==
== are relative contributions of TLB, L1/L2 cache misses and SDRAM ==
== accesses. For extremely large buffer sizes we are expecting to see ==
== page table walk with several requests to SDRAM for almost every ==
== memory access (though 64MiB is not nearly large enough to experience ==
== this effect to its fullest). ==
== ==
== Note 1: All the numbers are representing extra time, which needs to ==
== be added to L1 cache latency. The cycle timings for L1 cache ==
== latency can be usually found in the processor documentation. ==
== Note 2: Dual random read means that we are simultaneously performing ==
== two independent memory accesses at a time. In the case if ==
== the memory subsystem can't handle multiple outstanding ==
== requests, dual random read has the same timings as two ==
== single reads performed one after another. ==
==========================================================================
block size : single random read / dual random read
1024 : 0.0 ns / 0.0 ns
2048 : 0.0 ns / 0.0 ns
4096 : 0.0 ns / 0.0 ns
8192 : 0.0 ns / 0.0 ns
16384 : 0.0 ns / 0.0 ns
32768 : 0.0 ns / 0.1 ns
65536 : 6.5 ns / 11.6 ns
131072 : 10.0 ns / 16.8 ns
262144 : 11.8 ns / 19.1 ns
524288 : 16.7 ns / 26.8 ns
1048576 : 89.2 ns / 142.3 ns
2097152 : 134.8 ns / 190.1 ns
4194304 : 158.4 ns / 208.7 ns
8388608 : 172.0 ns / 218.1 ns
16777216 : 183.0 ns / 229.2 ns
33554432 : 193.0 ns / 243.0 ns
67108864 : 209.1 ns / 272.4 ns
The standard 900MHz configuration without any overclocking or config.txt tweaks (2015-01-31-raspbian) and a 1920x1080-32@60Hz HDMI monitor connected
tinymembench v0.3.9 (simple benchmark for memory throughput and latency)
==========================================================================
== Memory bandwidth tests ==
== ==
== Note 1: 1MB = 1000000 bytes ==
== Note 2: Results for 'copy' tests show how many bytes can be ==
== copied per second (adding together read and writen ==
== bytes would have provided twice higher numbers) ==
== Note 3: 2-pass copy means that we are using a small temporary buffer ==
== to first fetch data into it, and only then write it to the ==
== destination (source -> L1 cache, L1 cache -> destination) ==
== Note 4: If sample standard deviation exceeds 0.1%, it is shown in ==
== brackets ==
==========================================================================
C copy backwards : 774.0 MB/s (1.6%)
C copy : 898.5 MB/s
C copy prefetched (32 bytes step) : 862.4 MB/s (7.1%)
C copy prefetched (64 bytes step) : 862.3 MB/s
C 2-pass copy : 568.8 MB/s (0.4%)
C 2-pass copy prefetched (32 bytes step) : 584.8 MB/s
C 2-pass copy prefetched (64 bytes step) : 584.5 MB/s (0.4%)
C fill : 1134.5 MB/s (0.2%)
---
standard memcpy : 922.8 MB/s (1.2%)
standard memset : 1136.1 MB/s
---
NEON read : 1245.1 MB/s (0.7%)
NEON read prefetched (32 bytes step) : 1281.0 MB/s
NEON read prefetched (64 bytes step) : 1283.5 MB/s (0.6%)
NEON read 2 data streams : 369.5 MB/s (0.1%)
NEON read 2 data streams prefetched (32 bytes step) : 688.4 MB/s
NEON read 2 data streams prefetched (64 bytes step) : 723.8 MB/s
NEON copy : 910.5 MB/s
NEON copy prefetched (32 bytes step) : 874.4 MB/s
NEON copy prefetched (64 bytes step) : 946.8 MB/s
NEON unrolled copy : 867.0 MB/s
NEON unrolled copy prefetched (32 bytes step) : 861.7 MB/s
NEON unrolled copy prefetched (64 bytes step) : 916.7 MB/s
NEON copy backwards : 742.3 MB/s
NEON copy backwards prefetched (32 bytes step) : 723.4 MB/s
NEON copy backwards prefetched (64 bytes step) : 762.7 MB/s
NEON 2-pass copy : 583.0 MB/s
NEON 2-pass copy prefetched (32 bytes step) : 605.6 MB/s
NEON 2-pass copy prefetched (64 bytes step) : 612.5 MB/s
NEON unrolled 2-pass copy : 547.6 MB/s
NEON unrolled 2-pass copy prefetched (32 bytes step) : 543.9 MB/s
NEON unrolled 2-pass copy prefetched (64 bytes step) : 572.0 MB/s
NEON fill : 1136.4 MB/s
NEON fill backwards : 1136.7 MB/s
VFP copy : 873.9 MB/s
VFP 2-pass copy : 548.5 MB/s
ARM fill (STRD) : 1133.1 MB/s
ARM fill (STM with 8 registers) : 1136.6 MB/s
ARM fill (STM with 4 registers) : 1135.8 MB/s
ARM copy prefetched (incr pld) : 894.0 MB/s
ARM copy prefetched (wrap pld) : 736.6 MB/s
ARM 2-pass copy prefetched (incr pld) : 594.5 MB/s
ARM 2-pass copy prefetched (wrap pld) : 559.6 MB/s
==========================================================================
== Memory latency test ==
== ==
== Average time is measured for random memory accesses in the buffers ==
== of different sizes. The larger is the buffer, the more significant ==
== are relative contributions of TLB, L1/L2 cache misses and SDRAM ==
== accesses. For extremely large buffer sizes we are expecting to see ==
== page table walk with several requests to SDRAM for almost every ==
== memory access (though 64MiB is not nearly large enough to experience ==
== this effect to its fullest). ==
== ==
== Note 1: All the numbers are representing extra time, which needs to ==
== be added to L1 cache latency. The cycle timings for L1 cache ==
== latency can be usually found in the processor documentation. ==
== Note 2: Dual random read means that we are simultaneously performing ==
== two independent memory accesses at a time. In the case if ==
== the memory subsystem can't handle multiple outstanding ==
== requests, dual random read has the same timings as two ==
== single reads performed one after another. ==
==========================================================================
block size : single random read / dual random read
1024 : 0.0 ns / 0.0 ns
2048 : 0.0 ns / 0.0 ns
4096 : 0.0 ns / 0.0 ns
8192 : 0.0 ns / 0.0 ns
16384 : 0.0 ns / 0.0 ns
32768 : 0.2 ns / 0.2 ns
65536 : 6.5 ns / 11.7 ns
131072 : 10.0 ns / 16.9 ns
262144 : 11.8 ns / 19.2 ns
524288 : 16.4 ns / 26.0 ns
1048576 : 95.3 ns / 151.8 ns
2097152 : 143.3 ns / 201.9 ns
4194304 : 168.2 ns / 221.5 ns
8388608 : 182.9 ns / 232.1 ns
16777216 : 194.1 ns / 243.1 ns
33554432 : 205.3 ns / 259.0 ns
67108864 : 225.5 ns / 296.8 ns
Kernel 4.9.140-tegra #1 SMP PREEMPT Wed Mar 13 00:32:22 PDT 2019 aarch64 GNU/Linux Under xorg, no compositor active, no browser or other cpu hogs.
tinymembench v0.4.9 (simple benchmark for memory thr
==========================================================================
== Memory bandwidth tests ==
== ==
== Note 1: 1MB = 1000000 bytes ==
== Note 2: Results for 'copy' tests show how many bytes can be ==
== copied per second (adding together read and writen ==
== bytes would have provided twice higher numbers) ==
== Note 3: 2-pass copy means that we are using a small temporary buffer ==
== to first fetch data into it, and only then write it to the ==
== destination (source -> L1 cache, L1 cache -> destination) ==
== Note 4: If sample standard deviation exceeds 0.1%, it is shown in ==
== brackets ==
==========================================================================
C copy backwards : 2949.7 MB/s (3.8%)
C copy backwards (32 byte blocks) : 3011.8 MB/s
C copy backwards (64 byte blocks) : 3029.2 MB/s
C copy : 3642.2 MB/s (4.1%)
C copy prefetched (32 bytes step) : 3824.4 MB/s (0.3%)
C copy prefetched (64 bytes step) : 3825.3 MB/s (0.4%)
C 2-pass copy : 2726.2 MB/s
C 2-pass copy prefetched (32 bytes step) : 2902.6 MB/s (2.5%)
C 2-pass copy prefetched (64 bytes step) : 2928.3 MB/s (0.3%)
C fill : 8541.0 MB/s (0.2%)
C fill (shuffle within 16 byte blocks) : 8518.5 MB/s (2.1%)
C fill (shuffle within 32 byte blocks) : 8537.1 MB/s (0.1%)
C fill (shuffle within 64 byte blocks) : 8528.7 MB/s (0.2%)
---
standard memcpy : 3558.8 MB/s
standard memset : 8520.2 MB/s
---
NEON LDP/STP copy : 3633.9 MB/s (4.2%)
NEON LDP/STP copy pldl2strm (32 bytes step) : 1451.0 MB/s (0.3%)
NEON LDP/STP copy pldl2strm (64 bytes step) : 1450.9 MB/s (0.5%)
NEON LDP/STP copy pldl1keep (32 bytes step) : 3882.5 MB/s (3.9%)
NEON LDP/STP copy pldl1keep (64 bytes step) : 3884.0 MB/s (0.4%)
NEON LD1/ST1 copy : 3630.8 MB/s (0.3%)
NEON STP fill : 8537.8 MB/s
NEON STNP fill : 8544.9 MB/s (1.7%)
ARM LDP/STP copy : 3635.8 MB/s (0.3%)
ARM STP fill : 8544.8 MB/s (0.1%)
ARM STNP fill : 8549.2 MB/s (1.0%)
==========================================================================
== Framebuffer read tests. ==
== ==
== Many ARM devices use a part of the system memory as the framebuffer, ==
== typically mapped as uncached but with write-combining enabled. ==
== Writes to such framebuffers are quite fast, but reads are much ==
== slower and very sensitive to the alignment and the selection of ==
== CPU instructions which are used for accessing memory. ==
== ==
== Many x86 systems allocate the framebuffer in the GPU memory, ==
== accessible for the CPU via a relatively slow PCI-E bus. Moreover, ==
== PCI-E is asymmetric and handles reads a lot worse than writes. ==
== ==
== If uncached framebuffer reads are reasonably fast (at least 100 MB/s ==
== or preferably >300 MB/s), then using the shadow framebuffer layer ==
== is not necessary in Xorg DDX drivers, resulting in a nice overall ==
== performance improvement. For example, the xf86-video-fbturbo DDX ==
== uses this trick. ==
==========================================================================
NEON LDP/STP copy (from framebuffer) : 766.0 MB/s
NEON LDP/STP 2-pass copy (from framebuffer) : 688.8 MB/s
NEON LD1/ST1 copy (from framebuffer) : 770.6 MB/s (0.1%)
NEON LD1/ST1 2-pass copy (from framebuffer) : 681.3 MB/s (0.3%)
ARM LDP/STP copy (from framebuffer) : 766.1 MB/s
ARM LDP/STP 2-pass copy (from framebuffer) : 689.1 MB/s
==========================================================================
== Memory latency test ==
== ==
== Average time is measured for random memory accesses in the buffers ==
== of different sizes. The larger is the buffer, the more significant ==
== are relative contributions of TLB, L1/L2 cache misses and SDRAM ==
== accesses. For extremely large buffer sizes we are expecting to see ==
== page table walk with several requests to SDRAM for almost every ==
== memory access (though 64MiB is not nearly large enough to experience ==
== this effect to its fullest). ==
== ==
== Note 1: All the numbers are representing extra time, which needs to ==
== be added to L1 cache latency. The cycle timings for L1 cache ==
== latency can be usually found in the processor documentation. ==
== Note 2: Dual random read means that we are simultaneously performing ==
== two independent memory accesses at a time. In the case if ==
== the memory subsystem can't handle multiple outstanding ==
== requests, dual random read has the same timings as two ==
== single reads performed one after another. ==
==========================================================================
block size : single random read / dual random read, [MADV_NOHUGEPAGE]
1024 : 0.0 ns / 0.1 ns
2048 : 0.0 ns / 0.1 ns
4096 : 0.0 ns / 0.1 ns
8192 : 0.0 ns / 0.1 ns
16384 : 0.1 ns / 0.1 ns
32768 : 1.7 ns / 2.9 ns
65536 : 6.4 ns / 9.5 ns
131072 : 9.6 ns / 12.3 ns
262144 : 13.7 ns / 17.0 ns
524288 : 15.8 ns / 19.7 ns
1048576 : 17.3 ns / 22.1 ns
2097152 : 42.1 ns / 64.2 ns
4194304 : 98.5 ns / 138.1 ns
8388608 : 143.9 ns / 186.3 ns
16777216 : 167.2 ns / 211.2 ns
33554432 : 180.1 ns / 227.1 ns
67108864 : 200.0 ns / 260.2 ns
block size : single random read / dual random read, [MADV_HUGEPAGE]
1024 : 0.0 ns / 0.0 ns
2048 : 0.0 ns / 0.0 ns
4096 : 0.0 ns / 0.0 ns
8192 : 0.0 ns / 0.0 ns
16384 : 0.0 ns / 0.0 ns
32768 : 0.0 ns / 0.0 ns
65536 : 6.4 ns / 9.4 ns
131072 : 9.5 ns / 12.2 ns
262144 : 11.2 ns / 13.1 ns
524288 : 12.1 ns / 13.5 ns
1048576 : 12.8 ns / 13.6 ns
2097152 : 27.0 ns / 33.0 ns
4194304 : 90.6 ns / 127.8 ns
8388608 : 123.9 ns / 153.8 ns
16777216 : 139.5 ns / 161.2 ns
33554432 : 147.2 ns / 163.6 ns
67108864 : 154.0 ns / 167.6 ns