| T. Bemmerl & P. Braun (1993) Visualisation of message passing parallel programs with the topsys parallel programming environment. Journal of Parallel and Distributed Computing 18, 118}128. |
....topology. A task graph has nodes representing tasks, each marked with an estimated execution time, and arcs representing communication channels, each marked with the size of the message to be transmitted. Process nodes may be iconised by meaningfully depicting them as pictures, as shown in VISTOP [42] and GILT [43] An alternative view of the process graph is a tree structure of processes, whose hierarchy shows from which process a given process was created or forked [43] All the systems using the notation of process graphs, such as the one in Figure 13, display multiprocessor topologies in ....
T. Bemmerl & P. Braun (1993) Visualisation of message passing parallel programs with the topsys parallel programming environment. Journal of Parallel and Distributed Computing 18, 118}128.
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