Monoidify! Monoids as a Design Principle for Efficient MapReduce Algorithms — mentioned by noelwelsh

Mon, 25 Jun 2018 14:43:58 GMT

You might see the value of knowing some abstract algebra in "Monoidify! Monoids as a Design Principle for Efficient MapReduce Algorithms" https://arxiv.org/abs/1304.7544 In general, if you can model a distributed or concurrent system in terms of a monoid (or better, a commutative monoid) you're onto a winner.

Paper and discussion history. A mention is not an endorsement.

Monoidify! Monoids as a Design Principle for Efficient MapReduce Algorithms — mentioned by noelwelsh

Sun, 17 Jul 2016 09:27:45 GMT

Yeah, the application section is pretty poor. The number one large-scale practical application of semigroups (and, more often, their extension the monoid) is in parallel and concurrent systems. Associativity says that order of operations doesn't matter, which in turn implies you can distribute computations however you like across multiple machines and still get the correct result. This is the big idea leveraged in systems like Summingbird and other big data frameworks (e.g. https://arxiv.org/abs/1304.7544) and in CRDTs.

Paper and discussion history. A mention is not an endorsement.

Monoidify! Monoids as a Design Principle for Efficient MapReduce Algorithms · HackerPapers discussions

Monoidify! Monoids as a Design Principle for Efficient MapReduce Algorithms — mentioned by noelwelsh

Monoidify! Monoids as a Design Principle for Efficient MapReduce Algorithms — mentioned by noelwelsh