Distributed Shared Memory: A Survey of Issues and Algorithms
Computer - Distributed computing systems: separate resources acting as one
Sprint: a middleware for high-performance transaction processing
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Tashkent+: memory-aware load balancing and update filtering in replicated databases
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
The end of an architectural era: (it's time for a complete rewrite)
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Middleware-based database replication: the gaps between theory and practice
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
Current trends in main memory capacity and cost indicate that in a few years most performance-critical applications will have all (or most of) their data stored in the main memory of the nodes of a small-size cluster. A few recent research papers have pointed this out and proposed architectures taking advantage of clustered environments aggregating powerful processors equipped with large main memories. This position paper proposes yet another approach, which builds on Distributed Shared Memory systems (DSMs) introduced in the early 80's. We introduce the idea of the dsmDB, discuss how its architecture could be organized, and elaborate on some of its algorithms. We conclude the paper with a discussion of some of its advantages and drawbacks.