D. Notkin, L. Snyder, D. Socha et al., "Experiences with Poker", Proc. of ACM/SIGPLAN PPEALS, pp 10-20, July 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....rather than competitive in providing an upgrade path from sequential to parallel code. Automatic or more accurately semi automatic, approaches have proved successful for scientific array calculations[ 1,2,3] while the explicit approach yields greater benefit for less regularly structured problems[4,5]. MP supports explicit parallelism. Its novelty lies in the explicit description, in the Darwin language[6] of the parallel structure or framework in which sequential processes execute. These Darwin structures can be generic allowing a user to select an appropriate structure from a library ....

....of large regular graph structures is a tedious activity best left to the concise descriptions afforded by a textually based configuration language. The developers of the Poker environment, a visual programming environment for distributed memory parallel programs, have also met this problem[5]. However, Poker does not have a textually based configuration language. Our current approach in the REX[10] project is to develop a graphics based tool in which the textual description can be generated from a graphic description and vice versa. Each component of a program may thus be designed and ....

D. Notkin, L. Snyder, D. Socha et al., "Experiences with Poker", Proc. of ACM/SIGPLAN PPEALS, pp 10-20, July 1988.

....of multiprocessor applications. The following paragraph gives an overview of the most successful design environments for message based multiprocessors. One of the first programming environments for non shared memory applications was the Poker system developed at the University of Washington [Gate87, Notk88]. A Poker program is represented by a process graph, with vertices representing processes and edges representing communication paths between processes. A very similar approach is taken in the Muppet system [Mueh88a] which is part of the german Suprenum project. The concepts used in the CODE ....

D. Notkin, L.Snyder, D. Socha et al.: Experiences with Poker, Proceedings of the ACM/SIGPLAN PPEALS, 1988, p. 10-20.<E-39>

.... Environment, Aral and Gertner [54] ffl PAWS, A performance Evaluation Tool for Parallel Computing Systems, Pease et al. [55] 46 ffl PIE, A programming and instrumentation environment for parallel processing, Segall and Rudolph [56] ffl Poker Parallel Programming Environment, Notkin et al. [57]. ffl Prism Programming Environment, Sistare et al. [3] ffl PTOPP, A Practical Toolset for the Optimization of Parallel Programs, Earl McClaughry [58] ffl Quartz, A Tool for Tuning Parallel Program Performance, Anderson and Lazowska [6] ffl Start PAT, A Parallel Programming Toolkit, Appelbe ....

David Notkin and et al, "Experiences with Poker", in ACM SIGPLAN Notices, 1988.

....problems one can separate programming into computation and coordination by means of different languages like we do in ConCoord. Darwin [Dul92] provides a declarative coordination language called a configuration language which has been used for both distributed and parallel programming; Poker [NSea88, Sny84] offers a graphical coordination language. Both Darwin and Poker manipulate solely interactive computation processes and their support for expressing dynamic structures is very limited. P 3 L [DMO 92] provides a pre defined set of generic structures parameterised by computation ....

D. Notkin, L. Snyder, and D. Socha et al. Experiences with Poker. In Proc. of PPEALS, pages 10--20. ACM/SIGPLAN, 1988.

....be bound to the supervisor instance. Type specific bindings are useful in contexts other than dynamic instantiation. They can be used to specify default bindings which are over ridden by instance specific bindings. For example, we could have used type specific bindings to specify that all 14 2 It should be noted that in a more realistic program the number of filter components created could be dramatically decreased by passing each filter the limit as a parameter and including a test to insure that a message was only sent to the right(thus creating a new instance) if its value ....

....of large regular graph structures is a tedious activity best left to the concise descriptions afforded by a textually based configuration language. The developers of the Poker environment, a visual programming environment for distributed memory parallel programs, have also met this problem[14] However, Poker does not have a textually based configuration language. Our current approach is to develop a graphics based program design tool in which the textual description can be generated from a graphic description and vice versa[15] Each component of a program may thus be designed and ....

D. Notkin, L. Snyder, D. Socha et al., " Experiences with Poker", Proc. of ACM/SIGPLAN PPEALS, pp 10-20, July 1988.

....by the time taken to perform a light weight thread context switch on the SPARC architecture. Local Remote Message Size(bytes) Test Synchronous X.out(M) X.in(M) Asynchronous X.send(M) X.in(M) 1 100 1000 1 100 1000 118uS 126uS 197uS 1.89mS 2.05mS 3.01mS 121uS 131uS 182uS 0.98mS 1. 16mS 2.17mS Table 1 Port communication performance In this section, we have illustrated how communication is supported in Regis by C objects. In particular, we have used the Regis port object as an example. Ports can be used to transfer messages with complex datatypes as well as the simple base ....

