The total and causal ordering of group operations in distributedsystems is at the core of solutions to many problems in distributedcomputing. Existing approaches are based on either a centralized coordinator to assi...
详细信息
The total and causal ordering of group operations in distributedsystems is at the core of solutions to many problems in distributedcomputing. Existing approaches are based on either a centralized coordinator to assign a sequence number for each operation or on a distributed two-phase protocol to determine the total ordering number. This paper proposes an efficient distributed single-phase protocol which determines the total ordering of group operations at the moment when operations are generated, without the need for a dedicated phase of determining the total ordering.
We present an efficient connection caching scheme in a distributed system where we divide the system into several host groups possibly overlapping and the connection between the hosts in the same group is kept prior t...
详细信息
ISBN:
(纸本)0818675578
We present an efficient connection caching scheme in a distributed system where we divide the system into several host groups possibly overlapping and the connection between the hosts in the same group is kept prior to others. Every host group consists of hosts which have heavy intercommunication. We present performance evaluation of the proposed connection caching scheme in several aspects including group size, grouping and types of the group. Simulation results show that host grouping is effective in every performance criterion and that proper grouping of hosts enhances the performance. We also present a simple Markov process model of our scheme and give some analysis results which are consistent with the simulation results.
PARallel and distributedcomputing (PArdISC) is a parallel programming environment which provides the needed transparency as a scalable OpenFrame computing Model. It can be used to configure the network as a loosely c...
详细信息
PARallel and distributedcomputing (PArdISC) is a parallel programming environment which provides the needed transparency as a scalable OpenFrame computing Model. It can be used to configure the network as a loosely coupled parallel machine, processor pool architecture, and distributedcomputing environment with Logical Network Connectivity. The software architecture of PArdISC is made up of configuration servers, client processes, processor pool servers and process communication interface.
The computing resources offered by a collection of workstations can be enormous. To locate and utilize idle workstations efficiently has been a problem requiring much study. A process migration facility is one such me...
详细信息
ISBN:
(纸本)0818675578
The computing resources offered by a collection of workstations can be enormous. To locate and utilize idle workstations efficiently has been a problem requiring much study. A process migration facility is one such method aimed at better utilization of the vast computing potential that allows the user of a workstation to off-load programs onto idle workstations, thereby providing the user with access to computational resources far beyond that provided by his or her personal workstation. PMDOS: Process Migration on a network of DOS workstations -A distributed processing system comprising a checkpoint/restart mechanism and a process migration mechanism at user level was designed and implemented on a network of DOS machines (PC's) to create an environment wherein: temporarily unused workstations can be accessed by other users on the network to perform distributed or parallel computations or execute background or non-interactive jobs. An owner of a workstation need not be aware that the machine is being used during idle times;the machine is immediately returned when the owner begins to work again. The system gives good throughput, fault tolerance and efficiency for parallel and distributed applications.
In this paper, three main parts of BAG real-time distributed operating system are introduced: task migration, load balancing and distributed file system. Task migration, based on EFSM programming model, is implemented...
详细信息
In this paper, three main parts of BAG real-time distributed operating system are introduced: task migration, load balancing and distributed file system. Task migration, based on EFSM programming model, is implemented as a means of load balancing mechanism. A file system supporting the task migration mechanism is also designed and developed.
The proceedings contains 74 papers from the 3rdinternationalconference on High Performance computing. Topics discussed include: genetic algorithms, optical computers, parallel webservers, direct circuit simulation, ...
详细信息
The proceedings contains 74 papers from the 3rdinternationalconference on High Performance computing. Topics discussed include: genetic algorithms, optical computers, parallel webservers, direct circuit simulation, character recognition, multimedia servers, the RAID configuration tool, concurrent call/return communication, parallel processing systems, real-time distributed operating systems, database systems, mobile computers, binary trees, close wormhole networks, program analysis, data-flow analysis, reduced instruction set computing (RISC), and edge extraction.
Consistent recovery from process failures is an essential component of reliable distributedsystems. Many existing recovery techniques use asynchronous message logging and checkpoints. Most of the present approaches d...
详细信息
Consistent recovery from process failures is an essential component of reliable distributedsystems. Many existing recovery techniques use asynchronous message logging and checkpoints. Most of the present approaches depend on logged states of non-fail processes for recovery. A model of recovery based on the current active states of processes has been proposed. The algorithm considers recoverable state of the failed process and current states of the non-failed processes. Each process recovers to a consistent system state independently.
DiET provides a framework to experiment with extended transaction models and also to synthesize new models. As case studies nested and split-join transaction types have been implemented. DiET is a framework loosely co...
详细信息
DiET provides a framework to experiment with extended transaction models and also to synthesize new models. As case studies nested and split-join transaction types have been implemented. DiET is a framework loosely coupled with a distributed storage manager and PVM. Such a coupling enables DiET to cope up with a wide variety of storage manager and distributed process manager without any difficulty. The performance measures indicate high speedup for complex applications.
In this paper, we discuss the design aspects of a dynamic distributed directory scheme (DDS) to facilitate efficient and transparent access to information files in mobile environments. The proposed directory interface...
详细信息
In this paper, we discuss the design aspects of a dynamic distributed directory scheme (DDS) to facilitate efficient and transparent access to information files in mobile environments. The proposed directory interface enables users of mobile computers to view a distributed file system on a network of computers as a globally shared file system. In order to counter some of the limitations of wireless communications, we propose improvised invalidation schemes that avoid false sharing and ensure uninterrupted usage under disconnected and low bandwidth conditions.
Recently, an interesting dynamic data allocation algorithm for the management of replicated data in distributedsystems has been presented by Wolfson and Jajodia. We analyze this approach from cost as well as from ava...
详细信息
Recently, an interesting dynamic data allocation algorithm for the management of replicated data in distributedsystems has been presented by Wolfson and Jajodia. We analyze this approach from cost as well as from availability perspectives and suggest an improved algorithm that exhibits superior characteristics. Our approach establishes lower and upper bounds in the number of replicas for guaranteeing minimal availability properties and for restricting operation costs. It additionally exploits an improved replica management that abandons the read-one/write-all approach for all replicas as well as the central server concept used by the original approach, thereby presenting a truly distributed solution. Analyses show that the improved algorithm is superior in terms of costs and availability assuming any reasonable workload.
暂无评论