A graphical development and debugging environment for parallel programs

Accurate performance prediction using visual prototypes

“…The GRADE (GRAphical Development Environment) [3,4], part of the SEPP (Software Engineering for Parallel Processing) toolset [5] supports the main activities in the parallel software development cycle in a similar way to EDPEPPS. The key difference to EDPEPPS is its graphical language, GRAPNEL [3,4], which is based on its own message-passing interface implemented on top of PVM [6] and therefore does not model exactly the semantics of C/PVM (unlike EDPEPPS).…”

“…The key difference to EDPEPPS is its graphical language, GRAPNEL [3,4], which is based on its own message-passing interface implemented on top of PVM [6] and therefore does not model exactly the semantics of C/PVM (unlike EDPEPPS). In addition, GRAPNEL is a 'pure' graphical language in the sense that even the sequential part of each process must be described graphically, a potentially time consuming process.…”

Associating composition of Petri net specifications with application designs in GRADE

“…To cope with the extra complexity of parallel programs arising due to inter-process communication and synchronisation, we have designed an integrated visual programming environment called GRADE [16]. GRADE stands for Graphical Application Development Environment and its major goal is to provide an easy-to-use, integrated set of programming tools for development of general message-passing applications that can run either on supercomputers or on heterogeneous workstation clusters.…”

Visual input/output specification in different modes

“…In data flow diagrams, the concept of I/O ports [6,10] attached to an operation box is being employed. The operation box is a node in a graph where in-degree arc represents input operation while out-degree arc represents an output operation.…”

“…The existing visual specifications for I/O operations are usually reduced to some lines and arrows in a directed graph. Others used the term ports [6,10] but they are nothing but endpoints connected by a line. Some systems used some kind of annotations either near the nodes of a graph [3] or on the arcs of a digraph [3,9].…”