LWN.net's Journal
[Most Recent Entries]
[Calendar View]
Thursday, February 7th, 2019
| Time |
Event |
| 12:07a |
[$] Lisp and the foundations of computing
At the start of his linux.conf.au
2019 talk, Kristoffer Grönlund said that he would be taking attendees
back 60 years or more. That is not quite to the dawn of computing history,
but it is close—farther back than most of us were alive to remember. He
encountered John McCarthy's famous Lisp
paper [PDF] via Papers We Love
and it led him to dig deeply into the Lisp world; he brought back a report for
the LCA crowd. | | 1:15a |
[$] LWN.net Weekly Edition for February 7, 2019
The LWN.net Weekly Edition for February 7, 2019 is available. | | 2:37p |
Security updates for Thursday
Security updates have been issued by Debian (curl, golang, libthrift-java, mumble, netmask, python3.4, and rssh), openSUSE (python-python-gnupg), Oracle (kernel), Scientific Linux (thunderbird), Slackware (curl), SUSE (firefox, python, and rmt-server), and Ubuntu (curl, libarchive, and libreoffice). | | 4:19p |
LSFMM 2019 gains a BPF track
The call for proposals for the 2019 Linux Storage, Filesystem, and
Memory-Management Summit has been updated with an important addition: this
year's event (April 30 to May 2, San Juan, Puerto Rico) will
include a BPF track. The submission deadline has been extended to
February 22 to allow BPF developers to put together their proposals. | | 5:24p |
[$] Concurrency management in BPF
In the beginning, programs run on the in-kernel BPF virtual machine had no
persistent internal state and no data that was shared with any other part
of the system. The arrival of eBPF and, in particular, its maps
functionality, has changed that situation, though, since a map can be
shared between two or more BPF programs as well as with processes running
in user space. That sharing naturally leads to concurrency problems, so
the BPF developers have found themselves needing to add
primitives to manage concurrency (the "exchange and add" or XADD
instruction, for example). The next step is the addition of a
spinlock mechanism to protect
data structures, which has also led to some wider discussions on what the
BPF memory
model should look like. |
|