Optimizing Python With Cython
Thursday, 6 May 2021
This is a mirror of a 2015 article I wrote about using Cython.
Python is slow. It’s still faster than a lot of other languages, but describing Python code as “fast” will probably get some weird looks from people who use compiled or JITted languages.
Still, I love Python for its design and speed at which I can write good code. Most of the time, when writing Python for distributed or web applications, it doesn’t matter. Your runtime is usually dominated by network traffic or data accesses than it is by raw computational speed. In those cases, the correct optimization is often reducing network requests or indexing your data.
Sometimes—just occasionally—we actually do need fast computation. Traditional Python wisdom has been to profile your code (perhaps using cProfile), identify the hot spot, and rewrite it in C as a Python extension. I’ve had to do that before for a handwriting recognition algorithm with great success (it turned a 2–3 second computation into a practically real-time one), but writing C code and then figuring out the FFI was a pain. I had to rewrite the algorithm in C, verify that my C version was correct and didn’t have memory errors, and then figure out the right incantations to get it to cooperate with Python.
Let’s try something different this time.
Problem
At DoubleMap, geographic distance calculation is something that gets used a lot, and we use the haversine function to calculate distance between two points on Earth. In some of our data analysis, we might run the haversine function millions of times in a tight loop, and it was causing some reports to take way too long.
Profiling the code showed that the two heaviest operations were fetching data from the data store and the haversine function.
Play along at home: Clone the repo at https://github.com/doublemap/haversine-optimization and start from the first commit to see how the code changes step by step.
The commands you should know are pip install cython
and python setup.py build_ext --inplace
.
Original code
from math import sin, cos, acos
def haversine(coord1, coord2):
"""Given two (lat, lng) tuples, returns the distance between them in
meters."""
lat1, lng1 = coord1
lat2, lng2 = coord2
if lat1 > 90 or lat1 < -90 or lat2 > 90 or lat2 < -90:
raise ValueError("Invalid latitude (should be between +/- 90)")
if lng1 > 180 or lng1 < -180 or lng2 > 180 or lng2 < -180:
raise ValueError("Invalid longitude (should be between +/- 180)")
phi1 = (90.0 - lat1) * 0.0174532925
phi2 = (90.0 - lat2) * 0.0174532925
theta1 = lng1 * 0.0174532925
theta2 = lng2 * 0.0174532925
c = (sin(phi1) * sin(phi2) * cos(theta1 - theta2) + cos(phi1) * cos(phi2))
arc = acos(c)
return arc * 6367444.7
Also, here’s the benchmark code that is used throughout:
from __future__ import print_function
from timeit import timeit
print(timeit("haversine((39.132213, -86.12439), (38.55213, -86.94910))",
setup="from haversine import haversine",
number=300000))
Pretty straightforward. Let’s try pre-compiling this code into a C extension to see if that helps.
Following the Cython Basic Tutorial, I renamed haversine.py
to haversine.pyx
and created a setup.py
file:
from distutils.core import setup
from Cython.Build import cythonize
setup(
ext_modules = cythonize("haversine.pyx")
)
Running python setup.py build_ext --inplace
built haversine.so
out of my unmodified Python code. Easy-peasy.
Benchmark results (300,000 iterations):
Original code: 2.85 seconds
Compiled: 2.01 seconds
So, 29% time savings without any modification to the original code.
C math functions
Currently, we’re still using Python’s math functions. Let’s see if we can cut out some overhead by importing math.h
instead.
Except, since this is Cython, all we need to do is:
--- a/haversine.pyx
+++ b/haversine.pyx
@@ -1,4 +1,4 @@
-from math import sin, cos, acos
+from libc.math cimport sin, cos, acos
Benchmark results (300,000 iterations):
Original code: 2.85 seconds
Compiled: 2.01 seconds
libc.math: 1.33 seconds
So far we’ve saved 53% of the time from the original code.
C types
Cython’s biggest extension of the Python language is its type annotations. Speed ups can be had by telling Cython the types of each variable in advance. We are dealing with geographic coordinates, so we’ll be using doubles for pretty much everything:
def haversine(tuple coord1, tuple coord2):
"""Given two (lat, lng) tuples, returns the distance between them in
meters."""
cdef double lat1
cdef double lng1
cdef double lat2
cdef double lng2
lat1, lng1 = coord1
lat2, lng2 = coord2
if lat1 > 90 or lat1 < -90 or lat2 > 90 or lat2 < -90:
raise ValueError("Invalid latitude (should be between +/- 90)")
if lng1 > 180 or lng1 < -180 or lng2 > 180 or lng2 < -180:
raise ValueError("Invalid longitude (should be between +/- 180)")
cdef double ph1
cdef double ph2
cdef double theta1
cdef double theta2
cdef double c
cdef double arc
phi1 = (90.0 - lat1) * 0.0174532925
phi2 = (90.0 - lat2) * 0.0174532925
theta1 = lng1 * 0.0174532925
theta2 = lng2 * 0.0174532925
c = (sin(phi1) * sin(phi2) * cos(theta1 - theta2) + cos(phi1) * cos(phi2))
arc = acos(c)
return arc * 6367444.7
Original code: 2.85 seconds
Compiled: 2.01 seconds
libc.math: 1.33 seconds
C types: 0.466 seconds
In three easy steps, we’ve reduced the run time of this function by 84%. More importantly, we’re still writing what’s basically Python. We don’t have to remember to free our variables or check our array bounds. That additional safety is not free (and there are various flags to disable Cython safety checks) but with Cython, optimizing a Python function doesn’t have to be a rewrite-everything task.
We probably could have gone further in optimizing this, but these speed-ups got us into “good enough” territory, and that’s good enough.
Distribution
Our optimized haversine function is available on PyPI under the name “cHaversine”. One key difference is that the distributed tarball includes the C code generated by Cython so that you, as the package user, don’t need Cython to download and build the C extension.