Add more information to projects and add some more minor things I found
This commit is contained in:
@@ -1,2 +1,5 @@
|
||||
# Camera tracker
|
||||
Software that can "lock" onto something on the screen and try to track it
|
||||
|
||||
## Approaches
|
||||
As we have a human in the loop that selects the target, I would try to use a stencil based approach for finding the selected area again in following images
|
||||
|
||||
@@ -3,3 +3,7 @@ A different type of lock for async contexts
|
||||
|
||||
## References
|
||||
- [Paper proposing the idea](https://arxiv.org/abs/2511.09194)
|
||||
|
||||
## Considerations
|
||||
The runtime/continuation interface they are using in the paper is not possible in Rust (AFAIK), so we need some other way to get it to work.
|
||||
Likely this can only be done by integrating with the runtime directly.
|
||||
|
||||
@@ -1,3 +1,6 @@
|
||||
# Crystalline memory reclaimation
|
||||
A lock-free/wait-free (depending on configuration used) memory reclaimation scheme for concurrent data structures.
|
||||
I want to implement this as a Rust crate, with a safe interface that should basically make it impossible to misuse (as little unsafe as possible in public API)
|
||||
|
||||
## References
|
||||
- [Paper](https://dl.acm.org/doi/full/10.1145/3658851)
|
||||
|
||||
@@ -1 +1,10 @@
|
||||
# EPaxos implementation
|
||||
|
||||
## References
|
||||
- [Original Paper](https://www.cs.cmu.edu/~dga/papers/epaxos-sosp2013.pdf)
|
||||
- [Original Paper ACM](https://dl.acm.org/doi/10.1145/2517349.2517350)
|
||||
- [EPaxos Revisited](https://www.usenix.org/conference/nsdi21/presentation/tollman)
|
||||
- [EPaxos GitHub](https://github.com/efficient/epaxos)
|
||||
- [Alibaba Cloud - EPaxos Explaination](https://www.alibabacloud.com/blog/basic-concepts-and-intuitive-understanding-of-epaxos_597229)
|
||||
- [Simplifying EPaxos Paper](https://arxiv.org/abs/2511.02743v1)
|
||||
- [EPaxos Revisited - Reading Group](https://charap.co/reading-group-epaxos-revisited/)
|
||||
|
||||
@@ -1,2 +1,6 @@
|
||||
# Implement jiffy Queue
|
||||
A lock free queue
|
||||
# Implement Jiffy Queue
|
||||
A Lock-Free/Wait-Free queue
|
||||
|
||||
## References
|
||||
- [ACM Paper](https://dl.acm.org/doi/abs/10.1145/3491003.3491004)
|
||||
- [Arxiv Paper](https://arxiv.org/abs/2010.14189)
|
||||
|
||||
5
projects/jiffy-skip-list.md
Normal file
5
projects/jiffy-skip-list.md
Normal file
@@ -0,0 +1,5 @@
|
||||
# Implement Jiffy Skip List
|
||||
A Lock-Free skip list
|
||||
|
||||
## References
|
||||
- [ACM Paper](https://dl.acm.org/doi/abs/10.1145/3503221.3508437)
|
||||
5
projects/wrl-queue.md
Normal file
5
projects/wrl-queue.md
Normal file
@@ -0,0 +1,5 @@
|
||||
# WRL Queue
|
||||
A Lock-Free Queue for embedded real-time systems
|
||||
|
||||
## References
|
||||
- [IEEE Paper](https://ieeexplore.ieee.org/abstract/document/10074706)
|
||||
Reference in New Issue
Block a user