The authors analyse previous parallel evaluation strategies based on the partition of rule instantiations. They present a parallel evaluation strategy for general Datalog programs that is based on the partition of dat...
详细信息
ISBN:
(纸本)0818622954
The authors analyse previous parallel evaluation strategies based on the partition of rule instantiations. They present a parallel evaluation strategy for general Datalog programs that is based on the partition of data and is more practical. A key issue is to determine a criterion of data transmission that reduces the amount of data transmitted and is tested efficiently. A notion of potential usefulness is given as such a criterion. The problem of designing appropriate partition schemes and processing schemes is addressed. Heuristics and algorithms are proposed for making decisions in the design process.< >
Transparency, minimal interference, minimal residual dependencies, efficiency and robustness are some of the features that are felt necessary for process migration mechanisms in distributed operating systems. None of ...
详细信息
Transparency, minimal interference, minimal residual dependencies, efficiency and robustness are some of the features that are felt necessary for process migration mechanisms in distributed operating systems. None of the process migration mechanisms proposed so far possess all these features. In the paper the authors describe a process migration mechanism that possesses all the features mentioned above. This process migration mechanism has been developed as a part of the GALAXY distributed operating system.< >
Due to the nature of supported applications, object-oriented DBMSs need efficient mechanisms for the retrieval of complex objects and the navigation along semantic links among objects. Object clustering is effective w...
详细信息
Due to the nature of supported applications, object-oriented DBMSs need efficient mechanisms for the retrieval of complex objects and the navigation along semantic links among objects. Object clustering is effective when the primary access pattern follows the primary relationship used for clustering, but not so effective when multiple relationships are involved. Object buffering provides a possible solution to compensate the limitation of clustering schemes. The paper investigates the advantages of using an additional layer of object-based buffer pools on top of a traditional page-based buffer pool, and proposes a profile-based buffering scheme to optimize the efficiency of object buffer pools. The performance evaluation based on the semantic implementation of profiles was conducted.< >
Tuple Space provides primitives convenient for description of data-sharing and interprocess communication, but its implementation on distributedsystems is less efficient than that on shared memory machines. Multiprot...
详细信息
Tuple Space provides primitives convenient for description of data-sharing and interprocess communication, but its implementation on distributedsystems is less efficient than that on shared memory machines. Multiprotocol Tuple Space improves the implementation on distributedsystems. That provides three replication-consistency protocols that are weakened to different degrees. By selecting these protocols according to communication patterns, communication through Tuple Space can be optimized.< >
Summary form only. ReSC is a distributed operating system for both parallel/distributed applications and sequential applications. The hardware environment of ReSC is a set of shared-memory multiprocessors and uniproce...
详细信息
Summary form only. ReSC is a distributed operating system for both parallel/distributed applications and sequential applications. The hardware environment of ReSC is a set of shared-memory multiprocessors and uniprocessors which are connected to a high-speed local area network. To execute parallel/distributed application programs efficiently, those programs should control scheduling and mapping of their processes by themselves. ReSC provides facilities that enable each application program to control scheduling and mapping. The authors refer to the module which controls mapping as a distribution optimizer. In ReSC, each parallel/distributed application program can include its own lightweight process scheduler and distribution optimiser for optimal mapping and scheduling. ReSC supports for them by kernel calls and libraries. They have developed a lightweight process library on Sequent Balance 8000 and Omron Luna88k (which are shared-memory multiprocessors), Sun4, Sun3 and NeXT. By using the library, they have built a parallel processing system for databases.< >
The authors study the response-time behavior of a symmetric distributed update-synchronization algorithm where nodes need to obtain permission from only O( square root N) (N being the number of database copies) other ...
详细信息
The authors study the response-time behavior of a symmetric distributed update-synchronization algorithm where nodes need to obtain permission from only O( square root N) (N being the number of database copies) other nodes before performing an update (as opposed to N/2+1 nodes in the well-known Thomas majority consensus algorithm). The algorithm used is an adaptation of M. Maekawa's O( square root N) distributed mutual exclusion algorithm (1985) to multiple-copy update-synchronization. This increase in the efficiency of the update-synchronization algorithm enhances performance in two ways. First, the reduction in transaction service time reduces the response time. Second, the decrease in response time reduces the number of waiting transactions in the system. This reduces the probability of conflict between transactions. To capture the interaction between the probability of conflict and the transaction response time, the authors define a new measure called the conflict response-time product. They show that optimizing this measure yields a different and more appropriate choice of system parameters than simply minimizing the mean transaction response time.< >
The paper presents the specification language Vista, which incorporates a new parallel programming model strongly influenced by concepts originating in the field of object oriented database programming. Before introdu...
详细信息
The paper presents the specification language Vista, which incorporates a new parallel programming model strongly influenced by concepts originating in the field of object oriented database programming. Before introducing Vista, it first gives a brief overview of the problems related to existing parallel programming models, and shows that support for a higher level of abstraction is necessary. Following the presentation of Vista, the paper presents a comparison to related research, including a discussion on the Linda parallel programming model that has also successfully incorporated concepts from the field of database programming. Some indications of future research conclude the paper.< >
The authors introduce distorted mirrors, a mirroring system which combines write anywhere semantics with traditional database-specified block locations. This technique radically reduces the cost of small writes; makin...
详细信息
The authors introduce distorted mirrors, a mirroring system which combines write anywhere semantics with traditional database-specified block locations. This technique radically reduces the cost of small writes; making it attractive for random access applications such as OLTP, while retaining the ability to efficiently perform large sequential accesses. Distorted mirror also scale better than traditional mirrors in terms of both disk caching and large mirrored sets. The effectiveness of distorted mirrors is shown on the TP1 benchmark.< >
An optical database machine using spatial light rebroadcasters (SLRs) is proposed to speed up relational operations on large databases. A SLR is a nonvolatile memory device with large storage capacity and high read/wr...
详细信息
An optical database machine using spatial light rebroadcasters (SLRs) is proposed to speed up relational operations on large databases. A SLR is a nonvolatile memory device with large storage capacity and high read/write speed. Since most of the database operations can be performed directly on the SLRs, one doesn't have the I/O bottleneck, which is a major problem in other database machine architecture. One can search data stored in the SLR in parallel by a single search operation. parallel relational operation algorithms are developed for the proposed architecture, and the author evaluates the performance of the machine for various cases. Compared to the other database machines, performance of the proposed architecture is at least a order of magnitude faster due to the parallel processing capability and high read/write speed of the SLR.< >
Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk ...
详细信息
Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk speeds. Such parallel disk systems require parallel file system software to avoid performance-limiting bottlenecks. The authors discuss cache management techniques that can be used in a parallel file system implementation. The authors examine several writeback policies, and give results of experiments that test their performance.< >
暂无评论