5 ms·

Earliest Eligible Virtual Deadline First: Flexible Resource Allocation (1995)

• m463 3y ago
  is this postscript? also this seems to be (1996)
  • n4r9 3y ago
    In Firefox on Windows, if I right-click and click "Save As...", it offers to save as a PDF.
• tux3 3y ago
  For context, EEVDF is the new scheduler in Linux 6.6: https://kernelnewbies.org/Linux_6.6#New_task_scheduler:_EEVDF https://kernelnewbies.org/Linux_6.6#New_task_scheduler:_EEVD...
• samsquire 3y ago
  Just a warning I am a beginner on scheduling. Just reading about events in this paper, I assume that's IO events? I have a multithreaded ringbuffer and I've been trying to work out how to reduce latency with Linux scheduling and thread core affinity. It doesn't seem to improve latency I installed Ubuntu's realtime kernel and played around with SCHED_DEADLINE but I don't think real time kernel is what's needed to schedule long running threads continuously ? What I want is the latency between scheduling of two given threads to be as close together as possible. Is this possible ? For reference LMAX Disruptor in Java can send a message between thread with average latency of 52 nanoseconds. My naive toy C implementation is 80-130 nanoseconds from glances.