M. G. Norman, T. Zurek, and P. Thanisch. Much Ado About Shared-Nothing. SIGMOD Record, 25(3), 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Load Balanced Query Evaluation in Shared-Everything.. - Manegold, Obermaier, Waas (1996) (Correct)
....to saturate further performance requirements of high end mission critical database applications multiple of shared everything servers can be connected with a fast network. This combines the benefits of shared everything systems with the scalability of a shared nothing or shareddisk system [20]. So far, query optimization for such hybrid platforms is still an unsolved problem due to its complexity. DTE R as an execution strategy on the shared everything components of hybrid systems simplifies this problem significantly. DTE R can be a building block to a more comprehensive solution of ....
M. G. Norman, T. Zurek and P. Thanisch. Much ado about shared-nothing. ACM SIGMOD Record, Volume 25, Number 3, September 1996.
Memory Aware Query Scheduling in a Database Cluster - Waas, Kersten (2000) (1 citation) (Correct)
....gains. Moreover, parallel processing as outlined above scales only for small numbers of nodes effectively. In shared nothing architectures, network contention becomes increasingly a bottleneck; in the case of shared everything, the high degree of resource sharing limits the scaling [Sto86, NZT96] General memory allocation issues have been explored extensively with respect to various aspects of query processing. In [MD93] authors proposed dynamic memory allocation schemes for multi query workload to level memory allocation without sharing resident data among di erent queries. By ....
M. G. Norman, T. Zurek, and P. Thanisch. Much Ado About Shared-Nothing. ACM SIGMOD Record, 25(3):16-21, September 1996.
Multi-Resource Parallel Query Scheduling and Optimization - Garofalakis, Ioannidis (Correct)
....1 Introduction Parallelism has been recognized as a powerful and cost effective means of handling the projected increases in data size and query complexity in future database applications. Among all proposals, the sharednothing [DG92] and, recently, the more general hierarchical (or, hybrid) NZT96, BFV96] multiprocessor architectures have emerged as the most scalable to support very large database management. In these systems, each site consists of its own set of local resources and communicates with other sites only by message passing (Figure 1) Despite the popularity of these ....
Michael G. Norman, Thomas Zurek, and Peter Thanisch. "Much Ado About Shared-Nothing". ACM SIGMOD Record, 25(3):16--21, September 1996.
Efficient Termination Detection for Asynchronous Parallel.. - Nabeel Al-Fayoumi (Correct)
....is superior in many cases to ad hoc solutions such as polling processors periodically to see if they are done, because it is simple, efficient, and has fast response time. Simulation results show that the scheme has low overhead. 1 Introduction In a shared nothing parallel computer system [8, 11], each processor has its own memory and hard disk units, and different processors in the system communicate via message passing. In this paper we address the problem of testing for termination of a parallel computation on this type of machine when the computation is asynchronous, i.e. when control ....
M. G. Norman. Much ado about shared-nothing. In Proceedings of the ACM SIGMOD International Conference on Management of Data, volume 25, pages 16--22, Sept. 1996.
Scalability of Platforms for Data Warehouse Applications - Thanisch, Norman Self-citation (Norman Thanisch) (Correct)
....characteristics of commercially available parallel DBMS products. In the past, experts have distinguished between such systems on the basis of hardware resource sharing. We have argued that the simple shared disk vs sharednothing distinction is not helpful in differentiating between products [2]. We have developed a new generic model of parallel DBMS King s Buildings, JCMB, Edinburgh EH9 3JZ, Scotland, Tel. 44 131 6505133, Fax 44 131 6677209, Email: pt dcs.ed.ac.uk architectures in order to categorise parallel DBMS products [3] This model is based on the way that processes and ....
M. Norman, T. Zurek, and P. Thanisch. Much ado about shared-nothing. ACM SIGMOD Record, 25(3):16--21, 1996.
Parallel Querying with Non-Dedicated Computers - Vijayshankar Raman Wei (2005) (Correct)
No context found.
M. G. Norman, T. Zurek, and P. Thanisch. Much Ado About Shared-Nothing. SIGMOD Record, 25(3), 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC