This repo is old and out of date. I suggest you use version 3.x from https://github.com/OpenHFT/Chronicle-Queue #Chronicle This library is an ultra low latency, high throughput, persisted, messaging and event driven in memory database. The typical latency is as low as 80 nano-seconds and supports throughputs of 5-20 million messages/record updates per second. This library also supports distributed
Since the first version of Java, day-by-day many developers have been trying to achieve at least as good of performance as in C/C++. JVM vendors are doing their best by implementing some new JIT algorithms, but there is still a lot to do, especially in how we use Java. For example, there is a lot to win in objects<->file serialization - notably in writing/reading objects that can readily fit in th
96 97 1D 59 33 7B 7E 25 03 BC C2 51 AC F6 1D 0F 62 DA 4D 88 09 DD 3B 58 6F D5 84 1F 99 20 3B B1 7B 40 B4 77 CB 8A E3 05 23 2A 72 7D 5E 19 1C ED 7D 8C 35 F4 7D F3 F5 E4 8E 50 4D 9A 35 C4 95 DE C1 82 42 0B 84 31 E9 AD FE 07 CF B5 EB AE E2 62 0D 3A C1 80 07 1E B5 77 3D 3C DE 95 1B 51 99 A5 BB C6 ByteBuffers and Off-Heap Memory 96 97 1D 59 33 7B 7E 25 03 BC C2 51 AC F6 1D 0F 62 DA 4D 88 09 DD 3B 58 6F
LArray can create arrays with more than 2G(2^31) entries. 2^31 -1 (2G) is the limitation of the default Java/Scala array size, because these arrays use 32-bit signed integer (int) as indexes. LArray uses long type indexes of 64-bit signed integers to resolve this limitation. For example, the entire human genome data (3GB) can be stored in LArray. LArray can be released immediately from the memory.
Do you ever wish you could turn a Java object into a stream of bytes as fast as it can be done in a native language like C++? If you use standard Java Serialization you could be disappointed with the performance. Java Serialization was designed for a very different purpose than serialising objects as quickly and compactly as possible. Why do we need fast and compact serialisation? Many of our s
Byte Buffers and Non-Heap Memory Originally published: 2010-04-04 Last updated: 2017-01-22 Most Java programs spend their time working with objects on the JVM heap, using getter and setter methods to retrieve or change the data in those objects. A few programs, however, need to do something different. Perhaps they're exchanging data with a program written in C. Or they need to manage large chunks
In my last post I detailed the implications of the access patterns your code takes to main memory. Since then I've had a lot of questions about what can be done in Java to enable more predictable memory layout. There are patterns that can be applied using array backed structures which I will discuss in another post. This post will explore how to simulate a feature sorely missing in Java - arra
Slab: guaranteed heap alignment on the JVM An experimental library with sequential guarantees about how it lays out the memory of objects allocated via it. Thu 03 January 2013 The Problem Over time CPU clockrates have gotten considerably faster, but Memory Speed has failed to catch up. In order to make good usage of modern CPUs it's important to consider data structure alignment in memory, in orde
Apache Direct Memory is an open source implementation of off-heap caching that uses ByteBuffer.allocateDirect to store objects in off-heap memory without degrading JVM performance. It provides a multi-layered caching solution and can be used to build a standalone cache server similar to Memcached. Current use cases include integrating with Ehcache for multi-level caching and implementing an off-he
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く