News for hackers. Stuff that matters.

jobeemar

Re:Why Parallel Programming Is So Hard on Monday June 30, 2008 @08:52PM (#232597)
In the frame of reference of the ants, all clocks agree with one another. This means that timing is global within their FOR. There is no problem in determining simultaneity because there is only one FOR in question. And even in multiple FORs, their relative speed would have to approach that of light for any ant to notice a difference between local times. Deny at your own detriment.
Re:Why Parallel Programming Is So Hard on Monday June 30, 2008 @07:37PM (#232552)
It's inherent in the speed of light in their local environment. Physics 101.
Re:Why Parallel Programming Is So Hard on Monday June 30, 2008 @07:00PM (#232526)
He has a parallel quicksort example on his "relevant links" section. He seems to be saying that software should work pretty much like hardware.

http://www.rebelscience.org/Cosas/quicksort.htm

Re:Why Parallel Programming Is So Hard on Monday June 30, 2008 @06:24PM (#232505)
I don't think you really read the article since the author never said that parallelism is inefficient. He's saying, among other things, that decomposition (which you seem to favor) is not the right way to design parallel programs. In other words, if sequential objects are used to create sequential programs, it follows that parallel objects should be used to compose parallel programs. Sequential order thus becomes a consequence of signaling, i.e., communication between parallel objects.