Results 1 - 10
of
74
Pusher-watcher: An approach to fault-tolerant tightly-coupled robot coordination
, 2001
"... We present a distributed planar object manipulation algorithm inspired by human behavior. The system, which we call pusher-watcher, enables the cooperative manipulation of large objects by teams of autonomous mobile robots. The robots are not equipped with gripping devices, but instead move objects ..."
Abstract
-
Cited by 46 (3 self)
- Add to MetaCart
We present a distributed planar object manipulation algorithm inspired by human behavior. The system, which we call pusher-watcher, enables the cooperative manipulation of large objects by teams of autonomous mobile robots. The robots are not equipped with gripping devices, but instead move objects
Fault-Tolerant Clock Synchronization for Embedded Distributed
, 2002
"... Embedded computer control systems become more and more common for different functional tasks in cars, airplanes, and factory automation systems. In addition, systems for different functional tasks become interconnected and system functions more integrated. As a consequence, these systems become larg ..."
Abstract
- Add to MetaCart
larger and more complex. Multi-cluster systems are a way to structure large distributed systems to manage complexity and overcome communication bandwidth limitations. A cluster is a system where nodes are tightly coupled and are connected via direct communication links. Nodes of different clusters
Fault-Tolerant Distributed Applications in LiPS
- Hochschule Darmstadt, FB Informatik
, 1996
"... Performing computations using networks of workstations is increasingly becoming an alternative to using a supercomputer. This approach is motivated by the the vast quantities of unused idle-time available in workstation networks. Unlike computing on a tightly coupled parallel computer, where a fixed ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
to this environment, should be realized. This paper shows how fault-tolerant distributed applications are implemented within LiPS version 2.4, a system for distributed computing using idle-cycles in networks of workstation. This system currently is used at the Universitat des Saarlandes in Saarbrucken to perform
A Scalable Byzantine Fault Tolerant Secure Domain Name System
, 2001
"... The domain name system is the standard mechanism on the Internet to advertise and access important information about hosts. At its inception, DNS was not designed to be a secure protocol. The biggest security hole in DNS is the lack of support for data integrity authentication, source authentica ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
of cryptographic digital signatures. However, the proposed extension suffers from some security flaws. In this thesis, we discuss the security problems of DNS and its security extension. As a solution, we present the design and implementation of a Byzantine-fault-tolerant domain name system. The system
The LiPS Runtime Systems based on Fault-Tolerant Tuple Space Machines
- IN PROCEEDINGS OF THE WORKSHOP ON RUNTIME SYSTEMS FOR PARALLEL PROGRAMMING (RTSPP), 11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM (IPPS'97
, 1997
"... Performing computation using networks of workstations is increasingly becoming an alternative to using a supercomputer. This approach is motivated by the vast quantities of unused idle-time available in workstation networks. Unlike computing on a tightly coupled parallel computer where a xed number ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
Performing computation using networks of workstations is increasingly becoming an alternative to using a supercomputer. This approach is motivated by the vast quantities of unused idle-time available in workstation networks. Unlike computing on a tightly coupled parallel computer where a xed number
Lock-free parallel algorithms: An experimental study
- In Proceedings of the 11th International Conference High Performance Computing
, 2004
"... Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include increasing fault tolerance of a (possibly heterogeneous) system and getting rid of the problems associated with critical ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include increasing fault tolerance of a (possibly heterogeneous) system and getting rid of the problems associated
Building Multirobot Coalitions Through Automated Task Solution Synthesis -- A group of robots can move to, or push boxes to, specified locations by sharing information when individual robots cannot perform the tasks separately
, 2006
"... This paper presents a reasoning system that enables a group of heterogeneous robots to form coalitions to accomplish a multirobot task using tightly coupled sensor sharing. Our approach, which we call ASyMTRe, maps environmental sensors and perceptual and motor control schemas to the required flow ..."
Abstract
-
Cited by 56 (16 self)
- Add to MetaCart
This paper presents a reasoning system that enables a group of heterogeneous robots to form coalitions to accomplish a multirobot task using tightly coupled sensor sharing. Our approach, which we call ASyMTRe, maps environmental sensors and perceptual and motor control schemas to the required
Through combining the logic programming language Prolog with a data driven execution mechanism we may be closer to solving the problems encountered when designing tightly coupled multiprocessors involving more than a trivial number of processor elements.
- in Franz Lisp under the UNIX ~ Operating System (Berkley 4.2 bsd) on a SUN 2/120 workstation. Results confirm that the proposed model can 152 Computational Linguistics, Volume 13, Numbers 1-2, January-June 1987 The FINITE STRING Newsletter Abstracts of Cu
"... Database replication based on group communication, or simply GCS-based database replication, has recently been the focus of much attention as a promising technology to achieve strong consistent large-scale data management. GCS-based database replication is expected to provide increased dependability ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
fail to assess concrete implementations, or on complete system implementations which are costly to test with realistic loads and faults in a large-scale perspective. This paper presents a hybrid model that combines simulated network and database engine components with real implementations
Software Architecture Patterns for Distributed Embedded Control Systems
"... Abstract. Embedded systems are often tightly coupled with their environment, implying specific requirements – such as distribution, real-time, and fault toler-ance – to software, to be taken into account in the design of software architecture. Yet, there is little systematic support for designing su ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. Embedded systems are often tightly coupled with their environment, implying specific requirements – such as distribution, real-time, and fault toler-ance – to software, to be taken into account in the design of software architecture. Yet, there is little systematic support for designing
1 I-CASH: Intelligently Coupled Array of SSD and HDD
"... This paper presents a new disk I/O architecture composed of an array of a flash memory SSD (solid state disk) and a hard disk drive (HDD) that are intelligently coupled by a special algorithm. We call this architecture I-CASH: Intelligently Coupled Array of SSD and HDD. The SSD stores seldom-changed ..."
Abstract
- Add to MetaCart
This paper presents a new disk I/O architecture composed of an array of a flash memory SSD (solid state disk) and a hard disk drive (HDD) that are intelligently coupled by a special algorithm. We call this architecture I-CASH: Intelligently Coupled Array of SSD and HDD. The SSD stores seldom
Results 1 - 10
of
74