....of large regular graph structures is a tedious activity best left to the concise descriptions afforded by a textually based configuration language. The developers of the Poker environment, a visual programming environment for distributed memory parallel programs, have also met this problem [16] However, Poker does not have a textually based configuration language. Our current approach is to develop a graphics based program design tool in which the textual description can be generated from a graphic description and vice versa [17] Each component of a program may thus be designed and ....

D. Notkin, L. Snyder, D. Socha et al., " Experiences with Poker", Proc. of ACM/SIGPLAN PPEALS, pp 10-20, July 1988.

....rather than competitive in providing an upgrade path from sequential to parallel code. Automatic or more accurately semi automatic, approaches have proved successful for scientific array calculations[1,2,3] while the explicit approach yields greater benefit for less regularly structured problems[4,5]. MP supports explicit parallelism. Its novelty lies in the explicit description, in the Darwin language[6] of the parallel structure or framework in which sequential processes execute. These Darwin structures can be generic allowing a user to select an appropriate structure from a library rather ....

....of large regular graph structures is a tedious activity best left to the concise descriptions afforded by a textually based configuration language. The developers of the Poker environment, a visual programming environment for distributed memory parallel programs, have also met this problem[5]. However, Poker does not have a textually based configuration language. Our current approach in the REX[10] project is to develop a graphics based tool in which the textual description can be generated from a graphic description and vice versa. Each component of a program may thus be designed and ....

D. Notkin, L. Snyder, D. Socha et al., " Experiences with Poker", Proc. of ACM/SIGPLAN PPEALS, pp 10-20, July 1988.

No context found.

David Notkin, Lawrence Snyder, David Socha, Mary L. Bailey, Bruce Forstall, Kevin Gates, Raymond Greenlaw, William G. Griswold, Thomas J. Holman, Richard Korry, Gemini Lasswell, , Robert Mitchell, and Philip A. Nelson. Experiences with poker. In Proceedings of the ACM/SIGPLAN PPEALS, Parallel Programming: Experience with Applications, Languages and Systems, pages 10--20, 1988.

No context found.

Notkin, D., L. Snyder, D. Socha, M.L. Bailey, B. Forstall, K. Gates, R. Greenlaw, W.G. Griswold, R.J. Holman, R. Korry, G. Lasswell, R. Mitchell, and P.A. Nelson. 1988. Experiences with poker. In Proceedings of the ACM/SIGPLAN PPEALS, 10-20. Association of Computing Machinery, New York, New York.

....but in most realistic applications these lead to convoluted code. For example, SIMPLE can have up to nine different cases depending on which portions of the boundaries are contained within a process and these conditionals can lead to code that is dominated by the treatment of exceptional cases [18, 38]. For example, suppose a program with a block decomposition assumes in its conditional expression that a process is either a NorthEast, East, or SouthEast section, as shown below: if (NorthEast) special case 1 else if (East) special case 2 else if (SouthEast) special ....

D. Notkin, D. Socha, M. Bailey, B. Forstall, K. Gates, R. Greenlaw, W. Griswold, T. Holman, R. Korry, G. Lasswell, R. Mitchell, P. Nelson, and L. Snyder. Experiences with Poker. In Proceedings of the ACM SIGPLAN Symposium on Parallel Programming: Experience with Applications, Languages, and Systems, July 1988.

....but in most realistic applications these lead to convoluted code. For example, SIMPLE can have up to nine different cases depending on which portions of the boundaries are contained within a process and these conditionals can lead to code that is dominated by the treatment of exceptional cases [18, 41]. For example, suppose a program with a block decomposition assumes in its conditional expression that a process is either a NorthEast, East, or SouthEast section, as shown below: if (NorthEast) special case 1 else if (East) special case 2 else if (SouthEast) special ....

D. Notkin, D. Socha, M. Bailey, B. Forstall, K. Gates, R. Greenlaw, W. Griswold, T. Holman, R. Korry, G. Lasswell, R. Mitchell, P. Nelson, and L. Snyder. Experiences with Poker. In Proceedings of the ACM SIGPLAN Symposium on Parallel Programming: Experience with Applications, Languages, and Systems, July 1988.

No context found.

D. Notkin, L. Snyder, D. Socha, M.L. Bailey, B. Forstall, K. Gates, R. Greenlaw, W. Griswold, T. Holman, R. Korry, G. Lasswell, R. Mitchell, and P.A. Nelson. Experiences with Poker. In Proceedings ACM/SIGPLAN PPEALS, 1988.

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