Results 1 - 10 of 159

Supporting SPMD Execution for Dynamic Data Structures

by Anne Rogers, John H. Reppy, Laurie J. Hendren - In Languages and Compilers for Parallel Computing. 5th International Workshop Proceedings , 1992
"... In this paper, we address the problem of supporting SPMD execution of programs that use recursively-defined dynamic data structures on distributed memory machines. The techniques developed for supporting SPMD execution of array-based programs rely on the fact that arrays are statically defined and d ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
In this paper, we address the problem of supporting SPMD execution of programs that use recursively-defined dynamic data structures on distributed memory machines. The techniques developed for supporting SPMD execution of array-based programs rely on the fact that arrays are statically defined

Synchronization Minimization in a SPMD Execution Model

by F. Bodin, L. Kervella, M. O'Boyle , 1995
"... : This paper presents an algorithm for synchronization placement when using a SPMD execution model, where synchronizations are enforced only when there exists a cross-processor dependence. In this paper we investigate two scheduling techniques, loop based and data based, both of which use an SPMD mo ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
: This paper presents an algorithm for synchronization placement when using a SPMD execution model, where synchronizations are enforced only when there exists a cross-processor dependence. In this paper we investigate two scheduling techniques, loop based and data based, both of which use an SPMD

A Compiler-Assisted Approach to SPMD Execution

by Ron Cytron Jim, Jim Lipkis T, Edith Schonberg T - In Proceedings of Supercomputing '90 , 1990
"... Today, two styles of scientific parallel programming prevail. In the SPMD style, all processors execute the same program, with sequential code executed redundantly and parallel code executed cooperatively. ..."
Abstract - Add to MetaCart
Today, two styles of scientific parallel programming prevail. In the SPMD style, all processors execute the same program, with sequential code executed redundantly and parallel code executed cooperatively.

SPMD Execution in the Presence of Dynamic Data Structures

by Rajiv Gupta - IN COMPILER OPTIMIZATIONS FOR SCALABLE PARALLEL SYSTEMS LANGUAGES , 2001
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

Correlation of the Paging Activity of Individual Node Programs in the SPMD Execution Mode

by unknown authors
"... In this paper we introduce a methodology for the anal-ysis of the paging activity of parallel programs running on massively parallel systems. The methodology includes par-allel program monitoring and the analysis of the collected data. We study the correlation of the paging activities of in-dividual ..."
Abstract - Add to MetaCart
-dividual node programs in the SPMD execution mode and its effect on scheduling. 1

Correlation of the Paging Activity of Individual Node Programs in the SPMD Execution Mode

by Kuei Yu, Dan C. Marinescu - In Proceedings of the Hawaii International Conference on System Sciences , 1995
"... In this paper we introduce a methodology for the analysis of the paging activity of parallel programs running on massively parallel systems. The methodology includes parallel program monitoring and the analysis of the collected data. We study the correlation of the paging activities of individual no ..."
Abstract - Add to MetaCart
node programs in the SPMD execution mode and its effect on scheduling. 1 Introduction Massively parallel systems (MPPs) are viewed today as expensive scientific and engineering instruments. Their primary use is in the area of numeric simulation of complex physical phenomena. The performance

SPMD Execution of Programs with Pointer-based Dynamic Data Structures

by Rajiv Gupta - Journal of parallel and distributed computing , 1992
"... This paper discusses an approach for supporting SPMD (single-program, multiple-data) execution of programs with pointer-based data structures on distributed-memory machines. Through a combination of language design and new compilation techniques, static and dynamic implicit parallelism present in ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
This paper discusses an approach for supporting SPMD (single-program, multiple-data) execution of programs with pointer-based data structures on distributed-memory machines. Through a combination of language design and new compilation techniques, static and dynamic implicit parallelism present

AN ANALYSIS OF THE PAGING ACTIVITY OF PARALLEL PROGRAMS Part 1. Correlation of the Paging Activity of Individual Node Programs in the SPMD Execution Mode

by Purdue E-pubs, Kuei Yu Wang, Dan C. Marinescu, Reuei Yu Wang, Dan C. Marinescu, Kuei Yu Wang, Dan C. Marinescut , 1994
"... In this paper we introduce a mdhodology for the analysis of the paging activity of parallel programs running on massively parallel systems. In the first part of this paper, we study the correlation of the paging activities of individual node programs in the SPMD execution mode and its effect on sche ..."
Abstract - Add to MetaCart
In this paper we introduce a mdhodology for the analysis of the paging activity of parallel programs running on massively parallel systems. In the first part of this paper, we study the correlation of the paging activities of individual node programs in the SPMD execution mode and its effect

G.: Exploiting spmd horizontal locality

by Chunyang Gou , Georgi N Gaydadjiev - IEEE Comput. Archit. Lett , 2011
"... Abstract- In this paper, we analyze a particular spatial locality case (called horizontal locality ) inherent to manycore accelerator architectures employing barrel execution of SPMD kernels, such as GPUs. We then propose an adaptive memory access granularity framework to exploit and enforce the ho ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract- In this paper, we analyze a particular spatial locality case (called horizontal locality ) inherent to manycore accelerator architectures employing barrel execution of SPMD kernels, such as GPUs. We then propose an adaptive memory access granularity framework to exploit and enforce

SPMD Parallelization of Arbitrary Doacross Loops

by Emmanuel Melin, Emmanuel Melin, Bruno Raffin, Bruno Raffin, Xavier Rebeuf, Xavier Rebeuf, Bernard Virot, Bernard Virot
"... To reach high performances on massively parallel machines, optimizing compilers have to treat very efficiently all loop-level parallelism. Irregular control and irregular data accesses commonly appear in realistic scientific applications. Moreover many programs involve loops with cross-iteration dat ..."
Abstract - Add to MetaCart
based on structural clocks. Keywords: Automatic parallelization; Doacross Execution; Parallel Programming Languages; Asynchronous Data-Parallel Execution; Structural Clock; Irregular Algorithm. Citation : This Research Report is the preprint version of an article currently submitted to the Europar
Results 1 - 10 of 159