Corpus ID: 209460738

Flat combined Red Black Trees

@article{SainzPalacios2019FlatCR,
  title={Flat combined Red Black Trees},
  author={Sergio Sainz-Palacios},
  journal={ArXiv},
  year={2019},
  volume={abs/1912.11417}
}
  • Sergio Sainz-Palacios
  • Published in ArXiv 2019
  • Computer Science
  • Flat combining is a concurrency threaded technique whereby one thread performs all the operations in batch by scanning a queue of operations to-be-done and performing them together. Flat combining makes sense as long as k operations each taking O(n) separately can be batched together and done in less than O(k*n). Red black tree is a balanced binary search tree with permanent balancing warranties. Operations in red black tree are hard to batch together: for example inserting nodes in two… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES

    The art of multiprocessor programming

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL