Solving problems on concurrent processors
Solving problems on concurrent processors
The Amber system: parallel programming on a network of multiprocessors
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Munin: distributed shared memory based on type-specific memory coherence
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Vector quantization and signal compression
Vector quantization and signal compression
SoftFLASH: analyzing the performance of clustered distributed virtual shared memory
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Cashmere-2L: software coherent shared memory on a clustered remote-write network
Proceedings of the sixteenth ACM symposium on Operating systems principles
Portable Programs for Parallel Processors
Portable Programs for Parallel Processors
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Implementation of Page Management in Mome,a User-Level DSM
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
The Performance Model of SilkRoad - A Multithreaded DSM System for Clusters
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Making a DSM Consistency Protocol Hierarchy-Aware: an Efficient Synchronization Scheme
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
SilkRoad II: A Multi-Paradigm Runtime System for Cluster Computing
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
Home-Based SVM Protocols for SMP Clusters: Design and Performance
HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
Fine-Grain Software Distributed Shared Memory on SMP Clusters
HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
Strings: A High-Performance Distributed Shared Memory for Symmetrical Multiprocessor Clusters
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
Cilk: efficient multithreaded computing
Cilk: efficient multithreaded computing
SilkRoad II: mixed paradigm cluster computing with RC_dag consistency
Parallel Computing
Brazos: a third generation DSM system
NT'97 Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997
A multi-layer resource reconfiguration framework for grid computing
Proceedings of the 4th international workshop on Middleware for grid computing
A grid-enabled software distributed shared memory system on a wide area network
Future Generation Computer Systems
Achieving causal and total ordering in publish/subscribe middleware with DSM
Proceedings of the 3rd workshop on Middleware for service oriented computing
Memory-Mapped File Approach for On-Demand Data Co-allocation on Grids
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Exposing non-standard architectures to embedded software using compile-time virtualisation
CASES '09 Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems
A DSM-based fragmented data sharing framework for grids
Future Generation Computer Systems
Ordenação de eventos baseada em DSM para middlewares publish/subscribe
Companion Proceedings of the XIV Brazilian Symposium on Multimedia and the Web
Hi-index | 0.00 |
A transparent distributed shared memory (DSM) system must achieve complete transparency in data distribution, workload distribution, and reconfiguration respectively. The transparency of data distribution allows programmers to be able to access and allocate shared data using the same user interface as is used in shared-memory systems. The transparency of workload distribution and reconfiguration can optimize the parallelism at both the user-level and the kernel-level, and also improve the efficiency of run-time reconfiguration. In this paper, a transparent DSM system referred to as Teamster is proposed and is implemented for clustered symmetric multiprocessors. With the transparency provided by Teamster, programmers can exploit all the computing power of the clustered SMP nodes in a transparent way as they do in single SMP computer. Compared with the results of previous researches, Teamster can realize the transparency of cluster computing and obtain satisfactory system performance.