The Research archive provides access to all Research articles published in past issues of Communications of the ACM.
The authors of "Set the Configuration for the Heart of the OS" put a fresh view on the practicability of automatic kernel debloating.
"Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication" addresses the problem of selecting code rates to optimize system performance by making the codes rateless.
We propose a rateless fountain coding strategy and prove that its latency is asymptotically equal to ideal load balancing, and it performs asymptotically zero redundant computations.
This paper presents a study on the practicality of operating system kernel debloating, that is, reducing kernel code that is not needed by the target applications.