The aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is part of an ongoing project to deve...
详细信息
The aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is part of an ongoing project to develop algorithms for the design of quasi-optimal query execution plans for parallel database systems. We try to concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. We believe that a meaningful model can be built upon only three characteristic parameter sets, describing main memory size, the I/O bandwidth and the disk bandwidth. We justify our approach by a practical implementation and a comparison of the theoretical and real performance values.
The negotiation process is a necessary precondition for many wide-area based applications which involve interactions across multiple autonomous entities. In the case where database resources are explicitly exposed to ...
详细信息
ISBN:
(纸本)0769520693
The negotiation process is a necessary precondition for many wide-area based applications which involve interactions across multiple autonomous entities. In the case where database resources are explicitly exposed to the distributed computing context like the Grid, it is necessary for unauthorized database users to get authorized so that they can be granted with certain privileges to access the desirable database resources. The facility to establish a legal identity for database user is one of the functionalities that the database resource management framework should provide. In this paper, we give a handshaking protocol which is applied between database clients and database service providers to achieve the database-specific negotiation. It's a six-phased protocol, which is described in terms of service operations in our database resource management middleware, which is an OGSA compliant service-based system.
A table-driven approach for designing industrial strength cache coherence protocols based on relational database technology is described. Protocols are specified using several interacting multi-input, multi-output con...
详细信息
A table-driven approach for designing industrial strength cache coherence protocols based on relational database technology is described. Protocols are specified using several interacting multi-input, multi-output controller state machines represented as database tables. Protocol scenarios specified using SQL constraints are solved to automatically generate database tables, and to statically check protocol properties including absence of deadlocks and other protocol invariants. The debugged tables are mapped to hardware using SQL operations while preserving protocol properties. The approach is deployed at Fujitsu System Technology Division in the design of their next generation multiprocessor and has discovered several errors early in the design cycle.
This paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital libraries, distributed caching systems, e...
详细信息
This paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital libraries, distributed caching systems, etc. The framework is based on the concept of neighborhood; each client keeps a list of the most beneficial sites according to past experience, which are visited first when the client searches for some particular content. Exploration methods continuously update the neighborhoods in order to follow changes in access patterns. Depending on the application, several variations of search and exploration processes are proposed. Experimental evaluation demonstrates the benefits of the framework in different scenarios.
In this paper, we discuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an asympto...
详细信息
In this paper, we discuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an asymptotically optimal multi-round algorithm. This multi-round algorithm automatically performs resource selection, a difficult task that was previously left to the user. Because it is periodic, it is simpler to implement, and more robust to changes in the speeds of the processors and/or communication links. On the theoretical side, to the best of our knowledge, this is the first published result assessing the absolute performance of a multi-round algorithm. On the practical side, extensive simulations reveal that our multi-round algorithm outperforms existing solution on a large variety of platforms, especially when the communication-to-computation ratio is not very high (the difficult case).
We present a numerical study of several parallel algebraic preconditioners, which speed up the convergence of Krylov iterative methods when solving large-scale linear systems. The studied algebraic preconditioners are...
详细信息
We present a numerical study of several parallel algebraic preconditioners, which speed up the convergence of Krylov iterative methods when solving large-scale linear systems. The studied algebraic preconditioners are of two types. The first type includes simple block preconditioners using incomplete factorizations or preconditioned Krylov solvers on the subdomains. The second type is an enhancement of the first type in that Schur complement techniques are added to treat subdomain-interface unknowns. The numerical experiments show that the scalability properties of the preconditioners are highly problem dependent, and a simple Schur complement technique is favorable for achieving good overall efficiency.
As software distributed Shared Memory(DSM) systems become attractive on larger clusters, the focus of attention moves toward improving the reliability of systems. In this paper, we propose a lightweight logging scheme...
详细信息
ISBN:
(纸本)0769520693
As software distributed Shared Memory(DSM) systems become attractive on larger clusters, the focus of attention moves toward improving the reliability of systems. In this paper, we propose a lightweight logging scheme, called remote logging, and a recovery protocol for home-based DSM. Remote logging stores coherence-related data to the volatile memory of a remote node. The logging overhead can be moderated with high-speed system area network and user-level DMA operations supported by modern communication protocols. Remote logging tolerates multiple failures if the backup nodes of failed nodes are alive. It makes the reliability of DSM grow much higher. Experimental results show that our fault-tolerant DSM has low overhead compared to conventional stable logging and it can be effectively recovered from some concurrent failures.
Computational Grids are emerging as a new infrastructure for Internet-based parallel and distributed computing. They enable the sharing, exchange, discovery, and aggregation of resources distributed across multiple ad...
详细信息
Computational Grids are emerging as a new infrastructure for Internet-based parallel and distributed computing. They enable the sharing, exchange, discovery, and aggregation of resources distributed across multiple administrative domains, organizations and enterprises. To accomplish this, Grids need infrastructure that supports various services: security, uniform access, resource management, scheduling, application composition, computational economy, and accounting. Although several initiatives are engaged in the development of Grid technologies, Grid accounting issues are yet to be addressed. To overcome this limitation, we propose a new infrastructure called GridBank that provides services for accounting. The support of computational economy and accounting services can lead to a self-regulated accountability in Grid computing. This paper presents requirements of Grid accounting and different economic models within which it can operate and proposes a Grid Accounting Services Architecture to meet them. The paper highlights implementation issues with a detailed discussion on the format for various records/databases that the GridBank needs to maintain. It also presents protocols for interaction between the GridBank and various components within Grid computing environments.
暂无评论