Results 1 - 10
of
41
Distributed pC++: Basic Ideas for an Object Parallel Language
- Scientific Programming
"... pC++ is an object-parallel extension to the C++ programming language. This paper describes the current language definition and illustrates the programming style. Examples of parallel linear algebra operations are presented and a fast poisson solver is described in complete detail. ..."
Abstract
-
Cited by 109 (2 self)
- Add to MetaCart
pC++ is an object-parallel extension to the C++ programming language. This paper describes the current language definition and illustrates the programming style. Examples of parallel linear algebra operations are presented and a fast poisson solver is described in complete detail.
A Recoverable Distributed Shared Memory Integrating Coherence and Recoverability
, 1995
"... Large-scale distributed systems are very attractive for the execution of parallel applications requiring a huge computing power. However, their high probability of site failure is unacceptable, especially for long time running applications. In this paper, we address this problem and propose a checkp ..."
Abstract
-
Cited by 47 (4 self)
- Add to MetaCart
Large-scale distributed systems are very attractive for the execution of parallel applications requiring a huge computing power. However, their high probability of site failure is unacceptable, especially for long time running applications. In this paper, we address this problem and propose a checkpointing mechanism relying on a recoverable distributed shared memory (DSM) in order to tolerate single node failures. Although most recoverable DSMs require specific hardware to store recovery data, our scheme uses standard memories to store both current and recovery data. Moreover, the management of recovery data is merged with the management of current data by extending the DSM's coherence protocol. This approach takes advantage of the data replication provided by a DSM in order to limit the amount of transferred pages during the checkpointing. The paper also presents an implementation and a preliminary performance evaluation of our recoverable DSM on a 56 nodes Intel Paragon. 1 Introducti...
Fortran-S: A Fortran Interface for Shared Virtual Memory. . .
- In Supercomputing'93
, 1993
"... : In this paper we present a new programming environment for distributed memory parallel computers consisting in a Fortran 77 compiler enhanced with directives to specify parallelism. These directives are used to specify shared data structures and parallel loops. Shared data structures are implement ..."
Abstract
-
Cited by 30 (12 self)
- Add to MetaCart
(Show Context)
: In this paper we present a new programming environment for distributed memory parallel computers consisting in a Fortran 77 compiler enhanced with directives to specify parallelism. These directives are used to specify shared data structures and parallel loops. Shared data structures are implemented using the KOAN shared virtual memory that is available on an Intel iPSC/2 computer. Preliminary results obtained with the first prototype of the compiler are presented. Fortran-S: Une interface Fortran pour des architectures `a m'emoire virtuelle partag'ee R'esum'e : Nous pr'esentons dans ce papier, un environnement de programmation pour des architectures parall`eles `a m'emoire distribu'ee constitu'e autour d'un compilateur Fortran et d'un ensemble d'annotations. Celles-ci permettent de sp'ecifier quelles sont les structures de donn'ees partag'ees et les boucles parall`eles. Les structures de donn'ees partag'ees sont g'er'ees par le syst`eme de m'emoire virtuelle partag'ee KOAN impl'e...
Overview of parallel photorealistic graphics. Eurographics 98 State of the Art Reports
, 1998
"... ..."
Virtual Shared Memory: A Survey of Techniques and Systems
, 1992
"... Shared memory abstraction on distributed memory hardware has become very popular recently. The abstraction can be provided at various levels in the architecture e.g. hardware, software, employing special mechanisms to maintain coherence of data. In this paper we present a survey of basic techniques ..."
Abstract
-
Cited by 19 (1 self)
- Add to MetaCart
(Show Context)
Shared memory abstraction on distributed memory hardware has become very popular recently. The abstraction can be provided at various levels in the architecture e.g. hardware, software, employing special mechanisms to maintain coherence of data. In this paper we present a survey of basic techniques and review a large number of architectures that provide such an abstraction. We also propose new terminology which is more consistent and orderly as compared with the existing use of terminology for such architectures. 1 Introduction Virtual Shared Memory (VSM) in its most general sense refers to a provision of a shared address space on distributed memory hardware. Such architectures contain no physically shared memory. Instead the distributed local memories collectively provide a virtual address space shared by all the processors. VSM combines the benefits of the ease of programming found in shared-memory multiprocessors with the scalability of message-passing multiprocessors. The implemen...
An Efficient and Scalable Approach for Implementing Fault Tolerant DSM Architectures
, 1997
"... Distributed Shared Memory (DSM) architectures are attractive to execute high performance parallel applications. Made up of a large number of components, these architectures have however a high probability of failure. We propose a protocol to tolerate node failures in two classes of dsm architectures ..."
Abstract
-
Cited by 16 (5 self)
- Add to MetaCart
Distributed Shared Memory (DSM) architectures are attractive to execute high performance parallel applications. Made up of a large number of components, these architectures have however a high probability of failure. We propose a protocol to tolerate node failures in two classes of dsm architectures: Cache Only Memory Architectures (coma) and Distributed Virtual Shared Memory (svm) systems. The proposed solution is based on backward error recovery and consists of an extension to the existing coherence protocols to manage data used by processors for the computation and recovery data, used for fault tolerance. The implementation of the protocol in a coma architecture has been evaluated by simulation. The protocol has also been implemented in a svm system on a network of workstations. Both simulation results and measurements show that our solution is efficient and scalable.
On Distributed Object Checkpointing and Recovery
- In Proceedings of the ACM Symposium on Principles of Distributed Computing
, 1995
"... Recovery by checkpointing on distributed shared memory systems is investigated in this paper. The notion of consistent global states on a sequentially consistent shared memory system is defined. We investigate how consistent checkpoints can be obtained in these systems. In addition, a novel lazy che ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
(Show Context)
Recovery by checkpointing on distributed shared memory systems is investigated in this paper. The notion of consistent global states on a sequentially consistent shared memory system is defined. We investigate how consistent checkpoints can be obtained in these systems. In addition, a novel lazy checkpointing approach is proposed. It allows a controlled degree of concurrency and, at the same time, limits the amount of rollback propagation during recovery. Correctness requirements for efficient checkpointing are explored first and algorithms satisfying the requirements are developed subsequently. Several interesting properties of checkpointing on distributed shared memory systems are discovered. In particular, we show that for low levels of laziness, one can achieve better concurrency with more stable storage. 1 Introduction Among various programming paradigms, shared memory programming is relatively easier because of its good abstraction of communication and synchronization. Low cost...
Overview of the KOAN Programming Environment for the iPSC/2 and Performance evaluation of the BECAUSE Test Program 2.5.1
- In Because Workshop
, 1992
"... In this paper, we describe a Fortran programming environment using the KOAN Shared Virtual Memory. We then discuss its use for parallelizing a Because benchmark application. R'esum'e Nous pr'esentons dans ce papier, un environnement de programmation Fortran utilisant la m'emo ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
(Show Context)
In this paper, we describe a Fortran programming environment using the KOAN Shared Virtual Memory. We then discuss its use for parallelizing a Because benchmark application. R'esum'e Nous pr'esentons dans ce papier, un environnement de programmation Fortran utilisant la m'emoire virtuelle partag'ee KOAN. Celui-ci a 'et'e utilis'e pour parall'eliser une application appartenant aux programmes tests Because. 1 Introduction Since few years, the shared virtual memory (SVM) paradigm has drawn considerable attention. The basic idea of such a concept is to hide the underlying architecture of distributed memory parallel computers (DMPCs) by providing a virtual address space to the user. DMPC could be thus programmed as more conventional shared memory parallel computers. Unfortunately, few experiments have been done to show the effectiveness of SVM on DMPCs. This work is partially supported by Intel SSD under contract no. 1 92 C 250 00 31318 01 2 1 The KOAN project has been set up to inv...
A DVSM server for MESHIX
- In Symposium on Experiences with Distributed and Multiprocessor Systems III
, 1991
"... This report describes the implementation of distributed virtual shared memory (DVSM) on the Topsy multicomputer. The Topsy machine is a distributed memory multiprocessor based on MC68030 nodes connected by a custom circuit-switched mesh interconnection network (MeshNet), and runs the Meshix operatin ..."
Abstract
-
Cited by 8 (6 self)
- Add to MetaCart
(Show Context)
This report describes the implementation of distributed virtual shared memory (DVSM) on the Topsy multicomputer. The Topsy machine is a distributed memory multiprocessor based on MC68030 nodes connected by a custom circuit-switched mesh interconnection network (MeshNet), and runs the Meshix operating system which is Unix System V compatible. The DVSM allows distributed processes to share a paged virtual memory region, whose coherence is maintained by user-level servers using the dynamic distributed manager algorithm. The DVSM implementation is described at the user, server and kernel level, and an overview of the relevant parts of the Meshix operating systems is also given. A subsequent document will describe performance testing of the system. 1 Introduction In this report we describe the design and implementation of distributed virtual shared memory (DVSM) on the Topsy multicomputer [1]. DVSM provides the functionality of shared memory within the virtual memory structure of loosely c...
