231 - Combinatorial structures for distributed computing models, 2018
|
Combinatorial structures for distributed computing modelsPetr Kuznetsov Feb. 16, 2018 |
Course Description
The main complication in the analysis of distributed systems is the immense diversity of distributed computing models, combined with the lack of mathematical tools to handle this complexity.
In this mini-course, we begin with a gentle introduction into the basics of distributed computing and then discuss how to characterize the computability power of a large class of models via properties of the corresponding simplicial complexes, combinatorial structures capturing representative sets of model executions.
Course Contents
Copyright 2012,
寄稿する作者による.
この作品は次のライセンスによっています：
Creative Commons License
引用/出所元.
KyotoU_OCW. (2018年07月12日). Combinatorial structures for distributed computing models. Retrieved 2021年03月03日, from 京都大学OCW Web site: http://ocw.kyoto-u.ac.jp/ja/opencourse/231.
