eugene@pioneer.arc.nasa.gov (Eugene N. Miya) (06/06/88)
In article <1784@hubcap.UUCP> you write: >> Gerald's summary of Arvind's tag token data flow. > I'd like to hear more about how this language avoids excessive copying >& wasteful memory usage. How do standard tasks like matrix multiplication, >binary tree insertions, hash table management, etc. work? >Laurence G. Yaffe Internet: lgy@pupthy.princeton.edu There were several posted criticisms of tag token data flow. Let me just point out that building and programming parallel computers is like putting vaccuum tubes together in the late 40s and 50s to build the first uniprocessors (only harder). Give Arvind, Dennis (just down the hall for the summer), and the others to try their concepts. Bits don't all go to immediately solving user problems, otherwise, skip the operating system and write your own I/O (for instance). Give us a chance to do some research! if you want faster computers. It's hard enough trying to get things running. The first few models are bound to be inefficient, costly, etc. Another gross generalization from --eugene miya, NASA Ames Research Center, eugene@aurora.arc.nasa.gov resident cynic at the Rock of Ages Home for Retired Hackers: "Mailers?! HA!", "If my mail does not reach you, please accept my apology." {uunet,hplabs,ncar,ihnp4,decwrl,allegra,tektronix}!ames!aurora!eugene "Send mail, avoid follow-ups. If enough, I'll summarize."