Emerging networking architectures are allowing for flexible and reconfigurable packet processing at line rate both on the switch and the NIC. Despite their promising new functionality, programmable switches and NICs are not all-powerful; they have limited state, support limited types of operations, and limit per-packet computation to operate at line rate. In this talk, I will describe how to mask resource limitations using approximation techniques and new scheduling algorithms and how to build a general framework for exposing in-network computing capability to distributed applications. In addition to presenting case studies of optimizing networked systems, I will reflect on the role of programmable dataplanes in datacenter computing.