Polling is the process in which an issuing node of a communication network (polling station) broadcasts a query to every other node in the network and must receive a unique response from each of them. Polling can be t...
详细信息
Polling is the process in which an issuing node of a communication network (polling station) broadcasts a query to every other node in the network and must receive a unique response from each of them. Polling can be thought as a combination of broadcasting and gathering and finds wide applications in the control of distributedsystems. In this paper we consider the problem of polling in minimum time. We give a general lower bound on the minimum number of time units to accomplish polling in any network and we present optimal polling algorithms for several classes of graphs, including hypercubes and recursively decomposable Cayley graphs.< >
This paper defines a formal classification of multi-database languages into five levels of database integration with increasing degree of global control and decreasing degree of local autonomy. First, the fundamental ...
详细信息
This paper defines a formal classification of multi-database languages into five levels of database integration with increasing degree of global control and decreasing degree of local autonomy. First, the fundamental interoperability mechanisms are identified for each of these levels. Their consequences on local autonomy as well as implementation drawbacks are discussed. second, various multi-database languages are classified into these categories. In addition to COOL*, other proposals are analyzed, including SQL*Net, Multibase, Superviews, VODAK, Pegasus, and O*SQL.< >
Communication overhead is one of the main factors that can limit the speedup of parallel programs on message-passing parallel architectures. This limiting factor is more predominant in distributedsystems such as clus...
详细信息
Communication overhead is one of the main factors that can limit the speedup of parallel programs on message-passing parallel architectures. This limiting factor is more predominant in distributedsystems such as clusters of homogeneous or heterogeneous workstations. However, excessive communication overhead can be reduced by redundantly executing some of the tasks of a parallel program on which other tasks critically depend. We study the problem of duplication-based static scheduling of parallel programs on parallel and distributedsystems. Previous duplication-based scheduling algorithms assumed the availability of unlimited number of homogeneous processors. We consider more practical scenarios: when the number of processors is limited, and when the system consists of heterogeneous computers. For the first scenario, we propose an algorithm which minimizes the execution of a parallel program by controlling the level of duplication according to the number of processors available. For the second scenario, we design an algorithm which simultaneously exploits duplication and processor heterogeneity to minimize the total execution time of a parallel program. The proposed algorithms are suitable for low as well as high communication-to-computation ratios.< >
This paper describes a number of different coarse-grain GA's, including various migration strategies and connectivity schemes to address the premature convergence problem. These approaches are evaluated on a graph...
详细信息
This paper describes a number of different coarse-grain GA's, including various migration strategies and connectivity schemes to address the premature convergence problem. These approaches are evaluated on a graph partitioning problem. Our experiments showed, first, that the sequential GA's used are not as effective as parallel GA's for this graph partition problem. second, for coarse-grain GA's, the results indicate that using a large number of nodes and exchanging individuals asynchronously among them is very effective. Third, GA's that exchange solutions based on population similarity instead of a fixed connection topology get better results without any degradation in speed. Finally, we propose a new coarse-grained GA architecture, the Injection Island GA (iiGA). The preliminary results of iiGA's show them to be a promising new approach to coarse-grain GA's.< >
The performance of a paralleldistributed detection system is investigated as the number of sensors tends to infinity. It is assumed that the i.i.d. sensor data are quantized locally into m-ary messages and transmitte...
详细信息
ISBN:
(纸本)0780308786
The performance of a paralleldistributed detection system is investigated as the number of sensors tends to infinity. It is assumed that the i.i.d. sensor data are quantized locally into m-ary messages and transmitted to the fusion center for Bayesian binary hypothesis testing. Large deviations techniques are employed to show that the equivalence of absolutely optimal and best identical-quantizer systems is not limited to error exponents, but extends to the actual Bayes error probabilities up to a multiplicative constant. This is true as long as the two hypotheses are mutually absolutely continuous;no further assumptions, such as boundedness of second moments of the post-quantization log-likelihood ratio, are needed.
The proposed distributed shared memory model is based on a data replication scheme that provides an environment for a collection of processes that interact to solve a parallel programming problem. In the implementatio...
详细信息
A method for efficiently managing the execution of a query for an advanced database programming language is demonstrated. It is shown that the mechanism gracefully and efficiently manages control flow in both single-p...
详细信息
A method for efficiently managing the execution of a query for an advanced database programming language is demonstrated. It is shown that the mechanism gracefully and efficiently manages control flow in both single-processor and multiprocessor environments. A prototype demonstrating the feasibility of this approach is operational on both single-processor and small-scale multiprocessor systems.< >
Four parallel pointer-based join algorithms for set-valued attributes are described. Such joins will be common in next-generation object-oriented database systems. It is shown that while algorithms based on hybrid-has...
详细信息
Four parallel pointer-based join algorithms for set-valued attributes are described. Such joins will be common in next-generation object-oriented database systems. It is shown that while algorithms based on hybrid-hash provide good performance, algorithms that require less replication will often produce as good or better performance, especially if each set-valued attribute references a small number of nodes.< >
Oracle relational database technology implemented on massively parallel hardware architectures, which allows both OLTP and decision support on the same database image, is discussed. Both queries and transaction proces...
详细信息
Oracle relational database technology implemented on massively parallel hardware architectures, which allows both OLTP and decision support on the same database image, is discussed. Both queries and transaction processing power scale linearly on massively parallel processor platforms. This technology delivers scalable relational database superservers.< >
Replication Server, a forthcoming product that dynamically maintains subsets of data in a distributed environment, providing several transaction models to maintain loose consistency, is contrasted with existing produc...
详细信息
Replication Server, a forthcoming product that dynamically maintains subsets of data in a distributed environment, providing several transaction models to maintain loose consistency, is contrasted with existing products which provide location-transparent reads and high-consistency coordinated commits. Replication Server makes it possible to build systems that are much more robust in the face of system component failures. By moving transactions rather than data, and by locating data at the point of processing, it maximizes the use of network bandwidth, enabling the deployment of robust, high-performance applications at a lower cost than with traditional approaches.< >
暂无评论