github-starred/ollama
2
0
Fork 0
mirror of https://github.com/ollama/ollama.git synced 2026-05-07 00:22:43 -05:00
Code Issues 14.5k Packages Projects Releases 120 Wiki Activity

[GH-ISSUE #13913] ollama的会话窗口渲染效果太差了 #9102

New Issue
Open
opened 2026-04-12 21:57:23 -05:00 by GiteaMirror · 0 comments
GiteaMirror commented 2026-04-12 21:57:23 -05:00
Owner
Copy Link

Originally created by @loowace on GitHub (Jan 26, 2026).
Original GitHub issue: https://github.com/ollama/ollama/issues/13913

10.5. SOFTWARE PIPELINING

755

latex
main() {
  $E' = \{e | e \in E, \delta_e = 0\};$
  $T_0 = \max\left( \max_j \left| \frac{\sum_{n,i} RT_n(i,j)}{r_j} \right|, \max_{c: \text{acyclin } G} \left| \frac{\sum_{e \in c} d_e}{\delta_e} \right| \right);$
  for $(T = T_0, T_0 + 1, \ldots \text{ or until all SCC's in } G \text{ are scheduled})$ {
    $RT = \text{an empty reservation table with } T \text{ rows};$
    $E^* = \text{AllPairsLongestPath}(G,T);$
    for (each SCC $C$ in $G$ in prioritized topological order) {
      for (all $n$ in $C$ )
        $s_0(n) = \max_{e=p \to n} \text{in } E^*, p \text{ scheduled } (S(p) + d_e);$
        $\text{first} = \text{some } n \text{ such that } s_0(n) \text{ is a minimum};$
        $s_0 = s_0(\text{first});$
        for $(s = s_0; s < s_0 + T; s = s + 1)$
          if (SccScheduled(RT, T, C, first, s)) break;
        if (C cannot be scheduled in RT) break;
    }
  }
}

secScheduled(RT, T, c, first, s) {
  $RT' = RT;$
  if (not NodeScheduled(RT', T, first, s)) return false;
  for (each remaining $n$ in $c$ in prioritized topological order of edges in $E'$ ) {
    $s_l = \max_{e=n' \to n} \text{in } E^*, n' \text{ in } c, n' \text{ scheduled } S(n') + d_e - (\delta_e \times T);$
    $s_u = \min_{e=n \to n'} \text{in } E^*, n' \text{ in } c, n' \text{ scheduled } S(n') - d_e + (\delta_e \times T);$
    for $(s = s_l; \leq \min(s_u, s_l + T - 1); s = s + 1)$
      if NodeScheduled(RT', T, n, s) break;
    }
    if (n cannot be scheduled in RT') return false;
  }
  $RT = RT';$
  return true;
}

Figure 10.29: A software-pipelining algorithm for cyclic dependence graphs

这是模型输出的代码，我在ollama看到的效果是这样的

Image

我在yank note看到的效果是这样的，我每次都要换窗口预览，好麻烦，能改进下ollama的markdown的渲染效果吗

Image
Originally created by @loowace on GitHub (Jan 26, 2026). Original GitHub issue: https://github.com/ollama/ollama/issues/13913 ``` 10.5. SOFTWARE PIPELINING 755 latex main() { $E' = \{e | e \in E, \delta_e = 0\};$ $T_0 = \max\left( \max_j \left| \frac{\sum_{n,i} RT_n(i,j)}{r_j} \right|, \max_{c: \text{acyclin } G} \left| \frac{\sum_{e \in c} d_e}{\delta_e} \right| \right);$ for $(T = T_0, T_0 + 1, \ldots \text{ or until all SCC's in } G \text{ are scheduled})$ { $RT = \text{an empty reservation table with } T \text{ rows};$ $E^* = \text{AllPairsLongestPath}(G,T);$ for (each SCC $C$ in $G$ in prioritized topological order) { for (all $n$ in $C$ ) $s_0(n) = \max_{e=p \to n} \text{in } E^*, p \text{ scheduled } (S(p) + d_e);$ $\text{first} = \text{some } n \text{ such that } s_0(n) \text{ is a minimum};$ $s_0 = s_0(\text{first});$ for $(s = s_0; s < s_0 + T; s = s + 1)$ if (SccScheduled(RT, T, C, first, s)) break; if (C cannot be scheduled in RT) break; } } } secScheduled(RT, T, c, first, s) { $RT' = RT;$ if (not NodeScheduled(RT', T, first, s)) return false; for (each remaining $n$ in $c$ in prioritized topological order of edges in $E'$ ) { $s_l = \max_{e=n' \to n} \text{in } E^*, n' \text{ in } c, n' \text{ scheduled } S(n') + d_e - (\delta_e \times T);$ $s_u = \min_{e=n \to n'} \text{in } E^*, n' \text{ in } c, n' \text{ scheduled } S(n') - d_e + (\delta_e \times T);$ for $(s = s_l; \leq \min(s_u, s_l + T - 1); s = s + 1)$ if NodeScheduled(RT', T, n, s) break; } if (n cannot be scheduled in RT') return false; } $RT = RT';$ return true; } Figure 10.29: A software-pipelining algorithm for cyclic dependence graphs ``` 这是模型输出的代码，我在ollama看到的效果是这样的 <img width="984" height="845" alt="Image" src="https://github.com/user-attachments/assets/0ea1d142-338d-4f4f-8d15-13274a86df66" /> 我在yank note看到的效果是这样的，我每次都要换窗口预览，好麻烦，能改进下ollama的markdown的渲染效果吗 <img width="1714" height="1067" alt="Image" src="https://github.com/user-attachments/assets/401b66bc-9ce1-49c5-8bf8-bd59e10bf347" />
GiteaMirror added the feature request label 2026-04-12 21:57:23 -05:00
Sign in to join this conversation.
No Branch/Tag Specified
Branches Tags
Labels
Clear labels
amd
api
app
bug
build
cli
cloud
compatibility
context-length
create
docker
documentation
embeddings
feature request
feedback wanted
good first issue
gpt-oss
gpu
harmony
help wanted
image
install
intel
js
launch
linux
macos
memory
mlx
model
needs more info
networking
nvidia
ollama.com
performance
pull-request
Mirrored from GitHub Pull Request
 python
question
registry
rendering
thinking
tools
top
vulkan
windows
wsl
No Label feature request
Milestone
No items
No Milestone
Projects
Clear projects
No project
Assignees
Clear assignees
GiteaMirror ninjasurge
No Assignees
1 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: github-starred/ollama#9102
Delete Branch "%!s()"

Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?