1
0
mirror of https://github.com/GOSTSec/sgminer synced 2025-01-01 18:55:36 +00:00
Commit Graph

6 Commits

Author SHA1 Message Date
Elbandi
db40274d6e convert tabs to spaces in kernel files
and remove whitespace from lineends
2014-07-02 23:16:33 +02:00
Noel Maersk
11cf733ede misc: fix spaces after closing parenthesis.
sed -i 's/) $/)/' *.cl
2014-02-26 04:32:49 +02:00
Noel Maersk
e18bcc2582 kernel: use N-factor table instead of passing parameter N directly. 2014-02-26 04:30:46 +02:00
Teemu Suikki
73bb1504e9 Scrypt-nfactor support!
Added new configuration parameter "nfactor", which defaults to 10 (normal scrypt).
Use 11 for vertcoin.

Kernels modified accordingly.
2014-02-23 04:44:17 +02:00
Noel Maersk
5f326d64f5 kernel: allow choosing Alexey Karimov's kernels.
Am I the only one who gets a segfault?..
2014-01-21 10:36:55 +02:00
Noel Maersk
81337e0064 kernel: vanilla Alexey Karimov kernels (alexkarnew and alexkarold).
alexkarnew: (for driver 13.4 and newer, and cgminer 3.3.1)
alexkarold: (for older drivers than 13.4, and cgminer 3.3.1)

https://litecointalk.org/index.php?topic=4082.0

> I was able to optimize the code of cgminer's scrypt.cl.
> It gives 0-3% increase, depending on the drivers and hardware.

> 1. Without optimization, when "CO" is used, every time
> z+x*zSIZE+y*xSIZE*zSIZE is calculated.

> I have created "CO" variable, and made so that x*SIZE is calculated only
> once. Now, when "CO" is used, every time z+y*xSIZE*zSIZE is calculated.

> In one case, variable y is incremented by 1 after 8 "CO" calculations.
> I have created "CO_tmp" variable, where contains result of xSIZE*zSIZE.
> And after 8 "CO" calculations I add "CO_tmp" to "CO".

> Now, when "CO" is used, every time only z is calculated. It is faster as
> z+x*zSIZE+y*xSIZE*zSIZE :)

> In other case when "CO" is used, every time z+y*xSIZE*zSIZE is
> calculated, but it faster than z+x*zSIZE+y*xSIZE*zSIZE too.

> 2. I have replaced multiplication by 2 with bit rotation - it is faster.

> For 7xxx cards you can try to set --thread-concurrency equal to (2^n + 1).
> It may give a little more mining speed.
> For example: 16385 (it is 2^14 + 1), 8193 (2^13 + 1), or 4097 (2^12 + 1).
> I have almost no information, how it works on other series.

> LMqRcHdwnZtTMH6c2kWoxSoKM5KySfaP5C
2014-01-21 09:45:10 +02:00