HackerTrans
TopNewTrendsCommentsPastAskShowJobs

maniacalhack0r

no profile record

comments

maniacalhack0r
·letztes Jahr·discuss
AasishPokhrel made 2 repos yday - shit and yep. no activity between may 17th and june 10th.

i have no idea if its possible to calculate the rate at which repos are being created and time your repo creation to hit vanity numbers
maniacalhack0r
·letztes Jahr·discuss
DSQL is so cool - have been following since the release and once it supports more of the postgres feature set + extensions it’ll be a killer. Fantastic architecture deep dive at ReInvent as well.
maniacalhack0r
·letztes Jahr·discuss
smart. although, i guess that pushes the locking from selecting queue entries to making sure that objects are placed into exactly 1 batch. curious if you ran into any bottlenecks there?
maniacalhack0r
·letztes Jahr·discuss
completely missed this. apologies.
maniacalhack0r
·letztes Jahr·discuss
completely missed this. apologies.
maniacalhack0r
·letztes Jahr·discuss
as with everything, it depends on how you're processing the queue.

eg we built a system at my last company to process 150 million objects / hour, and we modeled this using a postgres-backed queue with multiple processes pulling from the queue.

we observed that, whenever there were a lot of locked rows (ie lots of work being done), Postgres would correctly SKIP these rows, but having to iterate over and skip that many locked rows did have a noticeable impact on CPU utilization.

we worked around this by partitioning the queue, indexing on partition, and assigning each worker process a partition to pull from upon startup. this reduced the # of locked rows that postgres would have to skip over because our queries would contain a `WHERE partition=X` clause.

i had some great graphs on how long `SELECT FOR UPDATE ... SKIP LOCKED` takes as the number of locked rows in the queue increases, and how this partiton work around reduced the time to execute the SKIP LOCKED query, but unfortunately they are in the hands of my previous employer :(