PROJECT TITLE :

Lock-Free and Wait-Free Slot Scheduling Algorithms

ABSTRACT:

During this paper, we have a tendency to contemplate the design space of parallel non-blocking slot scheduling algorithms. Slot schedulers divide time into discrete quanta known as slots, and schedule resources at the granularity of slots. They're usually utilized in high throughput I/O systems, knowledge centers, video servers, and network drivers. We propose a family of parallel slot scheduling problems of accelerating complexity, and then propose parallel lock-free and wait-free algorithms to resolve them. In specific, we have a tendency to propose problems that may reserve, along with free a collection of contiguous slots in an exceedingly non-blocking manner. We show that in an exceedingly system with 64 threads, it is potential to urge speedups of 10X by using lock-free algorithms as compared to a baseline implementation that uses locks. We additionally propose wait-free algorithms, whose mean performance is roughly the identical as the version with locks. However, they suffer from considerably lower jitter and guarantee a high degree of fairness among threads.