how much does a sugar glass window cost now that sugar and other things are
being used for bio fuels?
On Wed, Jun 25, 2008 at 12:20 AM, Mark Hahn <[EMAIL PROTECTED]> wrote:
>
> More specifically for HPC, linux seems designed for the desktop, and
>>> for small memory machines.
>>>
>>
> the only j
Vincent Diepeveen wrote:
intel c++ obviously is close to visual studio. Within 0.5% to 1.5% range
(depending upon flags
I believe Microsoft licensed the intel optimization technology, so the
similarity is hardly surprising.
and hidden flags that you managed to get from someone). Intel C++ is
On Wed, 25 Jun 2008, Vincent Diepeveen wrote:
one player's position -- or one of those distant pieces placed early in
the game -- causes their entire effort to "unravel" and turn into a
disaster. That's almost twice the number of plys in an entire chess
game, and is still only the first third o
Mark Hahn wrote:
> > Static routing is the best approach if your pattern is
> known. In other
>
> sure, but how often is the pattern actually known? I mean in general:
> aren't most clusters used for multiple, shifting purposes?
>
There will be many arguments in each side. There are enough c
On Jun 25, 2008, at 4:15 AM, Robert G. Brown wrote:
On Tue, 24 Jun 2008, Vincent Diepeveen wrote:
Go has a bigger branching factor than chess, as it starts with an
empty board of 19x19, versus chess a loaded board of 8x8.
The first few moves in go decide the outcome of the game already,
On Tue, 24 Jun 2008, Peter St. John wrote:
On a finite board, the game eventually becomes local; in fact "contact
plays" are common after about the first dozen moves, but they are
inescapable later. But the possibilities are horrible, the numbers are huge,
for tree-searching. The new thing is mo
On Tue, 24 Jun 2008, Vincent Diepeveen wrote:
Go has a bigger branching factor than chess, as it starts with an empty board
of 19x19, versus chess a loaded board of 8x8.
The first few moves in go decide the outcome of the game already, as the rest
is just a 'playout' of the first few moves. S
On Tue, 24 Jun 2008, Peter St. John wrote:
MS isn't famous for new development (as scientists see "new development")
but a few hundred engineers would not be such a big investment for them.
I'd be more interested in a comparison of that many whatever, quad core
xeon? running linux vs MS's runni
http://lwn.net/Articles/287339/
# The 2.6.25.9 stable kernel update is available.
# This one contains a relatively small set of patches;
# one of them might be security-related, and another
# addresses a serious virtual memory performance regression
The problem is explained in a previous version
That go is "vastly" more complex is a matter of degree; but there are bounds
on e.g. the number of possible games, and if chess is googleplex times 2, go
is up-arrow-googleplex. That's not my official mathematician estimage :-)
but yeah go is horribly complex, and more horribly than chess, but stil
On Tue, 24 Jun 2008, Peter St. John wrote:
Programming a computer to play Go (an Asian strategy boardgame) has been
difficult; some people say it's proof that Go is better or harder than
chess, since computers can beat masters at chess but struggle at Go. (I
think that statistically a game of go
Mark Hahn wrote:
so the question is, if you had a magic wand, what would you change in
the kernel (or perhaps libc or other support libs, etc)? most of the
things I can think of are not clear-cut. I'd like to be able to give
better info from perf counters to our users (but I don't think Lin
- "Huw Lynes" <[EMAIL PROTECTED]> wrote:
Syt mae Huw, /* exhausts first year Welsh */
> In our first year of production we are unlikely to have jobs keeping
> the cluster full much of the time. So I'm considering writing something to
> watch the job queue and power down nodes that are not n
- "Håkon Bugge" <[EMAIL PROTECTED]> wrote:
> IMHO, the MPI should virtualize these resources
> and relieve the end-user/application programmer
> from the burden.
IMHO the resource manager (Torque, SGE, LSF, etc) should
be setting up cpusets for the jobs based on what the
scheduler has told
- "Greg Lindahl" <[EMAIL PROTECTED]> wrote:
> > > Your MPI (and OpenMP) should do this for you.
> >
> > Although not always correctly, it may assume that it can
> > allocate from core 0 onwards leading to odd performance
> > issues if you happen to get two 4 CPU jobs running on the
> > same
More specifically for HPC, linux seems designed for the desktop, and
for small memory machines.
the only justice I can see in that is that there hasn't been all that
much effort to get bigpages widely/easily used. in particular, I don't
see that scheduler or general memory-management issues
What would interest me is if you describe how you get your information
on how instructions pair and what weak sequences are at the processor.
Like for example the by now old AMD K8 used to have the feature that
if you do an
integer multiplication, that the first and last cycle of the latency,
On Tue, Jun 24, 2008 at 10:21:01PM +0200, Vincent Diepeveen wrote:
> The PG compiler and especially pathscale compiler are doing rather
> well at benchmarks,
> especially that last, yet at our codes they're real ugly. Maybe they
> do better for floating point
> oriented workloads, which doesn'
linux
#14 at 1st appearance on top500 at : http://www.top500.org/list/2007/11/100
windows
#23 at 2nd appearance on top500: http://www.top500.org/list/2008/06/100
compare the performance numbers...you didn't see anything.
Galen Arnold
system engineer
NCSA
- Original Message -
From: "Pete
Vincent,
FIDE Master is very cool :-) I'm only 2000; shodan in go.
The first move out of book may indeed be the move that matters most (in
chess) but in Go, the connection between the end of fuseki and the technique
of exploiting yose seems very remote. Since I can beat all computers at Go,
I assu
Hi Peter,
At the risk of being off topic. A few points.
First of all we must distinguish computers and humans. For chess and
go this is completely the same:
the choices that get made at start of the game decide its outcome
with a high degree of certainty;
In computer chess i launched the s
Not long ago GCP and me did do a comparision,
and visual c++ kicked all of them by a rather large margin.
intel c++ obviously is close to visual studio. Within 0.5% to 1.5%
range (depending upon flags
and hidden flags that you managed to get from someone). Intel C++ is
free for researchers su
Vincent,
I found your reply very agreable except this:
"The first few moves in go decide the outcome of the game already, as the
rest is just a 'playout' of the first few moves. So what matters most is the
first few moves in the game."
Many professional games are decided in the endgame. When I l
Go has a bigger branching factor than chess, as it starts with an
empty board of 19x19, versus chess a loaded board of 8x8.
The first few moves in go decide the outcome of the game already, as
the rest is just a 'playout' of the first few moves. So what matters
most is the first few moves in
Vincent Diepeveen wrote:
> That said, it has improved a lot, now all we need is a better compiler
> for linux. GCC is for my chessprogram generating an
> executable that gets 22% slower positions per second than visual c++
> 2005 is.
>
> Thanks,
> Vincent
>
GCC is a free compiler, and Visual C
The latter shows "Windows Server 2008/Red Hat Linux"; I assume both were
used with that hardware, seperately, and it made no difference at all? So
the application overwhelmed the impact of the OS, to as much precision as
say 89.59? Wow.
Thanks,
Peter
On 6/24/08, Galen Arnold <[EMAIL PROTECTED]> wr
On Tue, Jun 24, 2008 at 05:46:17PM +0100, Tim Cutts wrote:
>
> On 23 Jun 2008, at 7:41 pm, Kyle Spaans wrote:
>
> >On Fri, Jun 20, 2008 at 03:33:19PM -0400, Lawrence Stewart wrote:
> >>More specifically for HPC, linux seems designed for the desktop, and
> >>for small memory machines.
> >
> >That'
MS isn't famous for new development (as scientists see "new development")
but a few hundred engineers would not be such a big investment for them.
I'd be more interested in a comparison of that many whatever, quad core
xeon? running linux vs MS's running Cluster Server 2008. CP/M could be a
pretty
Jim,
Well I was thinking of low-budget, Hong Kong in the 70's type special
effects, and just meant that things don't really fly around as much as we
see in the movies. That said, I'm a huge fan of stuff flying around, so
thanks :-)
Peter
On 6/24/08, Jim Lux <[EMAIL PROTECTED]> wrote:
>
> At 09:25
> In fact, the world's largest software company currently employs
hundreds of
> engineers whose sole job it is to conceptualize and develop new
products for
> the burgeoning HPC market
Oh, really? I hardly see any truth in this sentence.
Perhaps "the world's largest"?
___
If memory serves, TSC sync is an option when configuring a custom
2.4x series kernel.perhaps this is so for 2.6x as well?
hv
Mikhail Kuzminsky wrote:
As I remember, TSCs in SMP/x86 are synchronized by Linux kernels at the
boot process.
But the only message (about TSC) I see after Linux boot
At 09:25 AM 6/24/2008, Jim Lux wrote:
At 02:31 PM 6/20/2008, Peter St. John wrote:
The destructive radius of Little Boy was about total, up to about
one mile radius, and tapered down to light at about two miles. So
being in a lead-lined steel container at 2000 meters might be OK for Indiana.
On Tue, Jun 24, 2008 at 05:04:20PM +0100, Ashley Pittman wrote:
>
> On Mon, 2008-06-23 at 14:41 -0400, Kyle Spaans wrote:
> > On Fri, Jun 20, 2008 at 03:33:19PM -0400, Lawrence Stewart wrote:
> > > More specifically for HPC, linux seems designed for the desktop, and
> > > for small memory machin
On 23 Jun 2008, at 7:41 pm, Kyle Spaans wrote:
On Fri, Jun 20, 2008 at 03:33:19PM -0400, Lawrence Stewart wrote:
More specifically for HPC, linux seems designed for the desktop, and
for small memory machines.
That's funny, because I've heard people get scared that it was the
complete oppos
As I remember, TSCs in SMP/x86 are synchronized by Linux kernels at
the boot process.
But the only message (about TSC) I see after Linux boot in dmesg (or
/var/log/messages) in SuSE 10.3 w/2.6.22 default kernel on quad-core
dual socket Opteron serever is
"Marking TSC unstable due to TSCs uns
At 02:31 PM 6/20/2008, Peter St. John wrote:
The destructive radius of Little Boy was about total, up to about
one mile radius, and tapered down to light at about two miles. So
being in a lead-lined steel container at 2000 meters might be OK for Indiana.
In all action movies, blasts throw peop
Programming a computer to play Go (an Asian strategy boardgame) has been
difficult; some people say it's proof that Go is better or harder than
chess, since computers can beat masters at chess but struggle at Go. (I
think that statistically a game of go is about equivalent to a two-game
match of ch
On Mon, 2008-06-23 at 14:41 -0400, Kyle Spaans wrote:
> On Fri, Jun 20, 2008 at 03:33:19PM -0400, Lawrence Stewart wrote:
> > More specifically for HPC, linux seems designed for the desktop, and
> > for small memory machines.
>
> That's funny, because I've heard people get scared that it was th
http://www.eweek.com/c/a/Infrastructure/Fastestever-Windows-HPC-Cluster/?kc=EWKNLENT062008STR1
Fastest-ever Windows HPC Cluster
By Chris Preimesberger
2008-06-18
Running a beta of Windows HPC Server 2008, supercomputer hits 68.5 teraflops.
Microsoft fastest-yet homegrown supercomputer, runnin
On Fri, Jun 20, 2008 at 03:33:19PM -0400, Lawrence Stewart wrote:
> More specifically for HPC, linux seems designed for the desktop, and
> for small memory machines.
That's funny, because I've heard people get scared that it was the complete
opposite. That Linux was driven by Big Iron, and that
Eoin McHugh wrote:
I don't run a daemon but I use the Torque prologue and epilogue to set
the max and min power states using the /proc cpufreq interface before
and after jobs. This results in a power saving when a queued jobs are
waiting for additional nodes to free up. It's a measurably large
On Mon, 2008-06-23 at 14:59 -0700, Greg Lindahl wrote:
> > 3) Is there some reason to use things like
> > mpirun -np N /usr/bin/numactl my_application ?
>
> Your MPI (and OpenMP) should do this for you.
Of course how you want the binding to be done can depend on the
communication pattern of
On Fri, 2008-06-20 at 12:30 -0400, Mark Kosmowski wrote:
> What kind of security is recommended for the owner of a small personal
> cluster?
Most likely perimeter security. I very much doubt there is information
on the compute nodes which isn't on the head node and the compute nodes
won't have a
At 07:56 24.06.2008, Chris Samuel wrote:
> Your MPI (and OpenMP) should do this for you.
Although not always correctly, it may assume that it can
allocate from core 0 onwards leading to odd performance
issues if you happen to get two 4 CPU jobs running on the
same node..
If the MPI is doing th
Hi Mark,
At 17:25 23.06.2008, Mark Hahn wrote:
5) In which cases is it reasonable to switch on
"Node memory interleaving" (in BIOS) for the
application which uses more memory than is presented on the node ?
I leave it off, since numactl --interleave lets
you get the same effect from user-sp
On Monday 23 June 2008 17:44, Bogdan Costescu wrote:
> On Wed, 18 Jun 2008, Prentice Bisbal wrote:
> > The biggest hindrance to doing "real" work with GPUs is the lack of
> > dual-precision capabilities.
>
> I think that the biggest hindrance is a unified API or language for
> all these accelerator
46 matches
Mail list logo
