The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Summary form only given. Networks of intelligent sensors that are distributed through the physical world will revolutionize practices in the life sciences, civil engineering, manufacturing, security, agriculture, ubiquitous computing, and many other areas. They also present an opportunity and a need to explore distributed algorithms that are wedded to the noisy, localized, time varying physical world...
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and f-resilient services can solve the consensus problem in the presence of f + 1 undetectable process stopping failures. (A service is f-resilient if it is guaranteed to operate as long as no more than f of the processes connected to it fail.) Our first theorem assumes that the given services...
Cooperation in distributed settings often involves activities that must be performed at least once by the participating processors. When processor failures or delays occur, it becomes unavoidable that some tasks are done redundantly. To make efficient use of the available processors, several distributed algorithms schedule the activities of the processors in terms of permutations of tasks that need...
Since the design of lock-free data structures often poses a formidable intellectual challenge, researchers are constantly in search of abstractions and primitives that simplify this design. The multiword LL/SC object is such a primitive: many existing algorithms are based on this primitive, including the nonblocking and wait-free universal constructions (Anderson et. al., 1995), the closed objects...
The allocation of IP addresses in hybrid wireless networks is one of the most critical issues in all-IP converged wireless networks. The reason is that centralized IP address allocation mechanisms may not be available in networks comprised of heterogeneous mobile wireless devices. In this paper, the authors proposed zero-maintenance address allocation (ZAL), a fully distributed address allocation...
Position-based ad hoc routing algorithms have proved to have decent performance in delivery ratio and end-to-end delay. Position service is essential for such algorithms. In this paper, a distributed position service system, named VDPS, is proposed and evaluated. In the system, each node has a virtual home region (VHR), which is a geographic area. Nodes residing in a node's VHR will act as its position...
Advances in distributed service-oriented computing and global communications have formed a strong technology push for large-scale data integration among organizations and enterprises. However, concerns about data privacy become increasingly important for large-scale mission-critical data integration applications. Ideally, given a database query spanning multiple private databases, the authors wished...
Distributed checkpointing is an important concept in providing fault tolerance in distributed systems. In today's applications, e.g., grid and massively parallel applications, the imposed overhead of taking a distributed checkpoint using the known approaches can often outweigh its benefits due to coordination and other overhead from the processes. This paper presents an innovative approach for distributed...
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critical sections of the same type can execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their critical sections in a mutually exclusive manner. In this...
We present two transformations that convert a class of local-spin mutual exclusion algorithms on the cache-coherent model to local-spin mutual exclusion algorithms on the distributed shared memory model without increasing their time complexity. The first transformation uses registers and test-and-set objects, and does not increase the number of busy-waiting periods. The second transformation uses...
It has long been known that the consensus problem cannot be solved deterministically in completely asynchronous distributed systems, i.e., systems (1) without assumptions on communication delays and relative speed of processes and (2) without access to real-time clocks. In this paper, we define a new asynchronous system model. Instead of assuming reliable channels with finite transmission delays,...
We consider distributed algorithms for solving a range of problems in a framework for trust in large-scale distributed systems. The framework is based on the notion of trust structures; a set of 'trust-levels' with two distinct partial orderings. In the trust model, a global trust-state is defined as the least fixed-point of a collection of local policies of nodes in the network. We show that it is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.