Cryptographers have a mechanism for securely turning human-readable text into secret material: key derivation functions. All the modern KDFs are adaptive, meaning that they come with a "pain" dial that you can turn to force attackers to spend more time executing crypto code paths and less time comparing results.
You can build decent KDFs out of functions like SHA1, but if hardware GPU cracking is the future, you're best off with something like Colin Percival's "scrypt", which was explicitly designed to be memory-hard (requiring lots of state to compute) and hard to parallelize:
So at peak rates I think that would come out to around 26 hours.
Combinations/SHA1HashesPerSecond/SecondsPerHour
(26 * 2 + 10) ^ 8 / (2300 * 1000000) / 3600 = 26
At any rate, you can download ighashgpu and try it for yourself.
I'd be curious about the timeliness of GPU cracking a 8 character, alphanumerical mixed case password hashed with SHA1?