Upcoming presentations

By
I have quite a few presentations coming up. If you are interested in attending (I know I am) here is a list.

Low Latency in Java 8
JavaZone 2015 - Wednesday, September 9th 2015 at 12:00-13:00
Dublin Java User's Group - Monday, September 28, 2015 at 6:30 - 7:30 PM

How can new features in Java 8 be used to make writing Low Latency application easier? How do you tune garbage creation in the use of Lambdas?

Writing Low Latency applications means using the subset of a language which performs consistently.  Can Streams and Lambdas be used in this context?
What are some of the practical performance considerations?
When does it make sense to use parallelStream()?

For the talk in Dublin at AOL, there will be a short workshop on using Chronicle after the talk.


The Future of Unsafe and Chronicle.
JavaSIG - Possible date in September or October.
Chicago JUG - Thursday, September 24th 2015 at 6:30, Peak 6 offices.

 What will happen to Unsafe in Java 9?
What does the deprecation and removal of Unsafe mean for products like Chronicle?
What is new in Chronicle?
What is Chronicle doing next?

I will be in Chicago from Sept 21st to 24th so let me know if you would like to meet up for a coffee


Java Lambda Puzzlers
Coding Serbia Conference - October 9, 9:15 - 9:45.

 Pushing Java 8 Lambdas to their limits and beyond.

A year after deploying our first Java 8 application into production,
- what have we tried to do with lambdas,
- what works well and what doesn't,
- what are good patterns and
- what works but perhaps you should avoid.



Workshop on Low Latency logging and replay
JAX London - October 12th, 9:00 to 17:00
A workshop for beginners to advanced developers on how to write and read data efficiently in Java. The workshop will cover the following:

An advanced review of how the JVM really uses memory.

  • what are references.
  • what is compressed OOPS.
  • how are the fields in an object laid out.



Work with Hundreds of Hot Terabytes in JVMs
JavaOne 2015 - October 26 to 29th (Date unknown)

How can Java directly access Terabytes of data and provide real time updates from an SQL database?

I will be in San Francisco from October 21st to 29th, so if you would like to meet for a coffee, let me know
.

Comments

Post a Comment

Popular posts from this blog

Java is Very Fast, If You Don’t Create Many Objects

By
Image
  You still have to watch how many objects you create. This article looks at a benchmark passing events over TCP/IP at 4 billion events per minute using the net.openhft.chronicle.wire.channel package in Chronicle Wire and why we still avoid object allocations..  One of the key optimisations is creating almost no garbage. Allocation is a very cheap operation and collection of very short-lived objects is also very cheap. Does this really make a difference? What difference does one small object per event (44 bytes) make to the performance in a throughput test where GC pauses are amortised? While allocation is as efficient as possible, it doesn’t avoid the memory pressure on the L1/L2 caches of your CPUs and when many cores are busy, they are contending for memory in the shared L3 cache.  Results Benchmark on a Ryzen 5950X with Ubuntu 22.10. JVM Vendor, Version No objects Throughput, Average Latency* One object per event Throughput, Average Latency* Azul Zulu 1.8.0_322 60.6 M event/s, 528
Read more

System wide unique nanosecond timestamps

By
A Unique Identifier can be very useful for tracing. Those ids are even more useful when they contain a high-resolution timestamp.  Not only do they record the time of an event, but if unique can help trace events as they pass through the system. Such unique timestamps however can be expensive depending on how they are implemented.   This post explores a lightweight means of producing a unique, monotonically increasing system-wide nano-second resolution timestamp available in our open-source library. Uses for Unique Identifiers Unique identifiers can be useful to associate with a piece of information so that information can be referred to later unambiguously. This could be an event, a request, an order id, or a customer id. They can naturally be used as a primary key in a database or key/value store to retrieve that information later. One of the challenges of generating these identifiers is avoiding creating duplicates while not having an increasing cost.  You could record every identi
Read more

Comparing Approaches to Durability in Low Latency Messaging Queues

By
Image
  A significant feature of Chronicle Queue Enterprise is support for TCP replication across multiple servers to ensure the high availability of application infrastructure. I generally believe that replicating data to a secondary system is faster than syncing to disk, assuming the round trip network delay wasn’t high due to quality networks and co-located redundant servers. This is the first time I have benchmarked it with a realistic example. Little’s Law and Why Latency Matters In many cases, the assumption is that the latency won't be a problem as long as throughput is high enough. However, latency is often a key factor in why the throughput isn’t high enough. Little’s law states, “ the long-term average number  L  of customers in a  stationary  system is equal to the long-term average effective arrival rate  λ  multiplied by the average time  W  that a customer spends in the system”. In computer terminology, the level of concurrency or parallelism a system has to support must be
Read more