Wen Dong · 1999
The object oriented programming technology is very useful in software engineering. It also makes software developers easy to express parallel algorithms in parallel programming. ParaObject is a parallel programming environment based on workstation cluster. It includes object platform, parallel object and mailing object. A software developer expresses parallel coarse grained tasks by parallel objects, and transfers data by mailing object.
Cited by 0
Robert Pękala, JAKUB SZUMILAK, ADRIAN MUCHA · Journal of Education Technology and Computer Science · 2024
Parallel programming is a skill that requires the use of technologies and techniques that allow applications to use multiple threads/processes simultaneously. In some cases, this is a condition for their launch or correct operation. This article presents selected aspects of such a programming using the example of two proposed applications: for PC computers with the .NET platform and application designed for a computer cluster operating in the GNU/Linux system. These are two applications with different purposes – the first uses image processing mechanisms, while the second – is the implementation of precise numerical calculations. The proposed applications were designed in the context of using multithreading and multiprocessing technologies. The obtained results indicate that implementing appropriate programming techniques is an important aspect of programming various types of applications, ensuring their correct operation and acceleration of long-term calculations.
Cited by 0Open access
Birken, K., Stuttgart Univ. (Germany). Rechenzentrum, Stuttgart Univ. (Germany). Inst. fuer Computeranwendungen et al. · OpenGrey (Institut de l'Information Scientifique et Technique) · 1994
The parallel implementation of algorithms based on dynamic data structures on architectures with distributed memory access leads to various technical problems as for data redundancy, consistency and load balancing. The DDD library allows easier development of those dynamic parallel algorithms. This document contains the complete specification of the DDD library interface, including a detailed reference manual, the memory manager specification and a list of DDD errors. (orig.)
Cited by 2
Mahmut Kandemir · Istanbul Technical University Academic Open Archive (Istanbul Technical University) · 1992
Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 1992
Cited by 0
柴山悦哉, ETSUYA SHIBAYAMA · Tokyo Tech Research Repository (Tokyo Institute of Technology) · 2006
Cited by 0
Robert E. Bixby, William Cook, Alan Cox et al. · 1999
Numerical experiments for a parallel implementation of a branch-and-bound mixed 0/1 integer programming code are presented. Among its features, the code includes cutting-plane generation at the root node, and employs a new branching-variable selection rule within the search tree. The code runs on a loosely-coupled cluster of workstations using TreadMarks as the parallel software platform. Numerical tests were performed on all mixed 0/1 MIPLIB instances as well as two previously unsolved MIP instances, one arising from telecommunication networks and the other a multicommodity flow problem.
Cited by 0
Rémi Coudarcher, Jocelyn Sérot, Jean-Pierre Dérutin · 2005
Cited by 5
n.n. · 2007
Cited by 0
J. Silcock, A. Goscinski · 1997
Distributed Shared Memory (DSM) provides programmers with an environment with which they are familiar and at the same time allows them to take advantage of the increased processing power provided by a Clusters of Workstations (COW). DSM is an abstraction for shared memory on a system where the memory is physically distributed. We have integrated DSM into the RHODOS operating system to hide it from programmers rather than to put this paradigm on top of an operating system, as have other researchers. RHODOS' DSM allows programmers to write shared memory code exploiting their sequential programming skills without a need to learn concepts introduced by DSM. Furthermore, this DSM system allows programmers to use either the sequential or release consistency model for the shared memory. In this paper we report on the algorithms for six applications Red-Black Successive Over Relaxation, Matrix Multiplication, Jacobi, Quicksort, Travelling Salesman Problem and Gaussian Elimination an...
Cited by 0
1999
The Java programming language and environment is stimulating new research activities in many areas of computing, not the least of which is parallel computing. Parallel techniques are themselves finding new uses in cluster computing systems. Although there are excellent software tools for scheduling, monitoring and message-based programming on parallel clusters, these systems are not yet well integrated and do not provide very high-level parallel programming paradigm support. We have prototyped a multi-paradigm parallel programming toolkit in Java, specifically targeting an integrated approach on Beowulf-style cluster computers. Our JUMP system builds on ideas from the message-passing community as well as from distributed systems technologies. We believe our system promises high performance for parallel programming as well as integrating with meta-computing frameworks for sharing resources across administrative boundaries. The ever-improving Java development environment allows us access to a number of techniques that were not available using the message-passing systems of the past. In addition to the usual object-oriented programming benefits, these include: language reflection; a rich variety of remote and networking techniques; dynamic classloading; and code portability. Using pure Java does at present still limit performance of some applications, but we believe that as a research software system, the benefits of scoping out the design issues of a system like JUMP now, are significant. We expect Java Virtual Machine (JVM) performances to continue to improve. Our system supports the usual messaging primitives although in a more natural style for a modern object oriented program. We are using our JUMP model framework to research some of the long sought after parallel programming goals of support for parallel I/O; irregular and dynamic domain decomposition and in particular irregular mesh support.
Cited by 0
Jacques M. Bahi, Sylvain Contassot-vivier · 2004
AIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a particular class of parallel iterative algorithms. Their asynchronous nature makes them more efficient than their syn-chronous counterparts in numerous cases as has already been shown in previous works. The first goal of this article is to compare several parallel programming environments in order to see if there is one of them which is best suited to efficiently implement AIAC algorithms. The main criterion for this comparison consists in the performances achieved in a global context of grid computing for two classical scientific problems. Nevertheless, we also take into account two secondary criteria which are the ease of program-ming and the ease of deployment. The second goal of this study is to extract from this comparison the important features that a parallel programming environment must have in order to be suited for the implementation of AIAC algorithms.
Cited by 0
2008
Abstract- OmniRPC is a Grid RPC system for parallel programming in cluster and grid environments. To support typical master-worker grid applications such as a parametric execution efficiently, OmniRPC provides an automaticinitializable remote module to send and store data to a remote executable invoked in the remote host. Since it may accept several requests for subsequent calls by keeping the connection alive, the data set by the initialization is re-used, resulting in efficient execution by reducing the amount of communication. It allows to use several authentication systems including “ssh ” and “globus GRAM”. For a cluster over a private network, an agent process running the server host functions as a proxy to relay communications between the client and the remote executables by multiplexing the communications into one connection to the client. Several algorithms and applications for a grid are designed or re-targeted by using OmniRPC. In this paper, we present a parallel method for large sparse generalized eigenvalue problems, a gridenabled Molecular Conformational Space Search Program (CONFLEX-G), and a grid-enabled Heterogeneous Multi-Computer System (HMCS-G) for computational astrophysics in order to demonstrate the effectiveness of OmniRPC. Keywords—Grid computing, remote procedure call, parametric execution I.
Cited by 0
Augusto Mendes Gomes, Líria Matsumoto Sato, Francisco Isidro Massetto · 2012
The execution of parallel applications, using grid computing, requires an environment that enables them to be executed, managed, scheduled and monitored. The execution environment must provide a processing model, consisting of programming and execution models, with the objective appropriately exploiting grid computing characteristics. This paper proposes a parallel processing model, based on shared variables for grid computing, consisting of an execution model that is appropriate for the grid and a CPAR parallel language programming model. The environment is designed to execute parallel applications in grid computing, where all the characteristics present in grid computing are transparent to users. The results show that this environment is an efficient solution for the execution of parallel applications.
Cited by 1
Abdullah Öngül · Istanbul Technical University Academic Open Archive (Istanbul Technical University) · 1991
Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 1991
Cited by 0
Cc Multicomputers, Murat Atun, Ilker Cengiz et al. · 2007
. Asynchronous message handling is an approach to reduce communication delays in message passing parallel architectures. Converse is an interoperable parallel programming environment which combines asynchronous message handling and user level scheduler. It supports message-driven style of programming where messages trigger computations as opposed to explicit receive of messages in traditional messagepassing programming. In this paper, we discuss an efficient implementation of Converse environment on Parsytec CC distributed memory machines and present performance results of a few collective communication operations implemented in message-driven (using Converse) and in message passing styles. 1 Introduction The delays due to communication are the major source of performance degradation in message passing parallel computers. These delays are not only due to latencies in the communication network, a significant portion of it is due to the software overhead to handle sending and receiving ...
Cited by 0
Christopher Bryan · Journal of the Arkansas Academy of Science · 2008
The popularity of cluster computing has increased focus on usability, especially in the area of programmability. Languages and libraries that require explicit message passing have been the standard. New languages, designed for cluster computing, are coming to the forefront as a way to simplify parallel programming. Titanium and Fortress are examples of this new class of programming paradigms. This work holistically characterizes these languages and contrasts them with the standard model of parallel programming, and presents benchmark results of small computational kernels written in these languages and models.
Cited by 0Open access
Xu Yang, Deyuan Guo, Hu He et al. · Advanced Science Engineering and Medicine · 2013
Cited by 0
Gerhard Venter, Garret N. Vanderplaats · Journal of Aerospace Computing Information and Communication · 2009
A parallel, filter-based, sequential quadratic programming algorithm is implemented and tested for typical general-purpose engineering applications. Constrained engineering test problems, including a finite element simulation, with up to 512 design variables are considered.Theaccuracyandserialperformanceofthefilter-basedalgorithmarecomparedagainst that of a standard sequential quadratic programming algorithm. The parallel performance of the algorithm is evaluated, using up to 52 cores on a Linux Cluster. The results indicate that thefilter-based algorithm competes favorably with a standard sequential quadratic programming algorithm in a serial environment. However, the filter-based algorithm exhibits much better parallel efficiency due to the lack of a one-dimensional search.
Cited by 2
C. Clémençon, A. Endo, J. Fritscher et al. · 1995
We are currently developing a portable integrated tool environment for distributed-memory parallel processors (DMPPs) as part of the Joint CSCS--ETH/NEC Collaboration in Parallel Processing. As we design and implement a sequence of tool prototypes these are used and evaluated by a team of application developers. This close interaction allows rapid feedback, as requests from the applicationdevelopers for functionality enhancements can be promptly considered for inclusion in future tool designs and prototypes. Our tool environment consists of an extended High Performance Fortran (HPF) compiler, a performance monitor and analyzer, and a source-level debugger for distributed programs, all sharing a common user-interface. The recently-defined Message Passing Interface (MPI) serves as our low-level machine interface and allows portability independent of the target hardware architecture. The key features of the tool environment comprise HPF language extensions to allow dynamic data distribut...
Cited by 0
Shinichi Yamagiwa · International Journal of Networking and Computing · 2012
Multicore/manycore architecture accelerates demand for a new programming environment to utilize the massive processors integrated in an LSI. GPU (Graphics Processing Unit) is one of the typical hardware environments. The programming environments on GPU are traditionally vendor-/hardware-specific, where complicate the management of uniform programs that access computing resources of the massively parallel platform. The recently released OpenCL is expected to become a standard for providing a uniform programming environment for the heterogeneous processors from different vendors. This tutorial paper introduces the overview of the OpenCL that motivates the programmers who are going to program the massively parallel hardware or who migrates the programming method from another vendor specific programming interface to the OpenCL. This paper explains the characteristics of the OpenCL interface with describing in detail the basic structures used in the program. Moreover, this paper discusses performance aspects to evaluate advanced programming techniques that improve the performance of the OpenCL applications.
Cited by 5Open access