Explore >> Select a destination
|
You are here 
|
sookocheff.com | ||
| | | | |
bloom-lang.net
|
|
| | | | | CALM: consistency as logical monotonicity One of the key innovations underlying Bloom is the ability to formally guarantee consistency properties of distributed programs. This reasoning is based o | |
| | | | |
databeta.wordpress.com
|
|
| | | | | For folks who care about what's possible in distributed computing: Peter Alvaro and I wrote an introduction to the CALM Theorem and subsequent work that is now up on arXiv. The CALM Theorem formally characterizes the class of programs that can achieve distributed consistency without the use of coordination. I spent a good fraction of... | |
| | | | |
blog.acolyer.org
|
|
| | | | | ||
| | | | |
tokio.rs
|
|
| | | Tokio is a runtime for writing reliable asynchronous applications with Rust. It provides async I/O, networking, scheduling, timers, and more. | ||
