15%
24.09.2015
this common pattern, usually called “file-per-process.”
Figure 3: Parallel I/O via separate files (file-per-process).
Each TP performs all I/O to its own
15%
15.06.2016
many packets or remote procedure calls (RPCs) are created and sent. For example, if you want to transmit 1MB of data using 32KB chunks, the data is sent in quite a few chunks and a correspondingly large
15%
22.08.2017
or a subset of nodes (user controllable). To achieve this, I use F2PY to build the module.
F2PY
The tool named f2py
, Fortran-to-Python, creates a connection between the two languages that calls Fortran 77
15%
25.01.2018
that gathers the CPU stats every minute or few minutes (call this the “long-term” CPU stats metric) that are then written to a specific log. Then, in the prologue and epilogue scripts for the job scheduler, you
15%
09.01.2019
techniques are evolving to accommodate Petascale systems while getting ready for Exascale. Meanwhile, a key programming technique called MPI+X refers to using MPI in an application for data communication
15%
03.04.2019
approach can be used with OpenMP.
Second, put timer functions throughout the code that get the wall clock time when called. At the minimum, you can use one at the beginning of the code and one at the end
15%
12.05.2021
(SAS) drive collects drive log data and general metrics in something called the SCSI log pages (plural because each page separates the collected data into its respective category). The easiest way
15%
23.03.2022
filesystems, each file or directory has its own metadata. (Remember that in *nix operating systems, directories are just files.) The metadata is generally a fixed-size data structure called an inode. Each inode
15%
19.06.2023
:: n, i, j, ierr
!------------------------------------------------------------------
n = 100
allocate(a(n,n), stat=ierr)
allocate(b(n,n), stat=ierr)
call random_seed()
do j =1,n
do i=1,n
call random_number(x)
a(i,j) = 10.0d0*x
15%
11.09.2023
? It seems logical to create different pools of storage that each have very different characteristics.
This approach is called “tiering” storage, in which a small amount of really fast storage with a large
