Team training in Expert Core Java

By

Overview

We have new course material for the second half of this year. Core Java Training

We provide tailored team training for advanced and expert Java Developers at a low cost per head.  Select from the topics below.  We can provide training on site for your organization, world wide.

For more details, see the Core Java Training web page.

Expert Java Development (2-3 days)

  • Working with primitives to save memory and reduce garbage.
  • How to use double and long safely instead of BigDecimal.
  • How to use collections like Map, Set, ConcurrentMap, NavigableMap, List, Queue, BlockingQueue and Deque effectively.
  • How to use thread pools and fork join.
  • Asynchronous processing and exception handling.
  • How to use Lambdas in Java 8 for lazy evaluation and parallel coding.
  • How to use Plain IO and NIO, files, TCP and UDP.
  • volatile, read/write memory barriers and when you need them.
  • default methods in Java 8.
  • Using enum for singletons and utility classes.
  • Java 8 JSR-310 Date Time library.
  • Using off heap memory with ByteBuffer.
  • Command line options for monitoring the JIT

Java Memory Management and Optimisation (1 day)

  • Measuring memory usage
  • Finding memory leaks.
  • Optimising GC pauses
  • Speeding up code between GC pauses
  • GC free coding
  • Low GC replacements for common development patterns
  • Command line options for monitoring and tuning memory use.

Java Multi-thread and Concurrency (1 day)

  • When to multi-thread and when not to.
  • Sharing immutable data between threads
  • Using multiple data within a thread.
  • Reactor, Streaming processes and Event Driving processing.
  • Performance tuning multi-threaded applications
  • Busy waiting and CPU binding for reducing latency.

Java Performance profiling and Tuning (1 day)

  • How to measure latency in a meaningful way.
  • How to measure your application for performance end to end.
  • Micro-benchmarks; pit-falls and getting meaningful results.
  • How to model your performance profile.
  • How to find the biggest opportunities to improve to target your changes (and keep them to a minimum)
  • Examples of performance changes and alternatives

How the JVM really works and low level coding (1 day)

  • What is byte code and how is it used.
  • How can you write byte code.
  • How is lambdas implemented in Java 8.
  • How to use off heap memory.
  • When to use on heap vs off heap memory.
  • How CPUs really work and how to take advantage of this in Java.

Event driven processing (1-2 days)

  • Asynchronous processing and persistence
  • Actor patterns and lower latency reactive patterns
  • Event driven parsers.
  • Event routing and filtering.
  • Aggregating engines.
  • Simple complex event processing engines.
  • Performance monitoring and measures for event driven systems.

Expert low latency event driven systems (1-2 days)

  • How to build deterministic systems with repeatable outcomes and performance.
  • How to get detailed information about production systems without impacting performance.
  • How to use distributed systems for high throughput.
  • How to scale you system vertically as well as horizontally.
  • How to get low latency in a distributed/redundant system.

Practical use of Chronicle (1-2 days)

  • Introduction to using Chronicle Queue and Map.
  • How to write millions of messages per second without garbage.
  • How to update millions of key-values per second without garbage.
  • How to achieve micro-second latency and persistence.
  • How to distribute across many machines efficiently.
  • How to distribute high volumes across a WAN in a controlled manner.
  • Chronicle internals, lessons learnt, techniques used.

Comments

  1. Unknown17 August 2015 at 05:09

    This comment has been removed by a blog administrator.

    ReplyDelete

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