The Secret Sauce of Tough Problem Solving on Computers/HPC/Clusters

The Secret Sauce of Tough Problem Solving on Computers/HPC/Clusters

Everyone asks me the secret to our success. Here are some pointers.

(1) Never use a functional language. Always use a plan old OOPs Language.

(2) Don't go for Fast Execution/C++ initially. Go for easy bug free programming in Java/Python to develop Fastest Algorithms/Solutions.

(3) Never use recursion. After 20-30 depth they konk.

(4) Watch out for memory bottlenecks. N^2 memory for 10^6 size is 10^12 Oooops!

(5) To solve really hard problems you have to run systems 24x7. Prevent CPU Over heating and abrupt cluster shutdowns

(6) Avoid GPGPU's, always use CPU's/Xeon Phi and do Dynamic Programming

(7) Always try to come up with Deterministic Algorithms, after/failing which you try Fast Approximation Algorithms.

(8) Maximize Reduction of Complexity/Dimensions/Search-Space by including all constraints you can into the solution.

(9) Always attack the toughest version of the problem. Once solved you can easily reduce/adapt it to other forms and solve dozens of easier problems.

(10) R'ber to celebrate little successes. Nobody around you will understand a crap about what you are trying to achieve or appreciate your efforts. Over years and decades you will eventually celebrate huge successes.

要查看或添加评论,请登录

Rakesh Kumar的更多文章

  • Artificial General Intelligence (AGI)

    Artificial General Intelligence (AGI)

    Everyone drops cliche like AI, ML, DeepLearning all the time. I love IBM but Watson is a Apache UIMA based Natural…

  • Deep Thought - Permutations & Combinations

    Deep Thought - Permutations & Combinations

    So we know human capability is to solve problems of O(2^70). But suppose in the ultimate quest for knowledge we…

  • Indian's opinion group(s) and convenience

    Indian's opinion group(s) and convenience

    I traveled quite a bit. And one of the things I noticed about India was that one of the most prominent citizen effort…

  • Hindu Science

    Hindu Science

    In 1990s we scanned all relevant scientific literature from history from various regions of the world. Automatski…

  • Genomics

    Genomics

    Our O(N) solutions to NP-Complete Problem(s) have Revolutionized Computational Genomics, Bioinformatics and…

  • Houses in India- Glorified cave dwellings.

    Houses in India- Glorified cave dwellings.

    There is a huge debate in India. People who live in houses call people living in apartments as poor people living in…

    3 条评论
  • Linear Programming

    Linear Programming

    Automatski solved NP-Complete Linear + Integer + Mixed Integer Programming in O(n) with billions and trillions of…

  • Non-Deterministic Calculus

    Non-Deterministic Calculus

    The worlds first Non-Deterministic Calculus by Automatski, has brought Automatski closer to understanding how God…

  • Multi-Scale Simulations

    Multi-Scale Simulations

    The number of Atoms in a Real World System like the Human Body is about 10^27 which is approx. 2^70 which is the…

  • Reclusive existence

    Reclusive existence

    Everyone gets it wrong. they think we have an extremely reclusive existence.

社区洞察

其他会员也浏览了