Current service function chain (SFC) deployment algorithms face challenges in adapting to computing power networks (CPN) characterized by multidimensional resources and high dynamics, which hampers their ability to meet high-quality service demands. We investigate the SFC deployment problem in CPN for achieving low end-to-end latency service provisioning. Specifically, a computing measurement (CM) model is established for evaluating the performance of computing nodes considering multidimensional resources. Furthermore, we propose a novel heuristic SFC deployment algorithm, called CM-based routing selection and virtual network function (VNF) placement (CMRP), to find an approximate solution. Extensive simulations demonstrate that the performance of the presented algorithm closely approximates the optimal solution in small-scale network and surpasses that of the compared algorithm in terms of end-to-end latency in large-scale network.