On 4/1/06, Joshua Daniel Franklin wrote:
> On 3/30/06, Dave Korn wrote:
> > As to the FAQ entry, it really needs a little alteration. Ping JDF!
> >
> > It should make clear that those parameters are in bytes. The example of a
> > 4k stack and 1k heap is a bit unrealistic and it might be more
On 3/30/06, Dave Korn wrote:
> As to the FAQ entry, it really needs a little alteration. Ping JDF!
>
> It should make clear that those parameters are in bytes. The example of a
> 4k stack and 1k heap is a bit unrealistic and it might be more productive to
> show people how to make exes with /
On 30 March 2006 15:49, Pete wrote:
> --- Dave Korn <[EMAIL PROTECTED]> wrote:
Pete, please don't do ^^ that. If you quote someone's email address
in raw text, it gets archived on the mailinglist web archive, and then
spam-harvesters get it, and then that person gets a BOATLOAD more sp
--- Dave Korn <[EMAIL PROTECTED]> wrote:
> 21.
>
> How can I adjust the heap/stack size of an
> application?
>
> If you need to change the maximum amount of memory
> available to Cygwin, see
> http://cygwin.com/cygwin-ug-net/setup-maxmem.html.
BTW, is there a corresponding way of specif
--- Dave Korn <[EMAIL PROTECTED]> wrote:
> On 30 March 2006 14:34, Pete wrote:
>
> > The executable is produced with:
> >
> > $ make
> > g++ -W -Wall -O9 -funroll-loops -mtune=pentium4
> -c
> > -o matrix_mult_r.o matrix_mult_r.cc
>
> Heh.
>
>
> matrix_mult_r.cc:5:19: Timer.h: No such file
On 30 March 2006 14:51, Pete wrote:
> It reports back 1536 MB. Very strange! The registry
> setting appears to not be having an effect.
1.5 Gig is about the most it's possible to get under 'doze. The address
space of the processor is 4gig, the upper 2 gig (addr >= 0x8000) belong to
the
On 30 March 2006 14:34, Pete wrote:
> The executable is produced with:
>
> $ make
> g++ -W -Wall -O9 -funroll-loops -mtune=pentium4 -c
> -o matrix_mult_r.o matrix_mult_r.cc
Heh.
matrix_mult_r.cc:5:19: Timer.h: No such file or directory
matrix_mult_r.cc: In function `int main()':
matrix_mul
--- Corinna Vinschen <[EMAIL PROTECTED]>
wrote:
> On Mar 30 12:14, Dave Korn wrote:
> > On 30 March 2006 12:08, Corinna Vinschen wrote:
> >
> >
> > >>> #define N 600 // Matrix rank
> > >>> // We multiply m1 and m2, and put the result
> in m3.
> > >>> int m1[N][N];
> >
--- Dave Korn <[EMAIL PROTECTED]> wrote:
> On 29 March 2006 21:22, Pete wrote:
>
> > I have some benchmarkign code
> >
> > #define N 600 // Matrix rank
> > #define ITERATIONS 2000
> >
> >
> >
> > int main( void )
> > {
> > // Set up the timer and start it ticking.
> > Timer
On 30 March 2006 14:09, Alexander Herrmann wrote:
>> int main( void )
>> {
>> // Set up the timer and start it ticking.
>> Timer timer;
>> timer.startTimer();
>>
>> // We multiply m1 and m2, and put the result in m3.
>> int m1[N][N];
>> int m2[N][N
On 3/30/06, Pete <[EMAIL PROTECTED]> wrote:
> I have some benchmarkign code
>
> #define N 600 // Matrix rank
> #define ITERATIONS 2000
>
>
>
> int main( void )
> {
> // Set up the timer and start it ticking.
> Timer timer;
> timer.startTimer();
>
> // We mu
On 30 March 2006 13:18, Corinna Vinschen wrote:
> On Mar 30 12:14, Dave Korn wrote:
>> On 30 March 2006 12:08, Corinna Vinschen wrote:
>>
>>
> #define N 600 // Matrix rank
> // We multiply m1 and m2, and put the result in m3. int m1[N][N];
> int m2[N][N];
> in
On Mar 30 12:14, Dave Korn wrote:
> On 30 March 2006 12:08, Corinna Vinschen wrote:
>
>
> >>> #define N 600 // Matrix rank
> >>> // We multiply m1 and m2, and put the result in m3.
> >>> int m1[N][N];
> >>> int m2[N][N];
> >>> int m3[N][N];
>
> > No wonder. 600**3 * sizeof (in
On 30 March 2006 12:08, Corinna Vinschen wrote:
>>> #define N 600 // Matrix rank
>>> // We multiply m1 and m2, and put the result in m3.
>>> int m1[N][N];
>>> int m2[N][N];
>>> int m3[N][N];
> No wonder. 600**3 * sizeof (int) * 3 == 259200 ~= 2.4 Gigs.
Those mat
On Mar 30 11:29, Dave Korn wrote:
> On 29 March 2006 21:22, Pete wrote:
>
> > I have some benchmarkign code
> >
> > #define N 600 // Matrix rank
> > #define ITERATIONS 2000
> >
> >
> >
> > int main( void )
> > {
> > // Set up the timer and start it ticking.
> > Timer timer;
>
On 29 March 2006 21:22, Pete wrote:
> I have some benchmarkign code
>
> #define N 600 // Matrix rank
> #define ITERATIONS 2000
>
>
>
> int main( void )
> {
> // Set up the timer and start it ticking.
> Timer timer;
> timer.startTimer();
>
> // We multiply m1
I have some benchmarkign code
#define N 600 // Matrix rank
#define ITERATIONS 2000
int main( void )
{
// Set up the timer and start it ticking.
Timer timer;
timer.startTimer();
// We multiply m1 and m2, and put the result in m3.
int m1[N][N];
17 matches
Mail list logo
