distributedobject applications can be made fault tolerance by replicating their constituent object, and by distributing these replicas across the different computers in the network. the idea behind object replication...
详细信息
ISBN:
(纸本)0769514146
distributedobject applications can be made fault tolerance by replicating their constituent object, and by distributing these replicas across the different computers in the network. the idea behind object replication is that the failure of one replica of an object can be masked from a client of the object because the other replicas can continue to perform any operation that the client requires. In this paper, we propose IFTS(Intelligent Fault-Tolerant CORBA Service) in handling faults of server object replica using replication concept to support fault tolerance. And it can choose the fastest primary, replica using multicast mechanism. And it also introduces passive replication for secure fault tolerance. Furthermore, we propose the design and implementation of IFTS service to provide reliability, and faster service using multicast technology by extending existing CORBA ORB.
the Consensus problem is a fundamental problem one has to solve to implement reliable services or applications on top of asynchronous distributed systems prone to failures. Unfortunately, this problem cannot be solved...
详细信息
ISBN:
(纸本)0769510892
the Consensus problem is a fundamental problem one has to solve to implement reliable services or applications on top of asynchronous distributed systems prone to failures. Unfortunately, this problem cannot be solved in those systems as soon as one process can crash (Fischer-Lynch-Paterson's impossibility result). Two approaches have been investigated to circumvent this impossibility result. Both consist in enriching the underlying system with appropriate "oracles". the Unreliable Failure Detector concept proposed by Chandra and Toueg constitutes one family of such oracles. Since it has been proposed the failure detector-based approach has given rise to several failure detector-based consensus protocols. the other family of oracles consists in allowing each process to use a random number generator In that case, the protocol termination is only probabilistic. A few randomized consensus protocols for message-passing asynchronous distributed systems have been proposed. Moreover, they consider that processes can only propose values from a binary set. this paper proposes a new randomized consensus protocol that allows processes to propose arbitrary values. Contrarily to other randomized consensus protocols, the proposed protocol does not require the a priori knowledge of the set of values that can be proposed by processes. It relies on a relatively simple combination of randomization and reliable broadcast.
Presents an approach towards the automatic synthesis of implementations from real-timeobject-oriented design models. From an application design model that addresses the functional requirements of the system, and give...
详细信息
We present a performance-based methodology for designing a high-bandwidth radar application on commodity platforms. Unlike many real-time systems, our approach works for commodity processors running commodity operatin...
详细信息
We present a performance-based methodology for designing a high-bandwidth radar application on commodity platforms. Unlike many real-time systems, our approach works for commodity processors running commodity operating systems. Our technique is innovative because it uses stochastic models of the processing time at each step in the process to allow for the variabilities of running on a non-realtime operating system. We show how our system synthesizes the runtime parameters for a synthetic aperture radar application under a variety of loading conditions.
the complexity of emerging distributed applications mandates real-time analysis and tuning of system and application performance. To meet this need, a prototype system that integrates collaborative, immersive performa...
详细信息
the complexity of emerging distributed applications mandates real-time analysis and tuning of system and application performance. To meet this need, a prototype system that integrates collaborative, immersive performance visualization withrealtime performance measurement and adaptive control of applications on computational grids is designed. this system combines the SvPablo instrumentation system, the Autopilot realtime adaptive control toolkit, and the Virtue virtual environment. the combination of these tools enables physically distributed collaborators to explore and steed, in realtime, the behavior of complex software. Users can pose interactive queries and modify application parameters and behavior during execution.
Applications designed to execute on `computational grids' frequently require the simultaneous co-allocation of multiple resources in order to meet performance requirements. For example, several computers and netwo...
详细信息
Applications designed to execute on `computational grids' frequently require the simultaneous co-allocation of multiple resources in order to meet performance requirements. For example, several computers and network elements may be required in order to achieve real-time reconstruction of experimental data, while a large numerical simulation may require simultaneous access to multiple supercomputers. Motivated by these concerns, we have developed a general resource management architecture for Grid environments, in which resource co-allocation is an integral component. In this paper, we examine the co-allocation problem in detail and present mechanisms that allow an application to guide resource selection during the co-allocation process;these mechanisms address issues relating to the allocation, monitoring, control, and configuration of distributed computations. We describe the implementation of co-allocators based on these mechanisms and present the results of microbenchmark studies and large-scale application experiments that provide insights into the costs and practical utility of our techniques.
We present a performance-based methodology for designing a high-bandwidth radar application on commodity platforms. Unlike many real-time systems, our approach works for commodity processors running commodity operatin...
ISBN:
(纸本)9780769502878
We present a performance-based methodology for designing a high-bandwidth radar application on commodity platforms. Unlike many real-time systems, our approach works for commodity processors running commodity operating *** technique is innovative because it uses stochastic models of the processing time at each step in the process to allow for the variabilities of running on a non-realtime operating system. We show how our system synthesizes the runtime parameters for a synthetic aperture radar application under a variety of loading conditions.
the proceedings contain 42 papers. the topics discussed include: managing dependencies - a key problem in fault-tolerant distributed algorithms;an approach to fault-tolerant parallel processing on intermittently idle,...
ISBN:
(纸本)0818678313
the proceedings contain 42 papers. the topics discussed include: managing dependencies - a key problem in fault-tolerant distributed algorithms;an approach to fault-tolerant parallel processing on intermittently idle, heterogeneous workstations;renegotiable quality of service - a new scheme for fault tolerance in wireless networks;evaluation of a 32-bit microprocessor with built-in concurrent error-detection;probabilistic checkpointing;portable checkpointing for heterogenous architectures;a communication-induced checkpointing protocol that ensures rollback-dependency trackability;a method to automate user interface testing using variable finite state machines;towards a statistical approach to testing object-oriented programs;and experimental evaluation of failure-detection schemes in real-time communication networks.
Designing a good task allocation algorithm faces the challenge of allowing high levels of throughput, so that tasks are executed fast and processor parallelism is exploited, while still guaranteeing a low level of mem...
详细信息
Designing a good task allocation algorithm faces the challenge of allowing high levels of throughput, so that tasks are executed fast and processor parallelism is exploited, while still guaranteeing a low level of memory contention, so that performance does not suffer because of limitations on processor-to-memory bandwidth. In this paper, we present a comparative study of throughput and contention guarantees provided by load balancing networks, a new class of distributed, asynchronous algorithms for real-time task allocation in shared memory multiprocessors. Load balancing networks generalize balancing networks, to accommodate tasks with varying completion times.
In a distributed system, executing a program often requires the access of remote data files. An efficient data transmission strategy is thus important for real-time applications. Since data files may be replicated and...
详细信息
In a distributed system, executing a program often requires the access of remote data files. An efficient data transmission strategy is thus important for real-time applications. Since data files may be replicated and their locations are transparent to the executed program, it becomes the system's responsibility to select a proper file server such that data can be transmitted in an effective way. We consider the scenario that a particular program needs several data files simultaneously for its execution. Each data file may have replicas across the network. the problem is how to find a collection of file servers and the routing paths such that the data transmission time is minimum. An exhaustive approach could of course find the optimal solution. However, it pays a high computation price. We thus propose a heuristic method. Results obtained from the proposed method are encouraging.
暂无评论