[Beowulf] A start in Parallel Programming?
Many of your questions may have already been answered in earlier discussions or in the FAQ. The search results page will indicate current discussions as well as past list serves, articles, and papers.
Joe Landman landman at scalableinformatics.comWed Mar 14 11:07:27 PDT 2007
- Previous message: [Beowulf] A start in Parallel Programming?
- Next message: [Beowulf] A start in Parallel Programming?
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Richard Walsh wrote: > Joe Landman wrote: >> Peter St. John wrote: >>> >>> So maybe the ceiling will be (Deliverable FLOPS times Recoverable >>> Bytes)/ml >> I rather like the Strossian MIPS per kilogram ... :) > I am partial to the Bremermann limit: > > Hans Bremermann's conjecture that “no data processing system, whether > artificial > or living, can process more than 2 × 10^47 bits per second per gram of > its mass.” Heh... > > How many Moore doublings until we reach it ... Robert ... ?? ML is going at an order of magnitude every ~6 years. -- Joseph Landman, Ph.D Founder and CEO Scalable Informatics LLC, email: landman at scalableinformatics.com web : http://www.scalableinformatics.com phone: +1 734 786 8423 fax : +1 734 786 8452 or +1 866 888 3112 cell : +1 734 612 4615
- Previous message: [Beowulf] A start in Parallel Programming?
- Next message: [Beowulf] A start in Parallel Programming?
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list
