The developer of Parallel Computing Toolkit presents examples of large-scale parallel calculations and discusses performance and reliability issues. Ongoing experiments with irreducibility proofs of polynomials with a total CPU time of several years were used to develop parallel search methods and tools for unattended computations.
For the newest resources, visit Wolfram Repositories and Archives »
