D. B. Skillicorn. The network of tasks model. In Proc. of IASTED Parallel Distributed Computing and Systems, Boston, MA, Nov. 1999. To appear.  Home/Search   Document Details and Download   Summary   Related Articles

.... [2, 9, 16, 21 23] In the general case, integration of task and data parallel models is rather dicult as these models tend to enforce di erent programming and implementation styles [2] However, most of the applications bene ting from a mixed style shows a fairly static and predictable structure [7, 10, 18] and works on a stream of independent data sets. Moreover, in many applications data parallelism is present at the inner level, inside modules which are then glued together using task parallelism [17, 22] These features can be exploited to derive a mixed model which, even if not solving the ....

....groups of processes running the tasks themselves. This information is collected by the colt daemon and broadcast to all the PVM processes running the application. 4 Conclusions related work In recent times, many models proposing the integration of task and data parallelism have been proposed [2, 10, 16 18, 22, 23]. The attempt closest to our approach is Fx [10] which is designed as an extension to HPF. Fx allows the de nitions of a at ensemble of tasks in task parallel sections and relies on compiler time analysis to have a pipelined execution among independent parts of the same task section. Stages ....

[Article contains additional citation context not shown here]

D. B. Skillicorn. The network of tasks model. In Proc. of IASTED Parallel Distributed Computing and Systems, Boston, MA, Nov. 1999. To appear.

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