Gil Tene talks about new speculative and optimistic locking mechanisms enabled by HTM (Hardware Transactional Memory), HTM's benefits and limitations, speculating on its future impact on concurrency.
Maciej Maciejewski discusses persistent memory, storage devices, and DRAM, accessing persistent memory with ACPI 6.0 extensions, existing support in the Linux kernel and the NVM library.
Gil Tene explores the underlying mechanics that power HTM on current platforms, focusing on things developers need to understand when contemplating the use of HTM in new and existing code.
Howard Chu discusses the Lightning Memory-Mapped Database (LMDB) design and architecture, and its impact on other projects such as OpenLDAP.
John Blum and Luke Shannon introduce Pivotal GemFire along with the open source offering, Apache Geode. They demonstrate how to effectively build highly scalable applications with GemFire/Apache.
Joseph Blomstedt presents ongoing work to build a new set of high performance data structures for Erlang, including both single process data structures as well as various concurrent data structures.
Yehuda Katz introduces Rust: the ownership system, automatic memory management which guarantees at compile time that a program will never segfault, making Rust code resilient against memory leaks.
Gil Tene introduces org.ObjectLayout, a new Java package designed specifically to enable JVMs to optimize memory layout for arrays and objects matching the performance of arrays of structs in C.
John Davies shows a Spring work-flow consuming 7.4kB XML messages, binding them to 25kB Java but storing them in just 450 bytes each, 10 million derivative contracts in-memory on a laptop.
Jeff Kelley discusses Objective-C basics – properties, categories – and more advanced features – linking, ARC, creating classes at runtime, memory management and tagged pointers.
Benoît Chesneau discusses creating, scaling and reusing HTTP connections, summarizing techniques used to reduce memory usage in Erlang and ways to handle massive client connections efficiently.
SriSatish Ambati shares tips for in-memory algorithms, discussing I/O, S3 resets, muxers, primitive byte arrays, non-blocking structures, and fork/join queues.