This is the number of attempts per second. It does not take in to account less than brute force attacks against the algorithms or the total effective keyspace of the algorithms. It only takes in to account the difficulty of performing the actual calculation. Since SHA-3 is a hash, it is fairly simple to computer where as DES is an encryption operation and is much more computationally difficult per attempt.
It also doesn't take in to account a hash is not the same as an encryption algorithm, so they are not even remotely comparable, but even if they were, it wouldn't say anything about the security.
The difference in security between them comes from weaknesses that allow for an effective reduction of keyspace (ie, the number of attempts that need to be made). If I have one algorithm that takes 5 minutes to make 1 attempt, but only has 10 possible keys, it will only take me 50 minutes to crack it (on average, only 25 minutes). If on the other hand I have an algorithm that I can make 1000 tries per second, but I have to try a trillion possibilities, I'm going to be sitting around trying for a very long time.
A theoretically perfect encryption algorithm should be indistinguishable from random. If there is a 8 bit key for example, it should require 128 tries on average to find a match in the 256 possible keys. However, problems in the algorithms tend to reduce this by either small or large amounts, so instead of requiring 128 tries, maybe half of the keys can be determined to not match easily, in this case, it now only takes 64 tries on average because the effective key space is reduced to 7 bits. These kinds of problems are what make encryption algorithms more or less secure when compared to a theoretical perfect algorithm.