Coarse-grained thread pipelining: a speculative parallel execution model for shared-memory multiprocessors

2001 ◽  
Vol 12 (9) ◽  
pp. 952-966 ◽  
Author(s):  
I.H. Kazi ◽  
D.J. Lilja
Keyword(s):  
Shared Memory ◽  
Parallel Execution ◽  
Coarse Grained ◽  
Shared Memory Multiprocessors ◽  
Execution Model

Shared memory multiprocessor support for functional array processing in SAC

2005 ◽  
Vol 15 (3) ◽  
pp. 353-401 ◽  
Author(s):  
CLEMENS GRELCK
Keyword(s):  
Shared Memory ◽  
Array Processing ◽  
Numerical Data ◽  
Parallel Execution ◽  
Real Performance ◽  
Execution Model ◽  
Series Of Experiments ◽  
High Level ◽  
Performance Gains ◽  
The Impact

Classical application domains of parallel computing are dominated by processing large arrays of numerical data. Whereas most functional languages focus on lists and trees rather than on arrays, SAC is tailor-made in design and in implementation for efficient high-level array processing. Advanced compiler optimizations yield performance levels that are often competitive with low-level imperative implementations. Based on SAC, we develop compilation techniques and runtime system support for the compiler-directed parallel execution of high-level functional array processing code on shared memory architectures. Competitive sequential performance gives us the opportunity to exploit the conceptual advantages of the functional paradigm for achieving real performance gains with respect to existing imperative implementations, not only in comparison with uniprocessor runtimes. While the design of SAC facilitates parallelization, the particular challenge of high sequential performance is that realization of satisfying speedups through parallelization becomes substantially more difficult. We present an initial compilation scheme and multi-threaded execution model, which we step-wise refine to reduce organizational overhead and to improve parallel performance. We close with a detailed analysis of the impact of certain design decisions on runtime performance, based on a series of experiments.

Parallel execution of prolog on shared-memory multiprocessors

1993 ◽  
Vol 8 (4) ◽  
pp. 329-336
Author(s):  
Yaoqing Gao ◽  
Dingxing Wang ◽  
Weimin Zheng ◽  
Meiming Shen ◽  
Zhiyi Huang ◽  
...  
Keyword(s):  
Shared Memory ◽  
Parallel Execution ◽  
Shared Memory Multiprocessors

Benefits of cache-affinity scheduling in shared-memory multiprocessors

1993 ◽  
Vol 21 (1) ◽  
pp. 272-274 ◽  
Author(s):  
Josep Torrellas ◽  
Andrew Tucker ◽  
Anoop Gupta
Keyword(s):  
Shared Memory ◽  
Shared Memory Multiprocessors ◽  
Cache Affinity

A parallel execution model of logic programs

1983 ◽  
Vol 11 (3) ◽  
pp. 349-355 ◽  
Author(s):  
Shinji Umeyama ◽  
Koichiro Tamura
Keyword(s):  
Parallel Execution ◽  
Logic Programs ◽  
Execution Model
Sign in / Sign up

Export Citation Format

Share Document