Effectiveness of Dynamic Prefetching in Multiple-Writer Distributed Virtual Shared-Memory Systems

Karlsson, Magnus; Stenström, Per

doi:10.1006/jpdc.1997.1333

Cited by 19 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further, none of the studies evaluate the effects of prefetching or migratory optimization. Karlsson and Stenstro m proposed to include prefetching techniques in an SVM system on top of a network of SMP clusters [25]. The prefetching schemes managed to cut the overall execution times to some extent but it is not clear how much the protocol overhead limited further gains.…”

Section: Discussion and Generalizationsmentioning

confidence: 99%

Comparative Evaluation of Latency-Tolerating and -Reducing Techniques for Hardware-Only and Software-Only Directory Protocols

Grahn¹,

Stenström²

2000

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

Section: Discussion and Generalizationsmentioning

confidence: 99%

Comparative Evaluation of Latency-Tolerating and -Reducing Techniques for Hardware-Only and Software-Only Directory Protocols

Grahn¹,

Stenström²

2000

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

“…Prefetching should be avoided in case of weak data analysis. In [6], M. Karlsson and P. Stenström propose a technique where prefetching is decided after analyzing the recent requests from the application. Such a pure run-time technique does not depend on the analysis ability of the compilers.…”

Section: Data Prefetchmentioning

confidence: 99%

Controlling Distributed Shared Memory Consistency from High Level Programming Languages

Jégou

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

One of the keys for the success of parallel processing is the availability of high-level programming languages for on-the-shelf parallel architectures. Using explicit message passing models allows efficient executions. However, direct programming on these execution models does not give all benefits of high-level programming in terms of software productivity or portability. HPF avoids the need for explicit message passing but still suffers from low performance when the data accesses cannot be predicted with enough precision at compile-time. OpenMP is defined on a shared memory model. The use of a distributed shared memory (DSM) has been shown to facilitate high-level programming languages in terms of productivity and debugging. But the cost of managing the consistency of the distributed memories limits the performance. In this paper, we show that it is possible to control the consistency constraints on a DSM from compile-time analysis of the programs and so, to increase the efficiency of this execution model.

show abstract

Transparent adaptation of sharing granularity in MultiView‐based DSM systems

Niv

Schuster

2001

Softw Pract Exp

View full text Add to dashboard Cite

In this paper we propose a mechanism that provides distributed shared memory (DSM) systems with a flexible sharing granularity. The size of the shared memory units is dynamically determined by the system during runtime. This size can range from that of a single variable up to the size of the entire shared memory space. During runtime, the DSM transparently adapts the granularity to the memory access pattern of the application in each phase of its execution. This adaptation, called ComposedView, provides efficient data sharing in software DSM while preserving sequential consistency. Neither complex code analysis nor annotation by the programmer or the compiler are required. Our experiments indicate a substantial performance boost (up to 80% speed‐up improvement) when running a large set of applications using our method, compared to running these benchmark applications with the best fixed granularity. Copyright © 2001 John Wiley & Sons, Ltd.

show abstract

Effectiveness of Dynamic Prefetching in Multiple-Writer Distributed Virtual Shared-Memory Systems

Cited by 19 publications

References 25 publications

Comparative Evaluation of Latency-Tolerating and -Reducing Techniques for Hardware-Only and Software-Only Directory Protocols

Comparative Evaluation of Latency-Tolerating and -Reducing Techniques for Hardware-Only and Software-Only Directory Protocols

Controlling Distributed Shared Memory Consistency from High Level Programming Languages

Transparent adaptation of sharing granularity in MultiView‐based DSM systems

Contact Info

Product

Resources

About