Add memkind hmat 'I' example templates by PatKamin · Pull Request #11 · pmemhackathon/hackathon.web

PatKamin · 2022-09-30T11:04:10Z

Not verified on a test server.
#12 needs to be merged first.

This change is

lukaszstolarczuk

Reviewed 1 of 2 files at r1, all commit messages.
Reviewable status: 1 of 2 files reviewed, 7 unresolved discussions (waiting on @lukaszstolarczuk and @PatKamin)

templates/examples/I/body.tmpl line 5 at r1 (raw file):

<p class="intro">
Different memory types can have different performance characteristics. They
can be distinguished by values of their latency, capacity or bandwidth.

, or

templates/examples/I/body.tmpl line 28 at r1 (raw file):

allocations between a low latency memory and a high capacity memory is achieved
by utlising two kinds (you can think of them as an additional parameter to
malloc()): MEMKIND_LOWEST_LATENCY_LOCAL and MEMKIND_HIGHEST_CAPACITY.

you can use <code>malloc()</code> syntax for code highlighting and maybe some <b> for the consts

templates/examples/I/body.tmpl line 41 at r1 (raw file):


<p>
This program allocates hashmap, keys and data using different memory

, and

templates/examples/I/body.tmpl line 71 at r1 (raw file):

memory type available is DRAM, too. One may see these memkind kinds as a hint
for the allocator as to whether allocated data should have fast access, huge
storage or, not used in this example, fast bandwidth. You can also play with

something's wrong with the comma after or

templates/examples/I/body.tmpl line 75 at r1 (raw file):

<a href="https://pmem.io/memkind/manpages/memkind.3/#kind">here</a>.
<p>
In the <a href="I">next example</a>, you can experiment with some Java programs

did you mean "J" and actually I'm not sure if we need this link - it's totally different example...

templates/examples/I/description.tmpl line 8 at r1 (raw file):

This example shows allocation tiering with the usage of memkind.
This is achieved by utilising memory performance characteristics provided by
kernel and the libhwloc library. Allocation tiering is based on lowest latency

the lowest

templates/examples/I/description.tmpl line 9 at r1 (raw file):

This is achieved by utilising memory performance characteristics provided by
kernel and the libhwloc library. Allocation tiering is based on lowest latency
and highest capacity tiers.

the highest

PatKamin

Reviewable status: 0 of 2 files reviewed, 6 unresolved discussions (waiting on @lukaszstolarczuk)

templates/examples/I/body.tmpl line 5 at r1 (raw file):