• Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other Pie Elite all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Tim Cooke
  • Ron McLeod
  • paul wheaton
  • Jeanne Boyarsky
Sheriffs:
  • Paul Clapham
  • Devaka Cooray
Saloon Keepers:
  • Tim Holloway
  • Roland Mueller
  • Himai Minh
Bartenders:

Data-Oriented Programming: concurrency

 
Ranch Hand
Posts: 378
2
Eclipse IDE Firefox Browser Java
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
Hello Yehonathan,

This  is an interesting paradigm, in particular starting from separations of code from data, nevertheless, I wonder about "Control concurrency in highly scalable systems."

Does this approach also is based on immutability, or there are other aspects to achieve that control?

(perhaps eventually consistency?)


Regards,

German


 
Author
Posts: 25
5
  • Likes 2
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
We achieve high scalability due to data immutability.
In Chapter 5 of the book I explain how to leverage data immutability to implement an efficient data diff algorithm in order to detect conflicts between concurrent mutations.

Spoiler: This is similar to git 3-way merge conflict resolution.
 
With a little knowledge, a cast iron skillet is non-stick and lasts a lifetime.
reply
    Bookmark Topic Watch Topic
  • New Topic