Reagents : combinators for writing concurrent libraries.

Add to your list(s) Download to your calendar using vCal

• Theo Laurent
• Tuesday 28 July 2015, 13:15-13:45
• Computer Laboratory, William Gates Building, Room FW11.

If you have a question about this talk, please contact Heidi Howard.

Efficient communication is crucial for the scalability of concurrent algorithms. But writing efficient concurrent libraries is difficult. Moreover, such libraries are generally not composable, limiting their expressive power. Reagents are a set of combinators intended for elegantly writing concurrency algorithms and data structures. They provide basic blocks for fine-grained communication through synchronisation and/or state mutation together with combinators to compose these basic blocks into sophisticated programs. Aside being easier to write, such programs scale quite as well as their handwritten counterparts and are composable, improving modularity and expressiveness. We believe reagents are an interesting candidate for writing OCaml concurrent libraries and thus provided an OCaml implementation for reagents.

This talk is part of the Computer Laboratory NetOS Group Talklets series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory NetOS Group Talklets
• Computer Laboratory, William Gates Building, Room FW11
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.