The goal of this paper is to explore the notion of node autonomy in distributed computer systems. Some motivations for autonomy are exposed. Different facets of autonomy as well as relationships among them are discuss...
ISBN:
(纸本)9780818608933
The goal of this paper is to explore the notion of node autonomy in distributed computer systems. Some motivations for autonomy are exposed. Different facets of autonomy as well as relationships among them are discussed. Finally, we look into how autonomy affects other aspects of distributed computing, including timeliness, correctness, load sharing, data sharing, and data replication.
The most costly spatial operation in spatial databases is spatial join which combines objects from two data sets based on spatial predicates. Even if the execution time of sequential processing of a spatial join has b...
详细信息
The most costly spatial operation in spatial databases is spatial join which combines objects from two data sets based on spatial predicates. Even if the execution time of sequential processing of a spatial join has been considerably improved, the response time is far from meeting the requirements of interactive users. In this paper, we have developed two kinds of parallel spatial join algorithms based on grid files: a parallel spatial join using a multi-assignment grid file and a parallel spatial join using a single-assignment grid file. We also present the cost of the two join algorithms in terms of the number of MBR comparisons. The experimental tests on the MIMD parallel machine with shared disks show that the first join algorithm based on disjoint decomposition of a data space outperforms the second based on non-disjoint decomposition.
Using simulation and probabilistic analysis, we study the performance of an algorithm to read entire databases with locking concurrency control allowing multiple readers or an exclusive writer. The algorithm runs conc...
ISBN:
(纸本)9780818608933
Using simulation and probabilistic analysis, we study the performance of an algorithm to read entire databases with locking concurrency control allowing multiple readers or an exclusive writer. The algorithm runs concurrently with the normal transaction processing (on-the-fly) and locks the entities in the database one by one (incremental). The analysis compares different strategies to resolve the conflicts between the global read algorithm and update. Since the algorithm is parallel in nature, its interference with normal transactions is minimized in parallel and distributeddatabases. A simulation study shows that one variant of the algorithm can read the entire database with very little overhead and interference with the updates.
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performance. Whereas earlier allocation strategi...
详细信息
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performance. Whereas earlier allocation strategies were either sensitive to communication alone or sensitive to I/O alone, we present a new strategy that is sensitive to both communication and I/O. Our new strategy MC-Elongated, strives to achieve (1) the compactness needed to minimize communication-based contention as well as (2) the balance and orientation relative to I/O nodes needed to minimize I/O-based contention. We tested our new strategy using synthetic workloads and a real workload trace of 6087 jobs captured from a 400 node Intel Paragon. Our results show that with respect to system throughput and average job turnaround time, in environments with varying degree of communication and I/O traffic, MC-Elongated outperforms previous allocation strategies that are in use today. Regarding the tension between communication and I/O, our results show that spatial layout is more critical for I/O intensive jobs at lower utilization levels and more critical for communication-intensive jobs at higher utilization levels; and that in general, the impact of I/O traffic is dominant.
Efficient execution of applications requires insight into how the system features impact the performance of the application. For distributedsystems, the task of gaining this insight is complicated by the complexity o...
详细信息
Efficient execution of applications requires insight into how the system features impact the performance of the application. For distributedsystems, the task of gaining this insight is complicated by the complexity of the system features. This insight generally results from significant experimental analysis and possibly the development of performance models. This paper presents the Prophesy project, an infrastructure that aids in gaining this needed insight based upon experience. The core component of Prophesy is a relational database that allows for the recording of performance data, system features and application details.
The distributed Virtual Communication Machine (DVCM) is a software communication architecture for clusters of workstations equipped with programmable network interfaces (NIs) for high-speed networks. DVCM is an extens...
详细信息
The distributed Virtual Communication Machine (DVCM) is a software communication architecture for clusters of workstations equipped with programmable network interfaces (NIs) for high-speed networks. DVCM is an extensible architecture, which promotes the transfer of application modules to the NI. By executing `closer' to the network, on the NI CoProcessor, these modules can communicate with significantly higher message rates and lower latencies than achievable at the CPU-level. This paper describes how DVCM modules can be used to enhance the performance of the Cluster Recoverable Memory system (CRMem), a transaction-processing kernel for memory-resident databases. By using the NI CoProcessor for CRMem's remote operations, our implementation achieves more than 3,000 trans/sec on a simplified TpcB benchmark.
A simulation model has been designed to evaluate the performance of distributed object-oriented database systems. By adjusting parameters, a variety of different hardware configurations and workloads can be represente...
ISBN:
(纸本)9780818608933
A simulation model has been designed to evaluate the performance of distributed object-oriented database systems. By adjusting parameters, a variety of different hardware configurations and workloads can be represented. The model has been used to study a number of performance issues relating to ORION-2, a distributed object-oriented database system being developed by the Advanced Computer Architecture Program at MCC. Experiments show that the central server or the local area network can be a performance bottleneck.
In the world of pervasive computing where large management systems, as well as small devices, all become interconnected, the problem of the configuration and management of networks is becoming increasingly complex. Sy...
详细信息
In the world of pervasive computing where large management systems, as well as small devices, all become interconnected, the problem of the configuration and management of networks is becoming increasingly complex. System administrators have to deal with many problems due to the increasingly distributed architecture of systems. Jini, a new paradigm for the development and management of distributedsystems, provides mechanisms that enable systems to plug together to form an impromptu community. This practice report demonstrates how Jini can be applied in an industrial environment, or more exactly how it can be used in the integration of embedded devices on-board trains in the back-office IT infrastructure of railway operators. We present two use cases: the first is about an on-board service that allows for remote access to an on-board diagnosis database; the second is about automatically installing new services on-board trains. The results are encouraging and prove that Jini is the appropriate technology to link application servers and service gateways in embedded servers.
We have parallelized a Monte Carlo photon transport algorithm. Three different parallel versions of the algorithm were developed. The first version is for the Tera Multi-Threaded Architecture (MTA) and uses Tera speci...
详细信息
We have parallelized a Monte Carlo photon transport algorithm. Three different parallel versions of the algorithm were developed. The first version is for the Tera Multi-Threaded Architecture (MTA) and uses Tera specific directives. The second version, which uses MPI library calls, has been implemented on both the CRAY T3E and the 8-way SMP IBM SP with Power3 processors. The third version is a hybrid MPI-OpenMP implementation and is used on the SMP IBM SP. This version uses MPI to communicate between nodes and OpenMP to perform shared memory operations among processors within a node. We explain the three different parallelization approaches and present parallel performance results of these three parallel implementations on three different machines. We observe near perfect speedup for the three versions on the three architectures. The results on the SMP IBM SP suggest that the hybrid MPI-OpenMP programming is suitable for SMP type machines.
Skew in the distribution of values taken by an attribute is identified as a major factor that can affect the performance of parallel architectures for relational joins. The effect of skew on the performance of two par...
ISBN:
(纸本)9780818608933
Skew in the distribution of values taken by an attribute is identified as a major factor that can affect the performance of parallel architectures for relational joins. The effect of skew on the performance of two parallel architectures is evaluated using analytic models. In one architecture, called database machine (DBMC), data as well as processing power are distributed; while in the other architecture, called Single Processor parallel Input/output (SPPI), data is distributed but the processing power is concentrated in one processor. The two architectures are compared in terms of the ratio of MIPS used by DBMC and SPPI to deliver the same throughput and response time. In addition, the horizontal growth potential of DBMC is evaluated in terms of maximum speedup achievable by DBMC relative to SPPI response time. The MIPS ratio as well as speedup are found to be very sensitive to the amount of skew. These suggest, careful thought should be given in parallelizing database applications and in the design of algorithms and query optimizer for parallel architectures.
暂无评论