35078097
An adaptive location management algorithm for mobile computing
In mobile computing mobile hosts or mobile units move randomly from one place to another within a well-defined geographical area. This requires some mechanism for identifying the exact location of a mobile host. Such mechanisms are usually referred to as location management and is one of the essential components for supporting mobility. In the past a number of efficient location management schemes have been suggested but they lack adaptability. We believe that an adaptable location management scheme is more desirable because of frequent change in the location of mobile hosts. In this paper, we report a location management algorithm, which adapts to the constant changing scenario. Our algorithm makes use of some of the concepts of location management schemes proposed in the past.
5147118
Location dependent query processing
The advances in wireless and mobile computing allow a mobile user to perform a wide range of aplications once limited to non-mobile hard wired computing environments. As the geographical position of a mobile user is becoming more trackable, users need to pull data which are related to their location, perhaps seeking information about unfamiliar places or local lifestyle data. In these requests, a location attribute has to be identified in order to provide more efficient access to location dependent data, whose value is determined by the location to which it is related. Local yellow pages, local events, and weather information are some of the examples of these data.
In this paper, we give a formalization of location relatedness in queries. We differentiate location dependence and location awareness and provide thorough examples to support our approach.
39362526
Main memory database recovery algorithms and their performance
In main memory systems recovery becomes more complex mainly due to the volatility of main memory and the elimination of the separation of data storage (disk) and data processing locations (main memory). In a disk based database system, it is the disk copy that represents the stable database restored after a system failure; but in MDBSs, the main memory copy of the database must be recovered. The paper discusses the recovery issues in MDBSs and presents a somewhat detailed performance study of two recovery algorithms, one using a shadow approach and the other update-in-place.<<ETX>>
18803353
Performance of Multiversion and Distributed Two-Phase Locking Concurrency Control Mechanisms in Distributed Databases
In this paper, we have presented a detailed simulation study of a distributed multiversion and a distributed two-phase locking concurrency control mechanism (CCM). Our experiment concentrated on measuring the effect of message overhead, read:write ratios, data partitioning, and partial replication on the performance of these mechanisms. The effect of these parameters has not been investigated in any previous work. We simultated a blind-write model for two reasons: (a) all other works studied the behavior of multiversion CCMs under read-before-write model and observed a similar result, and (b) the performance of any multiversion CCM has not been studied under a blind-write model. A blind-write model is not unrealistic, and intutively the multiversion should provide much better performance. We observed that multiversion outperforms wound-wait (WW) in both partitioned and partially replicated databases. Multi version (MV) handles read-only and write-only transactions efficiently, and after a certain write percentage the throughput improves with this percentage. The message overhead progressively becomes less significant as the MPL (multiprogramming level) increases, indicating that in a heavily loaded system the throughput is least sensitive to message cost. We found that in the partially replicated case, 50% write does not show the lowest performance, as observed in the partitioned case.
11125586
The Behavior of Database Concurrency Control Mechanisms under Bursty Arrivals
The robustness and sensitivity of four two-phase databases concurrency control mechanisms are studied under a dynamically changing workload due to the bursty arrival of transactions. The concurrency control mechanisms are studied under closely controlled conditions in which the only variable is the coefficient of variance of the arrival rate distribution. This paper shows that bursty traffic does impact the performance of the concurrency control mechanisms at both high and low loads, and that the degree of this impact is different for the different mechanisms investigated. We also show that the behavior of some CCMs change significantly under such environment.
1921533
A superior two-phase locking algorithm and its performance
Abstract Concurrent transactions, during their execution, may conflict over common data entities. Such conflicts are resolved by concurrency control mechanisms by use of operations such as transaction rollback and/or transaction blocking. There are a number of mechanisms available and each applies these operations in different ways to resolve conflicts and claims some performance advantages. In this work we have analyzed the behavior of a new deadlock-free two-phase locking mechanism, called Cautious Waiting, and have compared its performance with other well-known mechanisms. The mechanism is conceptually quite simple; therefore it is not likely to be difficult to implement. We show that this mechanism performs consistently better under a wide range of parameter values than the other mechanisms investigated here. We also show that it is more robust, in the sense that it is less sensitive to load increases and other changes in parameter settings. In contrast, we show that one of the most commonly used mechanisms is not as robust and efficient under stress situations.
17542367
The effect of feedback and feedforward on formation ISS
A new type of stability of leader follower formations is defined, based on input-to-state stability (ISS) properties of cascade interconnections. Formation ISS links leader input to internal state of the formation and characterizes the way this input affects performance. The effect of feedforward and feedback inter-agent communication is then investigated in this framework and it is indicated how the structure of interconnections and the amount of available information can affect stability performance.
10015251
Repartitioning of Adaptive Meshes: Experiments with Multilevel Diffusion
For a large class of irregular grid applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the graph evolves, the adapted mesh has to be repartitioned to ensure good load balance. If this new graph is partitioned from scratch, it will lead to an excessive migration of data among processors. In this paper, we present a new scheme for computing repartitionings of adaptively refined meshes. This scheme performs diffusion of vertices in a multilevel framework and minimizes vertex movement without significantly compromising the edge-cut.
16578484
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in debugging the system. Error explanation is the task of discovering errors in the system or the reasons why the system exhibits the error trace. While there has been considerable recent interest in automating this task and developing tools based on different heuristics, there has been very little effort in characterizing the computational complexity of the problem of error explanation. 
 
In this paper, we study the complexity of two popular heuristics used in error explanation. The first approach tries to compute the smallest number of system changes that need to be made in order to ensure that the given counter-example is no longer exhibited, with the intuition being that these changes are the errors that need fixing. The second approach relies on the observation that differences between correct and faulty runs of a system shed considerable light on the sources of errors. In this approach, one tries to compute the correct trace of the system that is closest to the counter-example. We consider three commonly used abstractions to model programs and systems, namely, finite state Mealy machines, extended finite state machines and pushdown automata. We show that the first approach of trying to find the fewest program changes is NP-complete no matter which of the three formal models is used to represent the system. Moreover we show that no polynomial factor approximation algorithm for computing the smallest set of changes is possible, unless P = NP. For the second approach, we present a polynomial time algorithm that finds the closest correct trace, when the program is represented by a Mealy machine or a pushdown automata. When the program is represented by an extended finite state machine, the problem is once again NP-complete, and no polynomial factor approximation algorithm is likely.
10751860
Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes
For a large class of irregular mesh applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the mesh evolves, the adapted mesh has to be repartitioned to ensure good load balance. If this new graph is partitioned from scratch, it may lead to an excessive migration of data among processors. In this paper, we present schemes for computing repartitionings of adaptively refined meshes that perform diffusion of vertices in a multilevel framework. These schemes try to minimize vertex movement without significantly compromising the edge-cut. We present heuristics to control the tradeoff between edge-cut and vertex migration costs. We also show that multilevel diffusion produces results with improved edge-cuts over single-level diffusion, and is better able to make use of heuristics to control the tradeoff between edge-cut and vertex migration costs than single-level diffusion.
5797236
Strong edge coloring for channel assignment in wireless radio networks
We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network