Welcome
Username or Email:

Password:


Missing Code




[ ]
[ ]
Online
  • Guests: 23
  • Members: 0
  • Newest Member: omjtest
  • Most ever online: 396
    Guests: 396, Members: 0 on 12 Jan : 12:51
Members Birthdays:
All today's birthdays', congrats!
Alfons (36)
Coronafix (51)
AmonRa (44)


Next birthdays
05/11 ramses (16)
05/11 Arcstarter (31)
05/11 Zak (15)
Contact
If you need assistance, please send an email to forum at 4hv dot org. To ensure your email is not marked as spam, please include the phrase "4hv help" in the subject line. You can also find assistance via IRC, at irc.shadowworld.net, room #hvcomm.
Support 4hv.org!
Donate:
4hv.org is hosted on a dedicated server. Unfortunately, this server costs and we rely on the help of site members to keep 4hv.org running. Please consider donating. We will place your name on the thanks list and you'll be helping to keep 4hv.org alive and free for everyone. Members whose names appear in red bold have donated recently. Green bold denotes those who have recently donated to keep the server carbon neutral.


Special Thanks To:
  • Aaron Holmes
  • Aaron Wheeler
  • Adam Horden
  • Alan Scrimgeour
  • Andre
  • Andrew Haynes
  • Anonymous000
  • asabase
  • Austin Weil
  • barney
  • Barry
  • Bert Hickman
  • Bill Kukowski
  • Blitzorn
  • Brandon Paradelas
  • Bruce Bowling
  • BubeeMike
  • Byong Park
  • Cesiumsponge
  • Chris F.
  • Chris Hooper
  • Corey Worthington
  • Derek Woodroffe
  • Dalus
  • Dan Strother
  • Daniel Davis
  • Daniel Uhrenholt
  • datasheetarchive
  • Dave Billington
  • Dave Marshall
  • David F.
  • Dennis Rogers
  • drelectrix
  • Dr. John Gudenas
  • Dr. Spark
  • E.TexasTesla
  • eastvoltresearch
  • Eirik Taylor
  • Erik Dyakov
  • Erlend^SE
  • Finn Hammer
  • Firebug24k
  • GalliumMan
  • Gary Peterson
  • George Slade
  • GhostNull
  • Gordon Mcknight
  • Graham Armitage
  • Grant
  • GreySoul
  • Henry H
  • IamSmooth
  • In memory of Leo Powning
  • Jacob Cash
  • James Howells
  • James Pawson
  • Jeff Greenfield
  • Jeff Thomas
  • Jesse Frost
  • Jim Mitchell
  • jlr134
  • Joe Mastroianni
  • John Forcina
  • John Oberg
  • John Willcutt
  • Jon Newcomb
  • klugesmith
  • Leslie Wright
  • Lutz Hoffman
  • Mads Barnkob
  • Martin King
  • Mats Karlsson
  • Matt Gibson
  • Matthew Guidry
  • mbd
  • Michael D'Angelo
  • Mikkel
  • mileswaldron
  • mister_rf
  • Neil Foster
  • Nick de Smith
  • Nick Soroka
  • nicklenorp
  • Nik
  • Norman Stanley
  • Patrick Coleman
  • Paul Brodie
  • Paul Jordan
  • Paul Montgomery
  • Ped
  • Peter Krogen
  • Peter Terren
  • PhilGood
  • Richard Feldman
  • Robert Bush
  • Royce Bailey
  • Scott Fusare
  • Scott Newman
  • smiffy
  • Stella
  • Steven Busic
  • Steve Conner
  • Steve Jones
  • Steve Ward
  • Sulaiman
  • Thomas Coyle
  • Thomas A. Wallace
  • Thomas W
  • Timo
  • Torch
  • Ulf Jonsson
  • vasil
  • Vaxian
  • vladi mazzilli
  • wastehl
  • Weston
  • William Kim
  • William N.
  • William Stehl
  • Wesley Venis
