- Research Article
- 10.1016/0165-6074(90)90268-e
An environment for parallel programming in PASCAL
- Aug 01, 1990
- Microprocessing and Microprogramming
- Nelson Q Vasconcelos + 2 more +2
An environment for parallel programming in PASCAL
A software environment called Parade (PArallel And Distributed Environment) for parallel programming is proposed. Its main objective is to make the programming as easy as possible. The development, debugging, execution, monitoring and optimization of parallel programs have been addressed. Several aspects of parallel program execution, such as task assignment to the processors, task synchronization and communication, are addressed by the system automatically. Two types of parallel system architectures have been considered: tightly coupled (i.e. multiprocessor systems) and loosely coupled with distributed memory (i.e. multicomputer systems). A user-friendly visual interface, realized with OSF/Motif, is provided for all phases of parallel program development. A prototype of our environment is running on a Meiko Transputer-based system and on a network of Unix-based workstations. >
An environment for parallel programming in PASCAL
An environment for parallel programming in PASCAL
Research of Parallel Program Performance Analysis and Optimization on Multicore Platform
Parallel program can give full play to the computing power of multicore processors to meet user demand for high performance. With the number of cores increases, the currency of program can be increasingly higher and higher. Efficient parallel programs have become a focus of the industry. The paper focuses on the key issues in parallel program optimization, proposed cycles and methods of the parallel program performance analysis and optimization. Finally, gave the optimization process and optimize the results in case of Monte Carlo calculation of pi.
Read moreUsing Java and JavaScript in the Virtual Programming Laboratory: a Web-based parallel programming environment
The Virtual Programming Laboratory (VPL) is a Web-based virtual programming environment built based on a client–server architecture. The system can be accessed on any platform (Unix, PC or Mac) using a standard Java-enabled browser. Software delivery over the Web imposes a novel set of constraints on design. We outline the tradeoffs in this design space, motivate the choices necessary to deliver an application, and detail the lessons learned in the process. We discuss the role of Java and other Web technologies in the realization of the design. VPL facilitates the development and execution of parallel programs. The initial prototype supports high-level parallel programming based on Fortran 90 and High Performance Fortran (HPF), as well as explicit low-level programming with the MPI message-passing interface. Supplementary Java-based platform-independent tools for data and performance visualization are an integral part of the VPL. Pablo SDDF trace files generated by the Pablo performance instrumentation system are used for post-mortem performance visualization. © 1997 John Wiley & Sons, Ltd.
Read moreCompiler Synthesis of Task Graphs for Parallel Program Performance Prediction
Task graphs and their equivalents have proved to be a valuable abstraction for representing the execution of parallel programs in a number of different applications. Perhaps the most widespread use of task graphs has been for performance modeling of parallel programs, including quantitative analytical models [3],[19],[25],[26],[27], theoretical and abstract analytical models [14], and program simulation [5],[13]. A second important use of task graphs is in parallel programming systems. Parallel programming environments such as PYRROS [28], CODE [24], HENCE [24], and Jade [20] have used task graphs at three different levels: as a programming notation for expressing parallelism, as an internal representation in the compiler for computation partitioning and communication generation, and as a runtime representation for scheduling and execution of parallel programs. Although the task graphs used in these systems differ in representation and semantics (e.g., whether task graph edges capture purely precedence constraints or also dataflow requirements), there are close similarities. Perhaps most importantly, they all capture the parallel structure of a program separately from the sequential computations, by breaking down the program into computational “tasks”, precedence relations between tasks, and (in some cases) explicit communication or synchronization operations between tasks.
Read moreNative and generic parallel programming environments on a transputer and a PowerPC platform
Genericity of parallel programming environments, enabling development of portable parallel programs, is expected to result in performance penalties. Furthermore, programmability and tool support of programming environments are important issues if a choice between programming environments has to be made. In this paper we propose a methodology to compare native and generic parallel programming environments, taking into account such competing issues as portability and performance. As a case study, this paper compares the Iserver-Occam, Parix, Express and PVM parallel programming environments on a 512-node Parasytec GCel. Furthermore, we apply our methodology to compare Parix and PVM on a new architecture, a 32-node Parsytec PowerXplorer, which is based on the PowerPC chip. In our approach we start with a representative application and isolate the basic (environment)-dependent building blocks. These basic building blocks, which depend on floating-point performance and communication capabilities of the environments, are analysed independently. We have measured point-to-point communication times, global communication times and floating-point performance. All information is combined into a time complexity analysis, allowing comparison of the environments on different degrees of functionality. Together with demands for portability of the code and development time (i.e. programmability), an overall judgement of the environments is given.
Read moreA Chare kernel implementation of a parallel Prolog compiler
We have designed and implemented a compiler for the parallel execution of Prolog programs as a machine independent application on top of a run time environment for parallel programming called the Chare Kernel . The compiler is based on the Reduce-OR process model for the AND and OR parallel execution of Prolog programs and hence exploits both OR and independent AND parallelism found in Prolog programs. We describe the salient features of the parallel Prolog compiler from the viewpoint of its implementation as a Chare Kernel application. The responsibilities of process creation, load balancing, queueing strategies for work pool management, memory management and interprocess communication are all assumed by the Chare Kernel thereby eliminating these concerns at the application level. We discuss the effectiveness of this separation for a large application like the parallel Prolog compiler. The machine independence property makes the compiler easy to port on all machines, both shared and nonshared, that support the Chare Kernel . The compiler has been implemented on a variety of machines, including the Encore Multimax, the Sequent Symmetry, the Intel iPSC/2 hypercube and the Alliant FX/8. We briefly discuss its performance on a range of benchmarks exhibiting AND, OR and AND/OR parallelism on two of these machines. The speedups obtained are linear, demonstrating the effectiveness of the Chare Kernel as a simple, elegant, yet powerful environment for parallel programming.
Read moreA Chare kernel implementation of a parallel Prolog compiler
We have designed and implemented a compiler for the parallel execution of Prolog programs as a machine independent application on top of a run time environment for parallel programming called the Chare Kernel. The compiler is based on the Reduce-OR process model for the AND and OR parallel execution of Prolog programs and hence exploits both OR and independent AND parallelism found in Prolog programs. We describe the salient features of the parallel Prolog compiler from the viewpoint of its implementation as a Chare Kernel application. The responsibilities of process creation, load balancing, queueing strategies for work pool management, memory management and interprocess communication are all assumed by the Chare Kernel thereby eliminating these concerns at the application level. We discuss the effectiveness of this separation for a large application like the parallel Prolog compiler. The machine independence property makes the compiler easy to port on all machines, both shared and nonshared, that support the Chare Kernel. The compiler has been implemented on a variety of machines, including the Encore Multimax, the Sequent Symmetry, the Intel iPSC/2 hypercube and the Alliant FX/8. We briefly discuss its performance on a range of benchmarks exhibiting AND, OR and AND/OR parallelism on two of these machines. The speedups obtained are linear, demonstrating the effectiveness of the Chare Kernel as a simple, elegant, yet powerful environment for parallel programming.
Read moreMachine independent AND and OR parallel execution of logic programs. II. Compiled execution
For pt.I. see ibid., p. 170-80. In pt.I, we presented a binding environment for the AND and OR parallel execution of logic programs. This environment was instrumental in rendering a compiler for the AND and OR parallel execution of logic programs machine independent. In this paper, we describe a compiler based on the Reduce-OR process model (ROPM) for the parallel execution of Prolog programs, and provide performance of the compiler on five parallel machines: the Encore Multimax, the Sequent Symmetry, the NCUBE 2, the Intel i860 hypercube and a network of Sun workstations. The compiler is part of a machine independent parallel Prolog development system built on top of a run time environment for parallel programming called the Chare kernel, and runs unchanged on these multiprocessors. In keeping with the objectives behind the ROPM, the compiler supports both on and independent AND parallelism in Prolog programs and is suitable for execution on both shared and nonshared memory machines. We discuss the performance of the Prolog compiler in some detail and describe how grain size can be used to deliver performance that is within 10% of the underlying sequential Prolog compiler on one processor, and scale linearly with increasing number of processors on problems exhibiting sufficient parallelism. The loose coupling between parallel and sequential components makes it possible to use the best available sequential compiler as the sequential component of our compiler.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Read moreDealing with heterogeneity in Stardust: An environment for parallel programming on networks of heterogeneous workstations
This paper describes the management of heterogeneity in Stardust, an environment for parallel programming above networks of heterogeneous machines, which can include distributed memory multi-computers and networks of workstations. Applications using Stardust can communicate both through message passing and distributed shared memory. Stardust is currently implemented on an heterogeneous system including an Intel Paragon running Mach/OSF1 and an ATM network of Pentiums running Chorus/classiX.
Read moreStardust: An Environment for Parallel Programming on Networks of Heterogeneous Workstations
Stardust: An Environment for Parallel Programming on Networks of Heterogeneous Workstations
PARAM parallel supercomputer: architecture, programming environment, and applications
Recognising parallel processing as a leap-frog path for supercomputing as well as the destiny of future generation supercomputers, C-DAC was launched by the Government of India as a national initiative with a first 3-year mission of designing, and bringing into commercial a state-of-the-art parallel supercomputer with peak performance exceeding 1 GFLOPS, proportionate primary and secondary storage, along with parallel programming environment, and application kernels of several applications of national importance running on the target machine. The launch of C-DAC marked the beginning of the era of high-performance computing in India. The prime delivery of the mission, accomplished with an investment of 300 manyears of effort, has been the PARAM parallel supercomputer along with the advanced parallel programming environment PARAS and a spectrum of application kernels in science and engineering. This paper presents a summary of the delivery of C-DAC mission in terms of PARAM parallel supercomputer, its architecture, programming environment and applications. A brief preview is also given of C-DAC's Second Mission to deliver a teraflops architecture Massively Parallel Supercomputer by 1997-98. >
Read moreMonit: a performance monitoring tool for parallel and pseudo-parallel programs
This paper describes a performance monitoring system, Monit, developed for performance evaluation of parallel systems. Monit uses trace files that are generated during the execution of parallel programs. Monit analyzes these trace files and produces time-oriented graphs of resource usage and system queues. Users interactively select the displayed items, resolution, and time intervals of interest. The current implementation of Monit is for SUN-3 workstation, but the program is easily adaptable to other devices. We also introduce a parallel programming environment, PPL, implemented as a superset of C for the Sequent Balance 8000 multi-processor system. Parallel programs written in PPL can produce the trace files for Monit. Monit is also integrated into a process-oriented simulation language CSIM. CSIM allows the creation of simulation models based on multiple processes competing for resources. The similarity between parallel processes in PPL and pseudo-parallel processes in CSIM facilitates this combined use of Monit.
Read moreMonit: a performance monitoring tool for parallel and pseudo-parallel programs
This paper describes a performance monitoring system, Monit, developed for performance evaluation of parallel systems. Monit uses trace files that are generated during the execution of parallel programs. Monit analyzes these trace files and produces time-oriented graphs of resource usage and system queues. Users interactively select the displayed items, resolution, and time intervals of interest. The current implementation of Monit is for SUN-3 workstation, but the program is easily adaptable to other devices.We also introduce a parallel programming environment, PPL, implemented as a superset of C for the Sequent Balance 8000 multi-processor system. Parallel programs written in PPL can produce the trace files for Monit.Monit is also integrated into a process-oriented simulation language CSIM. CSIM allows the creation of simulation models based on multiple processes competing for resources. The similarity between parallel processes in PPL and pseudo-parallel processes in CSIM facilitates this combined use of Monit.
Read moreDesign issues in building Web-based parallel programming environments
We exploited the recent advances in Internet connectivity and Web technologies for building Web-based parallel programming environments (WPPEs) that facilitate the development and execution of parallel programs on remote high-performance computers. A Web browser running on the user's machine provides a user-friendly interface to server-site user accounts and allows the use of parallel computing platforms and software in a convenient manner. The user may create, edit, and execute files through this Web browser interface. This new Web-based client-server architecture has the potential of being used as a future front-end to high-performance computer systems. We discuss the design and implementation of several prototype WPPEs that are currently in use at the Northeast Parallel Architectures Center and the Cornell Theory Center. These initial prototypes support high-level parallel programming with Fortran 90 and High Performance Fortran (HPF), as well as explicit low-level programming with Message Passing Interface (MPI). We detail the lessons learned during the development process and outline the tradeoffs of various design choices in the realization of the design. We especially concentrate on providing server-site user accounts, mechanisms to access those accounts through the Web, and the Web-related system security issues.
Read moreRun‐Time and Compiler Support for Programming in Adaptive Parallel Environments
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at run‐time. In this article, we discuss run‐time support for data‐parallel programming in such an adaptive environment. Executing programs in an adaptive environment requires redistributing data when the number of processors changes, and also requires determining new loop bounds and communication patterns for the new set of processors. We have developed a run‐time library to provide this support. We discuss how the run‐time library can be used by compilers of high‐performance Fortran (HPF)‐like languages to generate code for an adaptive environment. We present performance results for a Navier‐Stokes solver and a multigrid template run on a network of workstations and an IBM SP‐2. Our experiments show that if the number of processors is not varied frequently, the cost of data redistribution is not significant compared to the time required for the actual computation. Overall, our work establishes the feasibility of compiling HPF for a network of nondedicated workstations, which are likely to be an important resource for parallel programming in the future.
Read more