Andrew Cooke | Contents | Latest | RSS | Previous | Next


Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Choochoo Training Diary

Last 100 entries

[Bike] Gearing On The Back Of An Envelope; [Computing] Okular and Postscript in OpenSuse; There's a fix!; [Computing] Fail2Ban on OpenSuse Leap 15.3 (NFTables); [Cycling, Computing] Power Calculation and Brakes; [Hardware, Computing] Amazing Pockit Computer; Bullying; How I Am - 3 Years Post Accident, 8+ Years With MS; [USA Politics] In America's Uncivil War Republicans Are The Aggressors; [Programming] Selenium and Python; Better Walking Data; [Bike] How Fast Before Walking More Efficient Than Cycling?; [COVID] Coronavirus And Cycling; [Programming] Docker on OpenSuse; Cadence v Speed; [Bike] Gearing For Real Cyclists; [Programming] React plotting - visx; [Programming] React Leaflet; AliExpress Independent Sellers; Applebaum - Twilight of Democracy; [Politics] Back + US Elections; [Programming,Exercise] Simple Timer Script; [News] 2019: The year revolt went global; [Politics] The world's most-surveilled cities; [Bike] Hope Freehub; [Restaurant] Mama Chau's (Chinese, Providencia); [Politics] Brexit Podcast; [Diary] Pneumonia; [Politics] Britain's Reichstag Fire moment; install cairo; [Programming] GCC Sanitizer Flags; [GPU, Programming] Per-Thread Program Counters; My Bike Accident - Looking Back One Year; [Python] Geographic heights are incredibly easy!; [Cooking] Cookie Recipe; Efficient, Simple, Directed Maximisation of Noisy Function; And for argparse; Bash Completion in Python; [Computing] Configuring Github Jekyll Locally; [Maths, Link] The Napkin Project; You can Masquerade in Firewalld; [Bike] Servicing Budget (Spring) Forks; [Crypto] CIA Internet Comms Failure; [Python] Cute Rate Limiting API; [Causality] Judea Pearl Lecture; [Security, Computing] Chinese Hardware Hack Of Supermicro Boards; SQLAlchemy Joined Table Inheritance and Delete Cascade; [Translation] The Club; [Computing] Super Potato Bruh; [Computing] Extending Jupyter; Further HRM Details; [Computing, Bike] Activities in ch2; [Books, Link] Modern Japanese Lit; What ended up there; [Link, Book] Logic Book; Update - Garmin Express / Connect; Garmin Forerunner 35 v 230; [Link, Politics, Internet] Government Trolls; [Link, Politics] Why identity politics benefits the right more than the left; SSH Forwarding; A Specification For Repeating Events; A Fight for the Soul of Science; [Science, Book, Link] Lost In Math; OpenSuse Leap 15 Network Fixes; Update; [Book] Galileo's Middle Finger; [Bike] Chinese Carbon Rims; [Bike] Servicing Shimano XT Front Hub HB-M8010; [Bike] Aliexpress Cycling Tops; [Computing] Change to ssh handling of multiple identities?; [Bike] Endura Hummvee Lite II; [Computing] Marble Based Logic; [Link, Politics] Sanity Check For Nuclear Launch; [Link, Science] Entropy and Life; [Link, Bike] Cheap Cycling Jerseys; [Link, Music] Music To Steal 2017; [Link, Future] Simulated Brain Drives Robot; [Link, Computing] Learned Index Structures; Solo Air Equalization; Update: Higher Pressures; Psychology; [Bike] Exercise And Fuel; Continental Race King 2.2; Removing Lowers; Mnesiacs; [Maths, Link] Dividing By Zero; [Book, Review] Ray Monk - Ludwig Wittgenstein: The Duty Of Genius; [Link, Bike, Computing] Evolving Lacing Patterns; [Jam] Strawberry and Orange Jam; [Chile, Privacy] Biometric Check During Mail Delivery; [Link, Chile, Spanish] Article on the Chilean Drought; [Bike] Extended Gear Ratios, Shimano XT M8000 (24/36 Chainring); [Link, Politics, USA] The Future Of American Democracy; Mass Hysteria; [Review, Books, Links] Kazuo Ishiguro - Never Let Me Go; [Link, Books] David Mitchell's Favourite Japanese Fiction; [Link, Bike] Rear Suspension Geometry; [Link, Cycling, Art] Strava Artwork; [Link, Computing] Useful gcc flags; [Link] Voynich Manuscript Decoded; [Bike] Notes on Servicing Suspension Forks

© 2006-2017 Andrew Cooke (site) / post authors (content).

Efficient Stream Processing

From: andrew cooke <andrew@...>

Date: Tue, 8 Dec 2015 08:45:00 -0300

I needed to process a stream of data efficiently: both quickly and
without using too much memory.  The processing included up-sampling
data (sample and hold) and down-sampling data (low pass filter and
decimation).  The language was C.

The "standard" approach for reducing memory use is to use streams.
This can be time-inefficient when the stream consists of single
values, so I used an interface that supported chunking (passing an
array of values that is less than the total size of the stream, but
large enough for the overhead of passing values to be unimportant
compared to processing time for the array).

However, there is a problem here.  If each stream component requests
an array of size appropriate to service its own request, and we have
significant downsampling, then the requests "up the stream" can become

For example, if we request a chunk 1MB in size from a 16x downsampler
component, that component will request a 16MB chunk from its parent.
And if that is a 16x downsampler too, the grandparent will be
providing 256MB.

So the final interface requests, but does not enforce, an array size.
Parent components return the number of values actually provided.  In
this way components can limit memory use.

In practice, this is best done by a separate component whose only job
is to limit requests.  This can be composed with other components as

So the final interface is:

    struct source;

    typedef int sfree(struct source **s, int status);

    typedef int stake(struct source *s, double *data, int length, int *available);

    typedef struct {
        void *state;
        sfree *free;
        stake *take;
    } source;

(from memory and untested - please forgive any typos).  Where:

  * int return values are staus (0 for OK)

  * sfree allows nested sources to be freed on cleanup

  * stake is the main interface, as described above

  * state depends on the particular component

  * available is the amount of data provided and is zero ony when the
    source is permanently exhausted

And, of course, each component has a constructor something like:

    int mkfoo(source **s, ...);

In addition, the following components and functions were particularly

    int collect(source *s, double *data, int length, int *available);

    int rcollect( above...);

  These two functions repeatedly call the provided source,
  accumulating data until the array is filled or the sources are
  exhausted.  So these "fix up" the chunking variablility described

  The rcollect() function is similar to collect() but (repeatedly)
  calls the parent with a length value selected at random betweeen 1
  and the required length.  This is useful in testing for cache bugs.

    int mkchunk(source **s, source *parent, int n);

  This implements the chunking limit described above.  So its take
  method calls the parent repeatedly, limiting the length to n.

    int mkcat(source **s, source *a, source *b, ...);

    int mkdrop(source **s, source *parent, int n);

    int mksum(source **s, source *a, source *b, ...);

    int mkprod(source **s, source *a, source *b, ...);

    int mkconst(source **s, double k);

    int mkcount(source **s);

  These are all pretty obvious ad help with testing etc.

It can also be useful to have a source that reads from a file, a
function that writs to a file, a function to compare source and file,

The entire library plus testing was 3 days work and performed
surprisingly well.


Comment on this post