yvdriess

37 ms·

541.
by yvdriess 14y ago
See: [5] Arvind, R. S. Nikhil, and K. K. Pingali, “I-structures: data structures for parallel computing,” Transactions on Programming Languages and Systems (TOPLAS, vol. 11, no. 4, Oct. 1989.
542.
by yvdriess 14y ago
p. 127 of www.cs.indiana.edu/~dyb/papers/3imp.pdf gives a pretty good overview, including a ton of references. Roughly, graph reduction execution represents an expression as a node, with an edge to nodes of subexpressions. A value of a node
543.
by yvdriess 14y ago
ping I am very interested in this! Drop me a line at my nick @ vub.ac.be
544.
by yvdriess 14y ago
Very likely. At the very least a subset or with some additions, I-structures come to mind. If you're interested, someone already did some legwork on this, using an eager version of Haskell: [1] S. Aditya, Arvind, J.-W. Maessen, L. Augustsso
545.
by yvdriess 14y ago
I haven't heard of any recent string reduction languages. The last I heard about it was in Kent Dybvig 'Three Scheme Implementations' thesis, where he used it to map Scheme on a dataflow-like FP architecture (IIRC).
546.
by yvdriess 14y ago
> It is my understanding that the lazy semantics of Haskell mostly mean that you shouldn't be making any assumptions about the order of evaluation which would seem to be useful from an optimization perspective. A crudely example, to imp
547.
by yvdriess 14y ago
This is where it needs to happen. The problem is that co-designing a new hardware/software stack from scratch is the computer science equivalent of a moonshot.
548.
by yvdriess 14y ago
Indeed. Many, lacking compiler research know-how, just make it a graph-encoding language, which is really not the point of dataflow. Any language trivially mapping to SSA semantics is already a dataflow language, essentially. SISAL isn't al
549.
by yvdriess 14y ago
> I wonder why Mike considers the usual blend of concepts provided by FP languages to not be worthwhile. As the FP community has consolidated around Haskell, this usually refers to the Haskell feature set: Graph reduction, lazy semanti
550.
by yvdriess 14y ago
Great to see Mike come to such conclusions. I've been interested myself in old dataflow architectures work for the same reasons. Some scholarly input: > But most of the existing ones are visual languages. The dataflow architecture guys
551.
by yvdriess 14y ago
afaik they didn't release their 100-core version. Judging by the changes compared to the TilePRO (more SoC stuff), they seem to be focused on better covering their commercial niche: network and server infrastructure.
552.
by yvdriess 14y ago
Something Intel is essentially still doing, if you compare the cache sizes and set associativity.
553.
by yvdriess 14y ago
Intel is essentially still using the Pentium II architecture, where AMD has refreshed theirs recently with the bulldozer. Intel's fab advantage (32->22nm gives a massive thermal advantage) is getting wasted on putting more GPU on die. P
554.
by yvdriess 14y ago
The core Javascript design is a mix of Scheme and Self, which is interesting in its own right. Most people will recommend: http://shop.oreilly.com/product/9780596517748.do
555.
by yvdriess 14y ago
CL has optional types and quite an interesting type system. Check out Qi if you want a Lisp designed to have a rich type system.
556.
by yvdriess 14y ago
Intel tried the low-power x86 with the Atom, didn't really go anywhere. It's true that scaling up an ARM will be equally problematic. But, the point is that they use ARM because they don't want to push the power envelope.
557.
by yvdriess 14y ago
A bro-grammer's perspective.
558.
by yvdriess 14y ago
It's more similar to the Tilera64 chips and ye olde Transputer. Key difference is the reliance of the MIC on cache coherency across all cores.
559.
by yvdriess 14y ago
Quantum Cryptography is actually Quantum Key Distribution, an algorithm for securely creating a one-time pad between two peers. The proof that quantum crypto is unconditionally secure is just Shannon's proof. The benefit of quantum crypto i
560.
by yvdriess 14y ago
They're not so much social games as they are games on a social platform. Some wouldn't even call them games, nor social. No idea about the seasonal aspects though. Summer vacations typically boost online games.
561.
by yvdriess 14y ago
Can we have Brian Reynolds back now, please? http://en.wikipedia.org/wiki/Brian_Reynolds_(game_designer)
562.
by yvdriess 15y ago
It sounds like this bodes well for measurement-based (aka one-way) quantum computers. a) We can make a massive amount of entangled qubits and b) each can be manipulated and measured separately.
563.
by yvdriess 15y ago
Oh his scheduler implementation is completely in Lisp. It's just that they needed to make a C++ version due to the research context they are working in. Not a very uncommon problem for Lisp users.
564.
by yvdriess 15y ago
There is a very simple explanation. You are not payed to produce code or finished product. While I can't speak for the entire academic CS community, we are constantly under pressure to write less code and write more papers. I really hop
565.
by yvdriess 15y ago
CCP has an economist on their payroll. http://www.wired.com/gamelife/2008/02/eve-online-econ/
566.
by yvdriess 15y ago
Because the only thing you risk doing those bullshit molten core raids was time; your own and that of your fellow party members. The whole point I was trying to make is that focusing on being a time sink and addicting is not what makes a g
567.
by yvdriess 15y ago
World of Warcraft was designed from the beginning with casual in mind. You cannot lose anything and player A is better than B only because A spent more time on the game than B. They introduced bound items and made crafting more of a time-s
568.
by yvdriess 15y ago
Datomic reminds me a lot of the tagged-token dataflow architectures of the day. Really cool.
569.
by yvdriess 15y ago
- Because SIMD is 'easy' from the processor's point of view. Basically the compiler it tasked to bundle parallel computations together. SIMD died out back in the 90s because no one could get that magical parallelizing compiler to work. Si
570.
by yvdriess 15y ago
Composition may be done at runtime, but indeed changing the behavior of an existing object at runtime is not something trait systems provide. Cloning into a new object with different traits is perhaps an option.

More ›