Thanks for all the help, I'll implement the changes and report back with the results.
Type: Posts; User: bennyandthejets
Thanks for all the help, I'll implement the changes and report back with the results.
I will certainly try all those things, they sound promising. I have 3 SATA hard drives, with several partitions, but:
a) should the paging file be on a different physical drive to the OS?
b)...
I agree. With all the different drivers I've been using, I think the ones that came with the hardware are the most stable. It still makes no difference to Call Of Duty 2.
An update on Farcry: I...
Thanks for the advice. I'll try calling Asus, but I'm in Australia so it might be difficult to find a local contact.
I was thinking of writing a program to start a game as a debugged process, and...
It's a Shaw 450W power supply, and the chipset is nForce 4. It's 1gb of ram, 2*512. I'm thinking of buying another gig, but I'm sure that won't help this particular problem. Anything else it could...
The card isn't overclocked, nor is any other part of the computer. The temperatures are fine, CPU never goes above 35, GPU never above 40.
Specifically, when it stalls, the screen will either go...
Asus EN7800 GTX
It's very new and is supposed to be excellent.
I'm having issues with games on my new computer. They sometimes work, and sometimes stall, and I think either DirectX or my onboard sound has something to do with it. Here's my specs:
Asus A8N-E...
Thanks, that got me onto some good stuff.
My Unix program doesn't know at compile time what dlls it will be using. Each dll will have a few predetermined interface functions, but otherwise will be unique. How can I access these dlls and...
I cleaned up the code for long multiplication, but could only get it a little bit faster than it was before. I'm going to look into the Karatsuba algorithm, where each number is recursively split...
Thanks for the advice. I'll fix those aspects up, do some reading, and get back to you on the improvement I get. Maybe I'll even do some efficiency charts or something crazy like that.
That'd be great if you could have a look. rsa_dll.cpp compiles to a dynamic link library, and rsa_prog.cpp imports it.
Okay, I'll give that a shot. Are you sure however that there are no absolutely horrible methods that I am using? It doesn't seem like I could improve my speed so much just by allocating memory more...
MassiveInt MassiveInt::PowMod(const MassiveInt& power, const MassiveInt& mod) const {
int nFactors=power.nSize*8;
MassiveInt **Factors=new MassiveInt*[nFactors];
newcount++;
for...
Nup, I just want something reasonable. I would like to be able to perform operations that large at something like 15 per second.
I'm sure that's the case. I don't understand how your code works...
I've been looking at the source for GMP, but the actual computational code is in assembly, and I'm not very proficient at reading it. Does this sort of thing absolutely have to be done in assembly,...
I'm not familiar with that terminology. Could you briefly explain each one, or refer me to an online resource?
I can't use the Chinese Remainder Theorem because the whole point is that RSA encryption keys are too large to factor, so I won't know the factors of whatever 'm' is.
I've implemented a good...
I have some value 'a' that I want to raise to the power of 'e', then take modulo 'm'. I split a^e into multiple factors, each a binary power of a. Ie: a^7=(a^4)(a^2)(a^1). I calculate each of those...
I've just completed a program which does arithmetic on arbitrarily large integers, and I'd now like to implement RSA encryption with it. Unfortunately, it seems that I am doing things very...
I found the problem. It was a sly, sneaky out of bounds error. All it did was corrupt the heap behind the scenes, while still allowing the correct answer to be output if the numbers were small...
I added some counters to check if I'm destructing all instances and deleting all memory. I lowered the exponent just enough so that I wouldn't get a seg fault, and both counters were at zero,...
I increased how high the code above can calculate by truncating the numbers when they have too many leading zeros. However, I still get segmentation faults at around 3^92, and I need to go far higher...
I'll have a look at that, thanks. In the meantime, here's some code which I have shrunk as much as possible. The error is still occuring.