Lock-Free and Wait-Free Slot Scheduling Algorithms

In this paper, we consider the design space of parallel non-blocking slot scheduling algorithms. Slot schedulers divide time into discrete quanta called slots, and schedule resources at the granularity of slots. They are typically used in high throughput I/O systems, data centers, video servers, and network drivers. We propose a family of parallel slot scheduling problems of increasing complexity, and then propose parallel lock-free and wait-free algorithms to solve them. In specific, we propose problems that can reserve, as well as free a set of contiguous slots in a non-blocking manner. We show that in a system with 64 threads, it is possible to get 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 same as the version with locks. However, they suffer from significantly lower jitter and ensure a high degree of fairness among threads.

[1]  Liana L. Fong,et al.  An Infrastructure for Efficient Parallel Job Execution in Terascale Computing Environments , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[2]  Maurice Herlihy,et al.  The Art of Multiprocessor Programming, Revised Reprint , 2012 .

[3]  D. M. Hutton,et al.  The Art of Multiprocessor Programming , 2008 .

[4]  John K. Ousterhout,et al.  Scheduling Techniques for Concurrent Systems , 1982, ICDCS.

[5]  Gregory R. Ganger,et al.  Argon: Performance Insulation for Shared Storage Servers , 2007, FAST.

[6]  Robert Tappan Morris,et al.  An Analysis of Linux Scalability to Many Cores , 2010, OSDI.

[7]  Orran Krieger,et al.  Slot Scheduling: General-purpose Multiprocessor Scheduling for Heterogeneous Workloads Slot Scheduling: General-purpose Multiprocessor Scheduling for Heterogeneous Workloads Slot Scheduling: General-purpose Multiprocessor Scheduling for Heterogeneous Workloads Chapter 4 Experimental Evaluation 32 , 2005 .

[8]  Kai Shen,et al.  FIOS: a fair, efficient flash I/O scheduler , 2012, FAST.

[9]  Mounir Hamdi,et al.  Distributed parallel scheduling algorithms for high-speed virtual output queuing switches , 2009, 2009 IEEE Symposium on Computers and Communications.

[10]  Chow-Sing Lin,et al.  Efficient Algorithms for Slot-Scheduling and Cycle-Scheduling of Video Streams on Clustered Video Servers , 2004, Multimedia Tools and Applications.

[11]  Sarita V. Adve,et al.  Shared Memory Consistency Models: A Tutorial , 1996, Computer.

[12]  John K. Ousterhout.  Scheduling Techniques for Concurrebt Systems. , 1982, ICDCS 1982.

[13]  Keir Fraser,et al.  A Practical Multi-word Compare-and-Swap Operation , 2002, DISC.

[14]  Sartaj Sahni,et al.  Parallel Scheduling Algorithms , 1983, Oper. Res..

[15]  Rainer Gerhards,et al.  Peelsched: a Simple and Parallel Scheduling Algorithm for Static Taskgraphs , 2011 .

[16]  Xiao Lu,et al.  A Comparison between Tnime-slot Scheduling Approaches for All-Photonic Networks , 2005, 2005 5th International Conference on Information Communications & Signal Processing.

[17]  Christopher J. Hughes,et al.  Carbon: architectural support for fine-grained parallelism on chip multiprocessors , 2007, ISCA '07.

[18]  Mark Moir,et al.  Wait-free synchronization in multiprogrammed systems: integrating priority-based and quantum-based scheduling , 1999, PODC '99.

[19]  Sarah H. Sellke,et al.  Timing Channel Capacity for Uniform and Gaussian Servers , 2006 .

[20]  Håkan Sundell.  Wait-Free Multi-Word Compare-and-Swap Using Greedy Helping and Grabbing , 2011, International Journal of Parallel Programming.

[21]  Smruti R. Sarangi,et al.  Lock-Free and Wait-Free Slot Scheduling Algorithms , 2016, IEEE Trans. Parallel Distributed Syst..

[22]  Maurice Herlihy,et al.  The art of multiprocessor programming , 2020, PODC '06.

[23]  Jordi Torres,et al.  GreenSlot: Scheduling energy consumption in green datacenters , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[24]  Michael B. Jones,et al.  CPU reservations and time constraints: efficient, predictable scheduling of independent activities , 1997, SOSP.

[25]  Yu-Chee Tseng,et al.  Simple and Regular Mini-Slot Scheduling for IEEE 802.16d Grid-Based Mesh Networks , 2010, 2010 IEEE 71st Vehicular Technology Conference.

[27]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[28]  Gadi Taubenfeld,et al.  Disentangling Multi-object Operations , 1997 .

[29]  Smruti R. Sarangi,et al.  Software Transactional Memory Friendly Slot Schedulers , 2014, ICDCIT.

[30]  Min-You Wu,et al.  On Runtime Parallel Scheduling for Processor Load Balancing , 1997, IEEE Trans. Parallel Distributed Syst..

[31]  Jon Feldman,et al.  A Truthful Mechanism for Offline Ad Slot Scheduling , 2008, SAGT.

[32]  Christos Faloutsos,et al.  On multidimensional data and modern disks , 2005, FAST'05.

[33]  Erez Petrank,et al.  Wait-free queues with multiple enqueuers and dequeuers , 2011, PPoPP '11.

[34]  Smruti R. Sarangi,et al.  RADIR: Lock-free and wait-free bandwidth allocation models for solid state drives , 2014, 2014 21st International Conference on High Performance Computing (HiPC).