Greg,
Greg Lindahl wrote:
Compare the latency numbers in HPC Challenge to the 2-node ping-pong
latency reported by vendors. For some vendors, it's the same number.
For others, the latency from using all the nodes is much, much higher.
The ring test in HPC is rather poorly implemented: 3 iterat
Gilad,
Gilad Shainer wrote:
-Original Message-
People doing their homework are still buying more 2G than 10G
today, because of better price/performance for their codes
(and thin cables).
People doing their homework test their applications and decide
That's what I have always said.
> I would call that "the application". seriously, a benchmark which
> does what actual apps do, but is somehow not the app? is there some
> reason to believe that there is not some sort of basis set of primitives
> which actual app performance can be factored into?
Mark, the fundamental problem
On Tue, Mar 20, 2007 at 02:07:43PM -0700, Jim Lux wrote:
> Date: Tue, 20 Mar 2007 14:07:43 -0700
> To: "David Mathog" <[EMAIL PROTECTED]>, beowulf@beowulf.org
> From: Jim Lux <[EMAIL PROTECTED]>
> Subject: Re: [Beowulf] Re: Emergency Power Off
> Cc:
>
> At 01:25 PM 3/20/2007, David Mathog wrote:
Ah, I see where you're coming from. Yes indeed, computers were used to
verify that x^n + y^n = z^n has no nontrivial solutions (with n > 2) for
certain values of n: n into the millions :-) There were classical proofs for
n = 3 and n = 4 that can be covered in an undergraduate lecture, and results
On Thu, 22 Mar 2007, Peter St. John wrote:
First, a picky but pertinent point: Fermat's Last Theorem wasn't done by
machine. It was Andrew Wiles, at Princeton. The story is that he broke up a
There are computer efforts along these lines, though:
http://www.cs.rug.nl/~wim/fermat/wilesEnglish
Thanks! Jumping to conclusions is the only exercise I get.
Peter
On 3/22/07, Dan Christensen <[EMAIL PROTECTED]> wrote:
"Peter St. John" <[EMAIL PROTECTED]> writes:
> I wish I know more about the SAGE (machine) that hosts the SAGE
(software)
> that was used for this,
From what I understand,
> It made a lot of us very uncomfortable, but we left behind the day when
> everyone could read everything for himself, sometime between Guttenburg
and
> Leibnitz's Monadology.
We've never had it to leave behind. Each of us attempts to disspell out
own personal darkness, to peer out from Plato'
On Thu, 22 Mar 2007, Peter St. John wrote:
That result brought Robert's concern out in the open: do we believe a proof
that is too long for us to personally verify ourselves? With Wiles and the
group classification thing and some other such work, we've realized that
machines aren't required. It
First, a picky but pertinent point: Fermat's Last Theorem wasn't done by
machine. It was Andrew Wiles, at Princeton. The story is that he broke up a
major work into Least Publishable Units, and set to work on FLT in secret,
submitting a LPU once in awhile so his colleagues woudn't be suspicious.
T
On Thu, 22 Mar 2007, Peter St. John wrote:
Well to me that's the point. My brain is too small for 500Kx500K matrices
over a ring of 22 degree polynomials, too. So we throw a 16-node computer at
it and crush it under the hobnailed jack-boots of Higher Mathematics.
I wish I know more about the SAG
Well to me that's the point. My brain is too small for 500Kx500K matrices
over a ring of 22 degree polynomials, too. So we throw a 16-node computer at
it and crush it under the hobnailed jack-boots of Higher Mathematics.
I wish I know more about the SAGE (machine) that hosts the SAGE (software)
th
Greg Lindahl wrote:
On Wed, Mar 21, 2007 at 06:41:07AM -0400, Scott Atchley wrote:
I have not benchmarked any applications that need more than 250 MB/s
during computation,
There is a large class of computations which alternate non-overlapped
compute and communicate cycles. The average over t
On Wed, 21 Mar 2007, Peter St. John wrote:
Times have sure changed; with Wiles and Fermat's Last Theorm in newspapers
for over a year, then "A Beautiful Mind" from Hollywood; it's almost not
surprising that the solution of a difficult math problem is mentioned at
CNN.com.
The Exceptional Lie Gr
14 matches
Mail list logo
