Post by Dmitry Zaitsev

A teaser for potential PhD students - implement, benchmark, and describe bigger greedy System V semaphores: (1) just copy sem.c, add a personal prefix to routine and data structure names, and add the corresponding new system calls; test; (2) extend semaphore size to 4 bytes; test; (3) implement greedy semaphores; test and benchmark. No considerable changes to the current sem.c, only bigger size (to compute realistic values) and greediness (to compute fast). Greedy semaphores (Sleptsov-Salwicki rule for PTNs) require just computing the greatest common divisor instead of a conjunction of comparisons. Upload code to GitHub, publish a paper (at least on arXiv). Start with reading and running cited code from: Zaitsev, D. A. (2026). Computing on semaphores of Dijkstra with place-transition nets. International Journal of Parallel, Emergent and Distributed Systems, 41(3), 291–320. https://lnkd.in/eT2pji9W #PhD #Linux #Dijkstra