NFS and HPC Survey Results

Details

Written by Number Six

Published: 22 July 2016

Hits: 3938

Recently, Bill Broadley of UC Davis presented the Beowulf mailing list with a survey on NFS and HPC. Bill has collected the results and given permission to post a summary on Cluster Monkey. Many thanks for all the 27 respondents (who are seasoned HPC administrators) . Note that not all respondents answered all questions..

1) cluster OS:

• 72% Redhat/CentOS/Scientific linux or derivative
• 24% Debian/Ubuntu or derivative
• 4% SUSE or derivative
Read more: NFS and HPC Survey Results Add new comment

You (Still) Can't Always Get What You Want

Details

Written by Douglas Eadline

Published: 25 February 2016

Hits: 2016

You can't always get what you want. But that doesn't stop me from asking. Besides, Buddha's got my back. Here's my HPC wish list.

[Note: A recent article by Al Geist, How To Kill A Supercomputer: Dirty Power, Cosmic Rays, and Bad Solder reminds us that statistics at scale represents a big challenge for HPC. The following updated article was originally published in Linux Magazine in May 2006 and offers some further thoughts on this important issue. ]

Twenty five years ago I wrote a short article in a now defunct parallel computing magazine (Parallelogram) entitled "How Will You Program 1000 Processors?" Back then, it was a good question that had no easy answer. Today, it's still a good question with no easy answer, except now it seems a bit more urgent as we step into the "multi-core" era. Indeed, when I originally wrote the article, using 1,000 processors was a far off, but real possibility. Today, 1,000 processors are a reality for many practitioners of high-performance computing (HPC). And as dual-cores (and now 18-core processors) hit the server room, effectively doubling processor counts, many more people will be joining the 1,000P club very soon.

So let's get adventurous and ask, "How will you program 10,000 processors?" As I realized twenty five years ago, such a question may never really have a complete answer. In the history of computers, no one has ever answered such a question to my liking — even when considering ten processors. Of course, there are plenty of methods and ideas like threads, messages, barrier synchronization, and so on, but when I have to think more about the computer than about my problem, something is wrong.

The Ignorance is Bliss Approach To Parallel Computing

Details

Written by Douglas Eadline

Published: 09 June 2016

Hits: 2395

from the random thoughts department

[Note: The following updated article was originally published in Linux Magazine in June 2006 and offers some further thoughts on the concept of dynamic execution.]

In a previous article, I talked about programming large numbers of cluster nodes. By large, I mean somewhere around 10,000. To recap quickly, I pointed out that dependence on large numbers of things increase the chance that one of them will fail. I then proposed that it would be cheaper to develop software that can live with failure than try to engineer hardware redundancy. Finally, I concluded that adapting to failure requires dynamic software. As opposed to statically scheduled programs, dynamic software adapts at run-time. The ultimate goal is to make cluster programming easier: focus more on the problem and less on the minutiae of message passing. (Not that there is anything wrong with message passing or MPI. At some level messages (memory) needs to be transferred between cluster nodes.)