A decentralized commit protocol is proposed for distributed database systems. This protocol is based on the hypercube network topology and is (log/sub 2/N)-2 resilient to site failures, where N is the number of sites ...
详细信息
A decentralized commit protocol is proposed for distributed database systems. This protocol is based on the hypercube network topology and is (log/sub 2/N)-2 resilient to site failures, where N is the number of sites in the system. In addition, the number of messages sent among N sites is O(N log/sub 2//sup 2/N) which is only a factor of log/sub 2/N over the message complexity lower bound O(NlnN).< >
The author introduces queueing network models for the optimization of the concurrent evaluation of complex database queries, which occur e.g. in deductive query processing. The basic principle for the optimization is ...
详细信息
The author introduces queueing network models for the optimization of the concurrent evaluation of complex database queries, which occur e.g. in deductive query processing. The basic principle for the optimization is the reduction of response time by a better load distribution. If data access leads to a bottleneck on any CPU, response time may possibly be reduced by a preceding dynamic replication of one or more tables, whose accesses make up the bottleneck, to a disc managed by a lighter loaded CPU. For the comparison of alternative concurrent execution plans only queueing network models give quantitative results, which consider the contention on resources like CPU or disc.< >
The proceedings contain 54 papers. The special focus in this conference is on parallel Architectures and Languages Europe. The topics include: Indirect reference counting: A distributed garbage collection algorithm;pe...
ISBN:
(纸本)9783540541516
The proceedings contain 54 papers. The special focus in this conference is on parallel Architectures and Languages Europe. The topics include: Indirect reference counting: A distributed garbage collection algorithm;periodic multiprocessor scheduling;embeddings of shuffle-like graphs in hypercubes;mapping uniform recurrences onto small size arrays;area complexity of multilective merging;deriving fully efficient systolic arrays by quasi-linear allocation functions;affine timings for systems of affine recurrence equations;on the computational complexity of optimal sorting network verification;managing a parallel heap efficiently;towards a single model of efficient computation in real parallel machines;parallel complexity in the design and analysis of concurrent systems;FORK: A high-level language for PRAMs;neural network-based decision making for large incomplete databases;an optical content-addressable parallel processor for fast searching and retrieving;towards an efficient hybrid dataflow architecture model;data flow implementation of generalized guarded commands;on the design of deadlock-free adaptive routing algorithms for multicomputers: Design methodologies;a toolkit for debugging parallel lisp programs;Neural computing and the GALATEA project;a novel high-speed memory organization for fine-grain multi-thread computing;evaluation of futurebus hierarchical caching;efficient global computations on a processor network with programmable logic;POMP or how to design a massively parallel machine with small developments;the function processor: An architecture for efficient execution of recursive functions;the G-line: A distributed processor for graph reduction.
The proceedings contain 54 papers. The special focus in this conference is on parallel Architectures and Languages Europe. The topics include: Indirect reference counting: A distributed garbage collection algorithm;pe...
ISBN:
(纸本)9783540541523
The proceedings contain 54 papers. The special focus in this conference is on parallel Architectures and Languages Europe. The topics include: Indirect reference counting: A distributed garbage collection algorithm;periodic multiprocessor scheduling;embeddings of shuffle-like graphs in hypercubes;mapping uniform recurrences onto small size arrays;area complexity of multilective merging;deriving fully efficient systolic arrays by quasi-linear allocation functions;affine timings for systems of affine recurrence equations;on the computational complexity of optimal sorting network verification;managing a parallel heap efficiently;towards a single model of efficient computation in real parallel machines;parallel complexity in the design and analysis of concurrent systems;FORK: A high-level language for PRAMs;neural network-based decision making for large incomplete databases;an optical content-addressable parallel processor for fast searching and retrieving;towards an efficient hybrid dataflow architecture model;data flow implementation of generalized guarded commands;on the design of deadlock-free adaptive routing algorithms for multicomputers: Design methodologies;a toolkit for debugging parallel lisp programs;Neural computing and the GALATEA project;a novel high-speed memory organization for fine-grain multi-thread computing;evaluation of futurebus hierarchical caching;efficient global computations on a processor network with programmable logic;POMP or how to design a massively parallel machine with small developments;the function processor: An architecture for efficient execution of recursive functions;the G-line: A distributed processor for graph reduction.
To support a distributed, heterogeneous computing environment, an inter-system catalog protocol is needed so that remote resources can be located, used, and maintained with little human intervention. This paper descri...
详细信息
To support a distributed, heterogeneous computing environment, an inter-system catalog protocol is needed so that remote resources can be located, used, and maintained with little human intervention. This paper describes a scalable catalog framework, which is an extension of previous work in a distributed relational DBMS research prototype called R*. This work builds on the R* concepts to accommodate heterogeneity, to handle partitioned and replicated data, to support non-DBMS resource managers, and to enhance catalog access performance and system extensibility.< >
The proceedings contain 63 papers. The special focus in this conference is on Methodologies for Intelligent systems. The topics include: User profiles for information retrieval;an approach to deriving object hierarchi...
ISBN:
(纸本)9783540545637
The proceedings contain 63 papers. The special focus in this conference is on Methodologies for Intelligent systems. The topics include: User profiles for information retrieval;an approach to deriving object hierarchies from database schema and contents;multilevel interface to a distributed database system;efficient evaluation of linear recursions with function symbols in deductive databases;synthesizing efficient agents from partial programs;Knowledge extraction from databases: Design principles of the INLEN system;stable model semantics for probabilistic deductive databases;towards implementing valuation based systems with relational databases;on the representation of continuous causal relationships;a logic of relative desire (Preliminary report);process transition networks: A formal graphical knowledge representation tool;using normal deduction graphs in default reasoning;a model of information sharing for fault-tolerant flexible manufacturing systems;On interval-based temporal planning: An IQ strategy;percept conceptualizations and their knowledge representation schemes;combining time points and time intervals in a hybrid knowledge representation formalism;an analysis of property-flow view vs individual-flow view of inheritance;semantic extensions to text retrieval;updates with equality: Beyond the herbrand universe assumption;using genetic algorithms to improve the performance of classification rules produced by symbolic inductive methods;methodologies for data/knowledge/information engineering: Will the twain meet?;learning quantitative features in a symbolic environment;automatic acquisition of proper noun meanings;investigating the relationships between abduction and inverse resolution in propositional calculus;explanation-based learning helps acquire knowledge from natural language texts;hybrid pattern recognition system capable of self-modification;towards an adaptive information retrieval system;generation of classification rules;personal learning apprent
Deals with parallel transitive closure computations. The sort-based approaches introduced sorts the tuples of the relation into topological order, and the sorted relation is then horizontally partitioned and distribut...
详细信息
Deals with parallel transitive closure computations. The sort-based approaches introduced sorts the tuples of the relation into topological order, and the sorted relation is then horizontally partitioned and distributed across several processing nodes of a message passing multiprocessor system. This data partitioning strategy allows the transitive closure computation of the local data fragments to be computed in parallel with no interprocessor communication. The construction of the final result then requires only a small number of joins. Extensive analytical results are included in the paper as well. They show that the proposed techniques leads to a speedup that is essentially linear with the number of processors. Its performance is significantly better than the recently published hashless parallel algorithm.< >
The authors develop two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, they give a parallel algorithm for the EREW PRAM model and a distributed algorithm for net...
详细信息
The authors develop two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, they give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. If an FCSP can be represented by an acyclic constraint network of size n with width bounded by a constant then: the parallel algorithm takes O(log n) time using O(n) processors and there is a mapping of this problem to a distributed computing network of poly(n) processors which stabilizes in O(log n) time.< >
The concept of serializability has been the traditionally accepted notion of correctness in database systems. However, in a heterogeneous distributed database system (HDBMS) environment, ensuring serializability is a ...
详细信息
The concept of serializability has been the traditionally accepted notion of correctness in database systems. However, in a heterogeneous distributed database system (HDBMS) environment, ensuring serializability is a difficult task mainly due to the desire of preserving the local autonomy of the participating local database systems. The authors introduce a new correctness criterion fur HDBMSs, two-level serializability (2LSR), and show that it preserves database consistency in several HDBMS models. Further, they present a simple protocol for ensuring that schedules in an HDBMS environment are 2LSR. This protocol is easily implementable and does not violate the local autonomy of sites.< >
暂无评论