Cori is NERSC's newest supercomputer (NERSC-8), a Cray XC40. It is named for American biochemist Gerty Cori, the first American woman to win a Nobel Prize and the first woman to be so honored with the prize in Physiology or Medicine. Cori is a unique supercomputer, comprised of 1,630 Intel Xeon "Haswell" processor nodes, 9,300 Intel Xeon Phi "Knight's Landing" nodes, and a 1.5 PB Cray Data Warp Burst Buffer.
Before Cori can be released to users, it must be delivered, integrated with Phase I, and accepted. This page is the resource for the Cori upgrade and installation schedule. For the current status of Cori, please see the Cori Updates and Status page. Impact on NERSC Users While NERSC is making every effort to minimize inconvenience to users, there are some unavoidable downtimes of Cori Phase I for the upgrade of its operating system and integration with Cori Phase II. Cori Phase II Preparation… Read More »
Before you can use or access Cori, you must have an active NERSC account and valid password. If you don't, see Accounts and Allocations. Cori should be used in the following way: Log in to a "login" node, bring your files and data over, compile your code, and create a batch submission script. Then submit that script so that your application runs on the Cori "compute" nodes. Pay attention to the various file systems available and the choices in programming environments, and make sure you use… Read More »
Learn how to submit interactive and batch jobs using native SLURM on Cori compute nodes with example batch scripts. and how to monitor your job in the queue and job exit status. Also find information on OpenMP and MPI runtime settings as well as general application tuning options. Read More »
We expect many applications will need to make code modifications in order to run efficiently on Cori's Knights Landing manycore architecture. To run well on Cori, your application will need to have good thread scalability, take advantage of vectorization opportunities, and manage multiple hierarchies of memory effectively. Read More »