From 3a6bd84d3c60f8fb49b107529bb5161384977cc5 Mon Sep 17 00:00:00 2001
From: aejjeh <aejjeh@illinois.edu>
Date: Mon, 27 Jan 2020 19:35:05 -0600
Subject: [PATCH] Update hpvm-c.md
---
hpvm/docs/hpvm-c.md | 8 ++++----
1 file changed, 4 insertions(+), 4 deletions(-)
diff --git a/hpvm/docs/hpvm-c.md b/hpvm/docs/hpvm-c.md
index 8b021d98dc..76cfde58c0 100644
--- a/hpvm/docs/hpvm-c.md
+++ b/hpvm/docs/hpvm-c.md
@@ -110,13 +110,13 @@ Local synchronization barrier across dynamic instances of current leaf node.
# Porting a Program from C to HPVM-C
-The following represents the required steps to port a regular C program into an HPVM program with HPVM-C. These steps are described at a high level; for more detail, please see the benchmarks provided in [benchmarks](/hpvm/test/benchmarks).
+The following represents the required steps to port a regular C program into an HPVM program with HPVM-C. These steps are described at a high level; for more detail, please see [hpvm-cava](/hpvm/test/benchmarks/hpvm-cava) provided in [benchmarks](/hpvm/test/benchmarks).
* Separate the computation that will become a kernel into its own (leaf node) function and add the attributes and target hint.
* Create a level 1 wrapper node function that will describe the thread-level parallelism (for the GPU). The node will:
- * Use the ```createNode\[ND]()``` method to create a kernel node and specify how many threads will execute it.
+ * Use the ```createNode[ND]()``` method to create a kernel node and specify how many threads will execute it.
* Bind its arguments to the kernel arguments.
* If desired, create a level 2 wrapper node function which will describe the threadblock-level parallalism (for the GPU). This node will:
- * Use the ```createNode\[ND]()``` method to create a level 1 wrapper node and specify how many threadblocks will ecexute it.
+ * Use the ```createNode[ND]()``` method to create a level 1 wrapper node and specify how many threadblocks will execute it.
* Bind its arguments to its child node's arguments.
* A root node function that creates all the top-level wrapper nodes, binds their arguments, and connects their edges.
* Each root node represents a DFG.
@@ -127,5 +127,5 @@ The following represents the required steps to port a regular C program into an
* Add all the memory that is required by the kernel into the memory tracker.
* Launch the DFG by calling the ```launch()``` method on the root node function, and passing the corresponding argument struct.
* Wait for the DFG to complete execution.
- * Read out any generated memory using the ```request_mem()``` method
+ * Read out any generated memory using the ```request_mem()``` method.
* Remove all the tracked memory from the memory tracker.
--
GitLab