From 3888c8e98c5e746f499a6445d5ee26c107261df0 Mon Sep 17 00:00:00 2001 From: SergeyMenshykh <68852919+SergeyMenshykh@users.noreply.github.com> Date: Thu, 7 Nov 2024 13:54:18 +0000 Subject: [PATCH] Comment out broken link (#9604) ### Motivation and Context The `markdown-link-check` tool fails - [32656031279](https://github.com/microsoft/semantic-kernel/actions/runs/11723502773/job/32656031279?pr=9595) trying to access the broken link - [web.stanford.edu](https://web.stanford.edu/~rezab/classes/cme323/S15/notes/lec8.pdf) This PR comments out the link until the working one is found. --- docs/decisions/0054-processes.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/decisions/0054-processes.md b/docs/decisions/0054-processes.md index 040046acb84f..d9ae06be4028 100644 --- a/docs/decisions/0054-processes.md +++ b/docs/decisions/0054-processes.md @@ -315,4 +315,4 @@ The following packages will be created for Processes: In validation of the proposed solution, two runtimes were created, one for the local/server scenario and one for the distributed actor scenario using Orleans. Both of these implementation were based on the [Pregel Algorithm](https://kowshik.github.io/JPregel/pregel_paper.pdf) for large-scale graph processing. This algorithm is well tested and well suited for single machine scenarios as well as distributed systems. More information on how the Pregel algorithm works can be found in the following links. - [Pregel - The Morning Paper](https://blog.acolyer.org/2015/05/26/pregel-a-system-for-large-scale-graph-processing/) -- [Pregel - Distributed Algorithms and Optimization](https://web.stanford.edu/~rezab/classes/cme323/S15/notes/lec8.pdf) +