P. Kacsuk, G. Dzsa, F. Fadgyas: Designing parallel programs by the graphical language GRAPNEL, Microprocessing and Microcomputing, Vol. 41, 1996, pp. 625-643.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....medium and where contentions occur. In the the SEPP project [12, 13] Software Engineering for Parallel Processing) a toolset based on five types of tools has developed. There are static design tools, dynamic support tools, behaviour analysis and simulation tools, and visualisation tools [23, 24, 25].The programming model is also based on a subset of PVM. 3 Simulation in EDPEPPS SEPP The EDPEPPS [14] Environment for Design and Performance Evaluation of Portable Parallel Software) toolset being developed at the University of Westminster includes parts of the SEPP toolset. It is based on a ....

P. Kacsuk, P.Dozsa, T. Fadgyas Designing Parallel Programs by the Graphical Language GRAPNEL Microprocessing and Microprogramming, Vol. 41 (1996) pages 625--643

....the method of calculating communication costs for the scheduling heuristics has to be adapted to these new architectural constraints. In this paper, we describe a parallel genetic algorithm (PGA) 4, 16] which is currently implemented within a GRADE environment [8] using a GRAPNEL language[9]. In GRADE, parallel programs can be constructed in a graphical way and merged with text code. It allows to include existing programs into a parallel application. In this way, the effort on porting a program into a parallel machine is minimized. We will follow this approach in our implementation ....

....a PGA solving the task scheduling problem in the following way. The first step is implementation of a serial GA which searches a space of possible task priorities and task assignments for the list scheduling algorithm presented in [11] Then, we use the GRED editor which supports GRAPNEL language [9], to design a parallel genetic algorithm. In GRADE, parallel programs are constructed in a hierarchical way. At the highest level, called application level, processes, their communication ports and connections between ports must be defined graphically. Process functionality can be expressed at ....

P.Kacsuk, G.Dozsa, T.Fadgyas: Designing Parallel Programs by the graphical language GRAPNEL, Microprocessing and Microprogramming, Vol. 41, 1996, pp. 625-643.

....in order to support good load balancing during program execution. Support for program decomposition and task assignment to nodes in the target metacomputer will be important. A common framework to solve these problems could be the introduction of very highlevel graphical languages like GRAPNEL [KaDF98] where program decomposition, communication primitives (like PVM and MPI calls) and task assignment to network topologies are intensively supported by graphics. Moreover the language concept can be systematically extended to a graphical programming environment where all the necessary support tools ....

P. Kacsuk, G. Dzsa, F. Fadgyas: Designing parallel programs by the graphical language GRAPNEL, Microprocessing and Microcomputing, Vol. 41, 1996, pp. 625-643.

....Available predefined process topology templates like mesh, tree, etc. also help the fast creation of large, regularly connected process graphs which are typical in many data parallel algorithms. Detailed description of GRAPNEL and GRED including the use of topology templates can be found in [9]. 2.2 Animating and debugging of GRAPNEL programs A distributed debugger called DDBG (Distributed DeBuGger) developed at the University Nova de Lisboa is integrated into the GRADE environment. DDBG is a general purpose debugging tool for PVM programs and it defines a set of C functions that can ....

P.Kacsuk, G.Dzsa, T.Fadgyas: Designing parallel program by the graphical language GRAPNEL, Microprocessing and Microcomputing, 1996 (41) 625-643.

....IN GRAPNEL 6 4 Programming in GRAPNEL To code our algorithm in GRAPNEL we are supposed to use the graphical program editor GRED which is specially designed to help the programming work in GRAPNEL. A detailed description of how to use GRAPNEL and GRED togehter the interesed reader can find in [1] [2] and [3] 1 2 2 MASTER SLAVE 1 Figure 6: The Process Communication Level representation of the processes There are several possibilities to implement the algorithm in GRAPNEL. We show here the simplest one which uses two static processes (see Fig. 6) A more advanced implementation with dynamic ....

....(int argc, char argv[ int tids[ FILE inpf; int iii, res, bufid, spawnpar = PvmTaskDefault; printf( n t GrapColor(STATIC) v. 0. 3 t t ) Testing command line arguments if ( argc = 4) strcmp (argv[1] n ) strcmp (argv[1] s ) strcmp (argv[1] v ) argv[2] = printf( n Starting: grcol n s v nproc graph file name n ) return (NULL) nproc = min (atoi (argv[2] 1) MAXNRPROC) if ( strcmp (argv[1] n ) infomod = 0; else if ( strcmp (argv[1] s ) infomod = 1; else spawnpar = spawnpar PvmTaskDebug; infomod ....

[Article contains additional citation context not shown here]

P.Kacsuk, G. D'ozsa, T. Fadgyas: Designing Parallel Programs by the Graphical Language GRAPNEL. Technical Report MTA KFKI, Jun., 1995.

No context found.

P. Kacsuk, G. D'ozsa and T. Fadgyas: Designing parallel programs by the graphical language GRAPNEL, Microprocessing and Microprogramming, 41:625-643, 1996

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