linux-kernel - Computing on semaphores of Dijkstra with place-transition nets

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [day] [month] [year] [list]

Message-ID: <CADsoptPAvqiyU2ruwtfZ8Rc-6F=FFGRMqaCWWukcfLcaZYvVcg@mail.gmail.com>
Date: Fri, 16 Jan 2026 16:15:18 +0100
From: Dmitry Zaitsev <zaitsev.dmitry@...il.com>
To: linux-kernel@...r.kernel.org
Subject: Computing on semaphores of Dijkstra with place-transition nets

Dear all,

Could you consider and comment my offer for adding a new system call
to Linux kernel for extended multiple System V semaphores I shared in
a recently published journal paper

Zaitsev, D. A. Computing on semaphores of Dijkstra with place-transition nets

https://doi.org/10.1080/17445760.2026.2615010

The semopk() system call I offer will allow us to better optimize the
kernel work, especially under critical load, and to find deadlocks --
both fast on-the-fly.

-- 
Yours truly,

Dmitry Zaitsev
HDR, Professor,
Senior Member of ACM and IEEE
https://dimazaitsev.github.io
https://www.linkedin.com/in/dmitry-a-zaitsev/recent-activity/all