This is a bit off-topic (though it is about N-queens) but I've long wanted to
ask people if an idea I had once is a well-known one. It once occurred to me
that solutions to N-rooks can be viewed as linear transformations that
correspond to permutations of a vector. So, then I wondered to what so
t...@gmail.com]
> Sent: sábado, 12 de marzo de 2016 23:33
> To: Jos Koot
> Cc: Racket Users
> Subject: Re: [racket-users] Sequential vs. Parallel 13-Queens program
>
> The code is a little difficult for me to read. It doesn't seem to collect
> *all* solutions for a giv
0 gc time: 0
> (expt 10 4) : cpu time: 0 real time: 0 gc time: 0
> (expt 10 5) : cpu time: 0 real time: 0 gc time: 0
> (expt 10 6) : cpu time: 63 real time: 47 gc time: 32
> (expt 10 7) : cpu time: 203 real time: 140 gc time: 15
> (expt 10 8) : cpu time: 3183 real time: 2543 gc time:
symmetrical problems.
Best wishes, Jos
-Original Message-
From: Brian Adkins [mailto:lojicdot...@gmail.com]
Sent: sábado, 12 de marzo de 2016 23:33
To: Jos Koot
Cc: Racket Users
Subject: Re: [racket-users] Sequential vs. Parallel 13-Queens program
The code is a little difficult for me
symmetrical problems.
Best wishes, Jos
-Original Message-
From: Brian Adkins [mailto:lojicdot...@gmail.com]
Sent: sábado, 12 de marzo de 2016 23:33
To: Jos Koot
Cc: Racket Users
Subject: Re: [racket-users] Sequential vs. Parallel 13-Queens program
The code is a little difficult for me to
0 gc time: 0
> (expt 10 4) : cpu time: 0 real time: 0 gc time: 0
> (expt 10 5) : cpu time: 0 real time: 0 gc time: 0
> (expt 10 6) : cpu time: 63 real time: 47 gc time: 32
> (expt 10 7) : cpu time: 203 real time: 140 gc time: 15
> (expt 10 8) : cpu time: 3183 real time: 2543 gc time: 1123
&
[mailto:racket-users@googlegroups.com]
On Behalf Of Brian Adkins
Sent: sábado, 12 de marzo de 2016 1:42
To: Racket Users
Subject: [racket-users] Sequential vs. Parallel 13-Queens program
I coded up a sequential and parallel version of N-Queens, then did a ton of
benchmark runs of 13-Queens to compar
I coded up a sequential and parallel version of N-Queens, then did a ton of
benchmark runs of 13-Queens to compare the time. For each configuration
(sequential or parallel w/ M workers), I ran the programs 6 times, threw out
the high two & low two and averaged the middle two numbers.
The spread
8 matches
Mail list logo
