You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@ignite.apache.org by "Roman Puchkovskiy (Jira)" <ji...@apache.org> on 2022/08/16 10:30:00 UTC
[jira] [Updated] (IGNITE-17334) Basic volatile RAFT log storage
[ https://issues.apache.org/jira/browse/IGNITE-17334?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Roman Puchkovskiy updated IGNITE-17334:
---------------------------------------
Description:
The storage should contain the following components:
# An elastic (but with possible hard-limit) in-memory storage for log entries. On this iteration it will be on-heap data structure (for instance, a skip list). Later, we'll build something better (like an off-heap implementation, maybe using pagemem).
# An algorithm for determining when the in-memory storage cannot accept new entries. On this iteration, the only supported algorithm will be simply limiting the store by the number of stored entries. Later we will add something smarter, like the total size of the stored entries and adaptive algorithms.
# Logic for spilling out to disk. This should not be implemented on this iteration, but it will be implemented later, in IGNITE-17336
was:
The storage should contain the following components:
# An elastic (but with possible hard-limit) in-memory storage for log entries. On this iteration it will be on-heap data structure (for instance, a skip list). Later, we'll build something better (like an off-heap implementation, maybe using pagemem).
# An algorithm for determining when the in-memory storage cannot accept new entries. On this iteration, the only supported algorithm will be simply limiting the store by the number of stored entries. Later we will add something smarter, like the total size of the stored entries and adaptive algorithms.
# A policy for what to do if the store cannot accept a record. On this iteration, it will be just to reject the entry. Later, we can add support for spilling out to disk.
> Basic volatile RAFT log storage
> -------------------------------
>
> Key: IGNITE-17334
> URL: https://issues.apache.org/jira/browse/IGNITE-17334
> Project: Ignite
> Issue Type: Improvement
> Components: persistence
> Reporter: Roman Puchkovskiy
> Assignee: Roman Puchkovskiy
> Priority: Major
> Labels: ignite-3
> Fix For: 3.0.0-alpha6
>
> Time Spent: 2h
> Remaining Estimate: 0h
>
> The storage should contain the following components:
> # An elastic (but with possible hard-limit) in-memory storage for log entries. On this iteration it will be on-heap data structure (for instance, a skip list). Later, we'll build something better (like an off-heap implementation, maybe using pagemem).
> # An algorithm for determining when the in-memory storage cannot accept new entries. On this iteration, the only supported algorithm will be simply limiting the store by the number of stored entries. Later we will add something smarter, like the total size of the stored entries and adaptive algorithms.
> # Logic for spilling out to disk. This should not be implemented on this iteration, but it will be implemented later, in IGNITE-17336
--
This message was sent by Atlassian Jira
(v8.20.10#820010)