Throughout 2022, in both social media and publications, we will be highlighting ACM's 75-year role in promoting technical excellence and fostering professional growth.
Vicki L. Hanson, Jennifer T. Chayes Pages 6-7DEPARTMENT: Departments
The West has responded to Russia's invasion of Ukraine with punitive economic sanctions. In one fell swoop, the efficient, (almost) unified world of global technology has come apart.
Moshe Y. Vardi Page 9DEPARTMENT: Career paths in computing
I'll never forget the time — at just six years of age — when my father showed me a toy robot holding a tray and told me that very soon there will be actual robot helpers in our home working for us.
Asim Munawar Page 11DEPARTMENT: ACM Open
Nearly 200 research institutions have signed on to ACM Open, and the Association is fast approaching the first major milestone for the transition to an Open Access Publisher.
Scott E. Delman Pages 12-13DEPARTMENT: ACM's election
Released as open source in November 2009, Go has become the foundation for critical infrastructure at every major cloud provider. Its creators look back on how Go got here and why it has stuck around.
Russ Cox, Robert Griesemer, Rob Pike, Ian Lance Taylor, Ken Thompson Pages 70-78
To understand automation and the future of work, this study explores how human labor competes, or cooperates, with technology in performing a range of tasks.
Jiyong Park, Jongho Kim Pages 79-87SECTION: Review articles
The opportunities and challenges of adapting and applying AI principles to synbio.
Mohammed Eslami, Aaron Adler, Rajmonda S. Caceres, Joshua G. Dunn, Nancy Kelley-Loughnane, Vanessa A. Varaljay, Hector Garcia Martin Pages 88-97SECTION: Research highlights
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.
Hsuan-Chi Kuo, Jianyan Chen, Sibin Mohan, Tianyin Xu Pages 101-109
"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.
Emina Soljanin Page 110
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.
Ankur Mallick, Malhar Chaudhari, Utsav Sheth, Ganesh Palanikumar, Gauri Joshi Pages 111-118COLUMN: Last byte