Simplify Service Dependencies with Nodes
blog.twitter.com
Simplify Service Dependencies with Nodes
1–10 of 60 posts
Re: Simplify Service Dependencies with Nodes
#2So, between the lines - Twitter looks ahead to move to Java 8 and finally ditch Scala?
Re: Simplify Service Dependencies with Nodes
#3So I don't fully follow it all -- but I find it really fascinating. Perhaps the real value at twitter is not the service twitter offers of letting you communicate 140 characters at a time but the engineering that goes on behind the scenes.
Re: Simplify Service Dependencies with Nodes
#4So, between the lines - Twitter looks ahead to move to Java 8 and finally ditch Scala?
Hum .. don't think so. Not quite yet at least. Underneath this, there is Finagle on top of which most services at Twitter is built on. It offers a java API, but remains a Scala library. And there's still a lot of existing code inside to twitter to ditch Scala right away. Java 8 is awesome, but Java is still not an FP language.
Re: Simplify Service Dependencies with Nodes
#5This is like the fourth instance of computational graphs that I've seen recently. Can someone recommend some resources on the underlying theoretical ideas? It's not just graph theory, it's something like computational graph theory or maybe data flow but neither seems to be at the level of formalism I'd like.
Re: Simplify Service Dependencies with Nodes
#6This is like the fourth instance of computational graphs that I've seen recently. Can someone recommend some resources on the underlying theoretical ideas? It's not just graph theory, it's something like computational graph theory or maybe data flow but neither seems to be at the level of formalism I'd like.
You can execute that kind of task with a RETE engine: https://en.wikipedia.org/wiki/Rete_algorithm
Re: Simplify Service Dependencies with Nodes
#7This is like the fourth instance of computational graphs that I've seen recently. Can someone recommend some resources on the underlying theoretical ideas? It's not just graph theory, it's something like computational graph theory or maybe data flow but neither seems to be at the level of formalism I'd like.
You can execute that kind of task with a RETE engine: https://en.wikipedia.org/wiki/Rete_algorithm
Is there something more general?
Re: Simplify Service Dependencies with Nodes
#8So, between the lines - Twitter looks ahead to move to Java 8 and finally ditch Scala?
Why ditch Scala completely?
Re: Simplify Service Dependencies with Nodes
#9nothing groundbreaking here.
Re: Simplify Service Dependencies with Nodes
#10This is like the fourth instance of computational graphs that I've seen recently. Can someone recommend some resources on the underlying theoretical ideas? It's not just graph theory, it's something like computational graph theory or maybe data flow but neither seems to be at the level of formalism I'd like.
You can execute that kind of task with a RETE engine: https://en.wikipedia.org/wiki/Rete_algorithm
> Rete algorithm (/ˈriːtiː/ REE-tee or /ˈreɪtiː/ RAY-tee, rarely /ˈriːt/ REET or /rɛˈteɪ/ re-TAY)
I guess we all can at least agree that there is a way to pronounce it :)