garbage-collection
epoll-server
garbage-collection | epoll-server | |
---|---|---|
1 | 3 | |
- | 8 | |
- | - | |
- | 3.3 | |
- | 7 months ago | |
C | ||
- | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
garbage-collection
-
Notes on my incomplete JIT compiler
I adapted the garbage collector at Writing a Simple Garbage Collector in C (maplant.com) to add extremely primitive simple register scanning. I am thinking I can expose an ABI to the runtime to call the GC. https://github.com/samsquire/garbage-collection
epoll-server
-
Notes on my incomplete JIT compiler
I also have some epoll server code at https://github.com/samsquire/epoll-server
-
Ask HN: Resources for Building a Webserver in C?
You might find my epollserver interesting.
It multiplexes multiple clients (sockets) over a thread, so you can write an event loop in each thread and serve far more requests per thread than you could if it was one thread per client or one process per client.
https://github.com/samsquire/epoll-server
-
Epoll is fundamentally broken (2017)
I wrote an epoll echo server that multiplexes multiple network connections over threads (multiple users per thread)
https://github.com/samsquire/epoll-server
I also have a 1:M:N (1 scheduler thread, M kernel threads and N lightweight green threads) multithreaded userspace scheduler which multiplexes lightweight threads onto kernel threads and can preempt hot loops with minimal overhead. I rely on the fact that you can change the looping variable from another thread if you use a structure. Preemptive interruption is very useful for the illusion of multitasking. That's why I call it a userspace scheduler.
I think the epoll-server which is kind of similar to what libuv does and the userspace scheduler could be combined into an application server.
I also wrote a multithreaded actor implementation in Java. Threads can communicate with each other between 60 million - 100 million messages a second. The epoll-server uses a multiconsumer multiproducer lockless RingBuffer.
https://GitHub.com/samsquire/multicersion-concurrency-contro...
I think the core fundamentals of building a performant application server should be done once and reused for each application.
I want to also split the threading used by recv and send of a socket so that we have a 1:R/S per socket:N scheduling (1 scheduler thread, 1 Recv thread, 1 send thread per socket). So you can send while you receive and receive while you send. True multiplexing!
What are some alternatives?
compiler - an incomplete toy barebones compiler backend for amd64 x86_64 in Python and an incomplete JIT compiler written in C
libreactor - Extendable event driven high performance C-abstractions
picohttpparser - tiny HTTP parser written in C (used in HTTP::Parser::XS et al.)
preemptible-thread - How to preempt threads in user space
assembler - amd64 assembler
Mongoose - Embedded Web Server
loti - Lord of the io_uring: io_uring tutorial, examples and reference
websrv - A simple C web service and REST framework
libuv - Cross-platform asynchronous I/O
src - Read-only git conversion of OpenBSD's official CVS src repository. Pull requests not accepted - send diffs to the tech@ mailing list.
nanos - A kernel designed to run one and only one application in a virtualized environment