A.J.C. van Gemund, "Spc programming power: A conjecture." Personal Communication.  Home/Search   Document Not in Database   Summary   Related Articles

....enough to define all the problems programmers are interested on, but in a way which keeps it possible to analyze, check correctness, and integrate it in a software engineering process. A crucial assumption upon which the development of the SPC model has been based, is the following: Conjecture: [2] A very large class of parallel computations including all practical applications, expressed in a way with no restriction on the synchronization structure, can be written in a SPC language without breaking the original semantics of the problem, in such a way that the computational time is not more ....

....has a high upper bound. And is no matter the way we do synchronizations. We can always find a way to recolocate the task loads, so the conjecture is not true. But we know that with mutual exclusion is very easy to reconfigure any example with this structure in a way that the conjecture is true [2]. Representing the problem of a macropipeline with NSP syntaxis we are adding overspecification. We can use the results we have as a basis for the approach to the NSPC SPC transformation. Finally, we can conclude that this is only a first step in the real problem. We must continue obtaining more ....

A.J.C. van Gemund, "Spc programming power: A conjecture." Personal Communication.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC