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

C[omp]ute

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

Surprise Paradox; [Books] Good Author List; [Computing] Efficient queries with grouping in Postgres; [Computing] Automatic Wake (Linux); [Computing] AWS CDK Aspects in Go; [Bike] Adidas Gravel Shoes; [Computing, Horror] Biological Chips; [Books] Weird Lit Recs; [Covid] Extended SIR Models; [Art] York-based Printmaker; [Physics] Quantum Transitions are not Instantaneous; [Computing] AI and Drum Machines; [Computing] Probabilities, Stopping Times, Martingales; bpftrace Intro Article; [Computing] Starlab Systems - Linux Laptops; [Computing] Extended Berkeley Packet Filter; [Green] Mainspring Linear Generator; Better Approach; Rummikub Solver; Chilean Poetry; Felicitations - Empowerment Grant; [Bike] Fixing Spyre Brakes (That Need Constant Adjustment); [Computing, Music] Raspberry Pi Media (Audio) Streamer; [Computing] Amazing Hack To Embed DSL In Python; [Bike] Ruta Del Condor (El Alfalfal); [Bike] Estimating Power On Climbs; [Computing] Applying Azure B2C Authentication To Function Apps; [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

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

Efficient Entropy Estimates for Sequences of Large Values with OpenCL

From: andrew cooke <andrew@...>

Date: Sat, 8 Oct 2011 21:43:34 -0300

I need to estimate the entropy of sequences of large numbers in OpenCL.

The basic idea is to find how often each number occurs and then use the
Shannon (p ln(p)) formula.  But doing that naively in OpenCL is hard - the
numbers are too large to use a simple array (where we increment array[n] each
time we find value n).

(By "large number" I mean that they are represented as an arbitrary number of
32 bit ints).

The sequence length is much shorter than the maximum number and although the
numbers are large certain values are likely to repeat often.  So one approach
is to generate a lookup-table that associates each number with an index and
then historgam the indices.  But I cannot see how to do that efficiently or
easily in OpenCL.

The best idea I have had so far is to use modular arithmetic.  For example,
take the numbers modulo 2^8 and then increment a 255 entry array.  But modulo
2^n simply discards bits past n and the numbers are actually "bit patterns",
so I don't want to do that.  So it seems better to work modul some prime value
(or perhaps several).

Thanks to the magic of modular arithmetic it seems to be relatively easy to
convert large (multi-int32) numbers to their modulo:

   a0 + 2^32 (a1 + 2^32 (a2 + ...))
     = (a0 % n) + (2^32 % n) * ((a1 % n) + (2^32 % n) * ((a2 % n) + ...))

and if I use a prime less than 2^16 (I am thinking a value like 17 might be
enough!) then I can do the above in 32 bit ints without any problems.

I hope that makes sense.  Anyone have any better ideas?  I don't need entropy
exactly - all I want is a number that indicates "how statistically random"
some sequence is in a way that is reasonably smooth and sensitive (since it
will be used as a fitness measure in a GA).  And no, I don't really have any
clues about what a good statistical measure would be, but it would be nice if
it could reject a simple counter (which entropy cannot, so there is certainly
room for improvement).

(Background - the values are the binary state of a system that generates
"rhythms"; the system is deterministic it and tends "naturally" to generate
simple repeating patterns - the aim is to evolve away from that).

Andrew

Radix Sorting

From: andrew cooke <andrew@...>

Date: Sat, 8 Oct 2011 22:22:44 -0300

I just remembered - radix sorting is probably the "right" way to do this.

See for example http://www.moderngpu.com/sort/algo.html

Andrew

Comment on this post