# Computational Model

![](/files/-McaektC1vRICzPinXPk)

### Random-Access Machine (RAM)

* Unit cost for 
  * any instruction on O(log(n))-bit words
  * Read/write a single memory location from an infinite memory
* The cost measure: time complexity

variant: Parallel RAM (PRAM) model

### Fork-Join Model

* is the main model of parallel execution in the OpenMP framework
* In addition to RAM instructions, you can also use `in parallel` and `parallel for` instructions.

```cpp
mergesort(A, lo, hi):
  if lo < hi:
    mid = ⌊lo + (hi - lo) / 2⌋
    fork mergesort(A, lo, mid) // process (potentially) in parallel with main task
      mergesort(A, mid, hi)    // main task handles second recursion
    join
      merge(A, lo, mid, hi)
```

### Work-Span Model

* For all computations, draw a DAG
  * A->B means that B can be performed only when A has been finished
* **Work**: the total number of operations
* **Span** (depth): the longest length of chain

![](/files/-Mcal8btyD57on7epp8q)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wiki.hanzheteng.com/algorithm/cs/computational-model.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.