4510-4511e15 104 kgaps, largest 1150 @ 4510551287433857893

Taking 4480-4510

4172-4184e15 done:
[CODE]4172-4173e15 86 kgaps, largest 1164 @ 4172197999825460237
4173-4174e15 77 kgaps, largest 1128 @ 4173639284611610651
4174-4175e15 101 kgaps, largest 1258 @ 4174306654709908819
4175-4176e15 93 kgaps, largest 1210 @ 4175204195980722601
4176-4177e15 98 kgaps, largest 1198 @ 4176861996398448109
4177-4178e15 93 kgaps, largest 1186 @ 4177103332458339433
4178-4179e15 91 kgaps, largest 1162 @ 4178086739677893811
4179-4180e15 81 kgaps, largest 1158 @ 4179953031572088851
4180-4181e15 85 kgaps, largest 1236 @ 4180772784476386531
4181-4182e15 90 kgaps, largest 1140 @ 4181755713688388989
4182-4183e15 92 kgaps, largest 1188 @ 4182100541518529999
4183-4184e15 91 kgaps, largest 1220 @ 4183066986699910637
[/CODE]

Taking 4073 to 4080. I won't be able to update the reservations and results table until tomorrow.

[QUOTE=pinhodecarlos;460821]Taking 4480-4510[/QUOTE]
Need to extend this range to 4470-4510. Thank you.

Completed 4243 - 4247e15 no new records.
[CODE]4243-4244e15 120 kgaps, largest 1210 @ 4243542148062955873
4244-4245e15 110 kgaps, largest 1212 @ 4244016190180732571
4245-4246e15 118 kgaps, largest 1232 @ 4245596174022128729
4246-4247e15 98 kgaps, largest 1154 @ 4246928654002220909[/CODE]Reserving 4250-4260e15

4093-4096 done.

[QUOTE=Antonio;460755]ok I've compiled a version that should work on your i7-870 (Lynnfield) see attached.[/QUOTE]

Thanks a lot!

My newer PC is still working on another job which will hopefully be done within the next two weeks, until then...

for a start, I'll take 4084-4085.

[QUOTE=mart_r;460887]Thanks a lot!

My newer PC is still working on another job which will hopefully be done within the next two weeks, until then...

for a start, I'll take 4084-4085.[/QUOTE]
You're welcome. Try the Nehalem build in post 207, it should be faster as it's better tuned to your i7-870.

[QUOTE=R. Gerbicz;458506]Don't know why, but qsort not sorted the GAP struct (what is working on linux), so replaced it with bubble sort, see the newer gap2.c in the attachment. The first gap.c under linux is still good, but on windows due to qsort it is missing a lot of solutions (only at print due to qsort). Running the code on Win10 is slower than linux by roughly 4 percentage, still not that bad.

Type ./gap -h to see the options of the program.[/QUOTE]

I think the problem is that qsort expects one of three possible values from your compare i.e.
a > b (return +ve integer)
a = b (return 0)
a < b (return -ve integer)

your comp() can only return a>b or a=b
since a = b cannot occur in our case we should replace:
[CODE]int comp(const void *a,const void *b){
GAP *gap1=(GAP*)a;
GAP *gap2=(GAP*)b;
return(gap2->p1<gap1->p1);
}
[/CODE]
with:
[CODE]int comp(const void *a, const void *b){
GAP *gap1=(GAP*)a;
GAP *gap2=(GAP*)b;
// if (gap2->p1 == gap1->p1) return 0;
return((gap2->p1 < gap1->p1) ? 1 : -1);
}
[/CODE]

Here are the latest stats - we shall pass 30% today.

Largest gap found = 1386
Gaps of 1300 or greater were found in 14 ranges out of 295 (4.7% of ranges)
Gaps found in the records range = 5 (frequency 1 per 59 ranges)
Records found = 0

And then there were 8 searchers!

[CODE]

searcher compl. res'd

Thomas11 84 26
antonio 58 13
robert44444uk 53 10
pinhodecarlos 21 44
danaj 75 26
ET_ 3 2
henryzz 1 9
mart_r 0 1

Total 295 131


[/CODE]