What do you think the tweet by Elon Musk means? Do you think that he is considering using the super computer as a means to mine Dogecoin? Or do you think he is offering up the supercomputer in exchange for Dogecoin? Either way, his interest in Dogecoin is clearly here to stay.
Can we classify a supercomputer in more than one group? For example, Flynn’s classification, classification according to topology, classification according to memory access.
For the Summit supercomputer, I have found no sources on these topics, except for Flynn’s classification. How can I classify it in other categories, for example by topology?
I am running following program on mathematica 9.0
installed on Supercomputer through Mobaxterm (which is terminal interface) using this:
nohup math -run -noprompt < samplecode.m.
Which gives the result on terminal after saying
As I know that one has to specify the number of cores available for computation to user in order to utilized those cores, and then submitted jobs goes into a queue and gets evaluated after queue is clear.
Since I haven’t specified the number of cores in above piece of code, So it must be using single core.
Now can anyone tell me in simple terms,
a) How to specify number of available cores and run above sample code for parallel computation so that it is utilizing all the available cores to the user.
Note: Starting half of this answer might be related to my ques.
I have a Mathematica .nb file currently executing some commands in my personal computer for several days now. The commands are not written for parallel computing and they don’t seem to work with
Parallelize. The time it takes to compute them has been too long for my progress and schedule, so I’m considering running the .nb via private supercomputer service provider. My question is, does running the commands that don’t support
Parallelize will nevertheless compute significantly faster, or am I being naive believing that rewriting the code suitable for supercomputing won’t be necessary?
I read on the Wiki that a Yottaflops supercomputer can handle about 1 trillion trillion calculations per second. That's 1 billion times faster than a Petaflops supercomputer (!). After my calculation to build a Yottaflops supercomputer we need to $ 30 $ Trillion dollars (!!!). My question is what a Yottaflops supercomputer can do compared to the currently fastest supercomputers. , Can we perform the (probabilistic) primality test MUCH faster?
I want to know the real limit of our computing power that we have now
What is the limit of the cities that I can achieve with optimal sol.
I believe that the first computer is 10 ^ 19 process in the second
can I calculate the time that it will take by looking at compounds of the directed graph?
and say the time by this force 10 ^ 19
how can I edit real graphic of the problem and delete cities from it
Thank you for providing a response to the Computer Science Stack Exchange!
- Please be sure answer the question, Provide details and share your research!
But avoid …
- Ask for help, clarification or answers to other answers.
- Make statements based on opinions; secure them with references or personal experiences.
Use MathJax to format equations. Mathjax reference.
For more information, see our tips for writing great answers.