multiversion-concurrency-control VS supercollider

The code is in this repository https://github.com/samsquire/multiversion-concurrency-control in MultiplexingThread.java and MultiplexProgramParser.java

https://github.com/samsquire/multiversion-concurrency-contro...

And I implemented a 3 way text diff with myers algorithm based on https://blog.jcoglan.com/2017/02/12/the-myers-diff-algorithm...

https://github.com/samsquire/text-diff

I implemented an eventually consistent mesh protocol that uses timestamps to provide last write wins

I think I lean towards per-thread sharding instead of mutex based or lock free data structures except for lockfree ringbuffers.

You can get embarassingly parallel performance if you split your data by thread and aggregate periodically.

If you need a consistent view of your entire set of data, that is slow path with sharding.

In my experiments with multithreaded software I simulate a bank where many bankaccounts are randomly withdrawn from and deposited to. https://github.com/samsquire/multiversion-concurrency-contro...

I get 700 million requests per second due to the sharding of money over accounts.

If you want some sample code to implement MVCC, I implemented MVCC in multithreaded Java as a toy example

https://github.com/samsquire/multiversion-concurrency-contro...

First read TransactionC.java then read MVCC.java

I wrote an unrolled switch statement in Java to simulate eager async/await across treads.

https://github.com/samsquire/multiversion-concurrency-contro...

The goal is that a compiler should generate this for you. This code is equivalent to the following:

   task1:

https://doc.rust-lang.org/book/ch16-00-concurrency.html

I've been working on implementing Java async/await state machine with switch statements and a scheduling loop. If the user doesn't await the async task handle, then the task's returnvalue is never handled. This is similar to the Go problem with the go statement.

https://github.com/samsquire/multiversion-concurrency-contro...

If your async call returns a handle and

yield value2++

https://github.com/samsquire/multiversion-concurrency-contro...

I am still working on allowing multiple coroutines to be in flight in parallel at the same time. At the moment the tasks share the same background thread.

I asked this stackoverflow question regarding C++ coroutines, as I wanted to use coroutines with a thread pool.

https://stackoverflow.com/questions/74520133/how-can-i-pass-...

This is very interesting. Thank you for submitting this and thank you for working on this.

I am highly interested in parallelism and high concurrency. I implemented multiversion concurrency control in Java.

https://github.com/samsquire/multiversion-concurrency-contro...

I am curious how to handle replication with high concurrency. I'm not sure how you detect dangerous reads+writes to the same key (tuples/fields) across different replica machines. In other words, multiple master.

I am aware Google uses truetime and some form of timestamp ordering and detection of interfering timestamps. But I'm not sure how to replicate that.

I began working on an algorithm to synchronize database records, do a sort, then a hash for each row where hash(row) = hash(previous_row.hash + row.data)

Then do a binary search on hashes matching/not matching. This is a synchronization algorithm I'm designing that requires minimal data transfer but multiple round trips.

The binary search would check the end of the data set for hash(replica_a.row[last]) == hash(replica_b.row[last]) then split the hash list in half and check the middle item, this shall tell you which row and which columns are different.

Link to the audio programming language / server they're using in the article: https://github.com/supercollider/supercollider

For the intrepid, especially those annoyed with the purported input-sluggishness of musescore et al, an interesting text-based alternative is LilyPond https://lilypond.org/

My dad wrote an opera using LilyPond in vim, though I believe these days he's actually doing more with supercollider, which skips sheetmusic and goes right to sounds: https://supercollider.github.io/

Weirdly enough,I got into programming through music. I got into making experimental electronic music and ended up learning SuperCollider. Figured I’d have to get a real job at some point and I liked learning Supercollider enough that I figured I should try to go back to school and learn some more useful programming languages

So you’re wondering what would making music with code look like? The tools I’m familiar with are TidalCycles, Sonic Pi, and SuperCollider. I’m having a hard time describing what it’s like to make music with tools like these so here’s a video of a performance. One person is live coding the music and the other is live coding the visuals. I think it’s super cool how the music is improvised and built over time by layering commands. Some keywords you could search to see more examples would be Algorave and Livecoding.

So far mostly Vim (not for coding, just writing so far), NetHack, Firefox, and mpd and ncmpcpp. Also mpv occasionally. I'm planning on installing SuperCollider at some point too and getting back into that, but that shouldn't be too heavy either.

I would say no there aren't any sample packs for this kind of stuff because this entire scene developed around using a samplers and sampling as well as some computer tools like Max/Msp, SuperCollider, Recycle, Cool Edit Pro and some other stuff I am quite likely forgetting at the moment. Also you might look at some of the IRCAM stuff too.

Sonic pi is basically a wrapper for the amazing language Supercollider (https://supercollider.github.io/). I highly recommend watching Eli Fieldsteel's excellent tutorials on it (https://www.youtube.com/watch?v=yRzsOOiJ_p4&list=PLPYzvS8A_rTaNDweXe6PX4CXSGq4iEWYC) to see some of what its capable of (I think he is almost a finished a new book on it as well).