Title: Long Running Actions (LRA) for MicroProfile in Quarkus
Short Description: Join us as we explain the transaction concept saga pattern in detail and demonstrate how you can use it in Quarkus with narayana-lra extension (**Note that we're giving away a free copy of the book)
Long Description: Narayana-lra extension provides an implementation of the saga pattern in Quarkus based on the MicroProfile Long Running Actions (LRA) specification. The saga pattern provides a different transaction concept that is particularly suitable for long-running business transactions. Typical consensus protocols (like 2PC used in JTA) need to hold locks on resources in order to provide atomic outcomes. With sagas, we let every resource commit its part right when called, but we require that it also defines a compensating action. In case of any of the original resource action failure, we can just call the compensations in reverser order. Compensations represent a semantical undo of the original actions since the actions are often not idempotent. Sagas thus provide different transactional guarantees to the typical ACID. In distributed systems, where communication failures are imminent, sagas provide a great alternative to the blocking nature of ACID by providing an eventual consistency guarantee (if no new sagas are started in the system, the system will eventually become consistent). In this talk, we explain the saga pattern in detail and demonstrate how you can use it in Quarkus with narayana-lra extension.
insectengine
commented
5 months ago
Title: Long Running Actions (LRA) for MicroProfile in Quarkus
Short Description: Join us as we explain the transaction concept saga pattern in detail and demonstrate how you can use it in Quarkus with narayana-lra extension (**Note that we're giving away a free copy of the book)
Long Description: Narayana-lra extension provides an implementation of the saga pattern in Quarkus based on the MicroProfile Long Running Actions (LRA) specification. The saga pattern provides a different transaction concept that is particularly suitable for long-running business transactions. Typical consensus protocols (like 2PC used in JTA) need to hold locks on resources in order to provide atomic outcomes. With sagas, we let every resource commit its part right when called, but we require that it also defines a compensating action. In case of any of the original resource action failure, we can just call the compensations in reverser order. Compensations represent a semantical undo of the original actions since the actions are often not idempotent. Sagas thus provide different transactional guarantees to the typical ACID. In distributed systems, where communication failures are imminent, sagas provide a great alternative to the blocking nature of ACID by providing an eventual consistency guarantee (if no new sagas are started in the system, the system will eventually become consistent). In this talk, we explain the saga pattern in detail and demonstrate how you can use it in Quarkus with narayana-lra extension.
Guest: Martin Štefanko Twitter: @xstefank