The aforementioned have contributed financially to the continuing triumph of 4hv.org. They are deserving of my most heartfelt thanks.
Forums
4hv.org :: Forums :: Computer Science
« Previous topic | Next topic »   

CPU, graphics cards ,FPGA, multi pics/audino speed

 1 2 3
Move Thread LAN_403
Andy
Fri Dec 06 2013, 08:31AM
Andy Registered Member #4266 Joined: Fri Dec 16 2011, 03:15AM
Location:
Posts: 874
Hi, created a ramdisk speed it up from 1.16min to 59sec. The number of combinations I think might be to high, its 10 chars from 0 to 0xff. I read somewere that 10chars for md5 hash is doable with the right setup, I think they use graphics cards, below is some of the code, apart from asm i'm lost how to speed it up?

for(;hexq[8]<0x01;) {
if(hexq[0] > 0xff) {
hexq[0] =0;
hexq[1]++;
}
if(hexq[1] > 0xff) {
for(i=1;i<=7;i++) {
if(hexq[i] > 0xff) {
hexq[i] = 0x00;
hexq[i]++;
if(type1 < i) type1 = i;
}
}
}


for(s=0,eip=0,pie=0;s<1;s++) {
if(hex[i] > 100 && hex[i] <= 200) goto ten;
if(hex[i] > 200 && hex[i] <= 300) goto ten1;
if(hex[i] > 300 && hex[i] <= 400) goto ten2;
if(hex[i] > 400 && hex[i] <= 500) goto ten3;
if(hex[i] > 500 && hex[i] <= 600) goto ten4;
if(hex[i] > 600 && hex[i] <= 700) goto ten5;
if(hex[i] > 700 && hex[i] <= 800) goto ten6;

if(hex[i] == 0) {
do something
fprintf(data)
goto bot;
}
if(hex[i] == 1) {
do something
fprintf(data)
goto bot;
}


Back to top
Carbon_Rod
Fri Dec 06 2013, 10:35AM
Carbon_Rod Registered Member #65 Joined: Thu Feb 09 2006, 06:43AM
Location:
Posts: 1155
I recommended a dynamic programming abstraction given your algorithm has some overlapping subproblems (you add the same numbers many times in this example). However, you are skipping over some crucial steps by attempting to find more complex ways of permuting through W(k*n^3), rather than solving the actual problem.

ASM can be faster, but in most cases it is not due to architectural and automatic code optimizations of modern C/C++ compilers.
Link2

Best of luck,
Rod
Back to top
Shrad
Fri Dec 06 2013, 06:58PM
Shrad Registered Member #3215 Joined: Sun Sept 19 2010, 08:42PM
Location:
Posts: 780
replace < and > with a mask

a good thing would be to use a single binay mask and << or >> the mask or the number to crunch

it is easy to see if a number is higher than a multiple of 2 with a mask, and increment this value either by the mask or the value with a pad by 2 operator
Back to top
Andy
Wed Dec 11 2013, 06:02PM
Andy Registered Member #4266 Joined: Fri Dec 16 2011, 03:15AM
Location:
Posts: 874
Thanks you three for the help, The projects on hold, I let to much dust cover the cpu heat sink, and have fried it :( , but its mostly done
Back to top
 1 2 3

Moderator(s): Chris Russell, Noelle, Alex, Tesladownunder, Dave Marshall, Dave Billington, Bjørn, Steve Conner, Wolfram, Kizmo, Mads Barnkob

Go to:

Powered by e107 Forum System
 
Legal Information
This site is powered by e107, which is released under the GNU GPL License. All work on this site, except where otherwise noted, is licensed under a Creative Commons Attribution-ShareAlike 2.5 License. By submitting any information to this site, you agree that anything submitted will be so licensed. Please read our Disclaimer and Policies page for information on your rights and responsibilities regarding this site.