You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Oct 9, 2024. It is now read-only.
Efficient alloc/free of queue and list elements is in our to-do list. We will proceed in two steps:
Implement a scalable allocator for internal allocations
Extend the API to offload memory management to Izem.
Currently lists and queues require potentially double alloc/free operations: one set by the user who might allocate the data and pass the pointer to Izem; and another set for the internal list/queue element.
will ensure fast internal memory management (goals: lock-free and cache-friendly). 2) Will avoid double alloc/free operations, and the single alloc/free set of operations will be expected to be well implemented.
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
the mercury folks learned this the hard way: malloc on every operation increases latency. We talked about this for a while in the group meeting.
The text was updated successfully, but these errors were encountered: