38077943
Position-Based Topology-Independent Scheduling Algorithms for Mobile Ad Hoc Networks
34087964
Wormhole Routing in Faulty Mesh Networks
33219357
Fault-tolerant broadcasting in wormhole-routed torus networks
This paper describes a fault-tolerant broadcast algorithm for wormhole-routed torus networks for which there is only local knowledge of faulty components. This algorithm tolerates tip to k-1 faulty nodes in a k-ary n-cube provided the faults do not cause the network to be disconnected. Based on the fault-tolerant dimension-order unicast communication, this algorithm is deadlock-free and no additional virtual channels are needed. The first stage of this algorithm is itself an optimal broadcast algorithm for a torus if no faults are present. The second stage overcomes the presence of up to k-1 faults with a fixed number of additional message transmissions. Thus, the cost of this algorithm is within a constant factor of the cost of optimal non-fault-tolerant broadcast algorithms.
5331573
All-to-All Broadcasting in Faulty Hypercubes
A new fault-tolerant all-to-all broadcasting algorithm in an n-dimensional hypercube with up to [n/2] faulty links is given. An extension of this algorithm that can tolerate up to [n/2] faulty nodes is also described. These algorithms assume a multiport I/O model, meaning each node can send and receive messages from all its adjacent nodes simultaneously. The total time steps taken by the proposed algorithms are near optimal, and they produce a factor of n less traffic than previously known algorithms.
46184949
Adaptive Deadlock-Free Wormhole Routing in Faulty Hypercubes
42767167
Location Discovery in Ad Hoc Sensor Networks
816246
Alternative Software Stacks for OGSA-based Grids
The Open Grid Services Architecture (OGSA) has been a major step forward for Grid Computing, but its de facto reliance on the Web Services Resource Framework (WSRF) and WS-Notification have left some in the community questioning if the Grid software and protocols have become too complex. In this paper, we consider the feasibility of an "alternative" software stack, based on WS-Transfer and WS-Eventing. We compare and evaluate WSRF/WS-Notification vs. WS-Transfer/WSEventing, first via a "hello world" service and then via a more complete Grid scenario for remote execution called "Grid-in-a-Box". By qualitatively and quantitatively evaluating each approach, we find that while subtle differences exist (e.g., the naming of resources, the creation of resources), the stacks are overwhelmingly equivalent in their functionality and implied performance. Overall, this paper uniquely shows that there could be alternative software stacks for OGSA-based Grids.
1204013
An interactive speech interface for summarizing agile project planning meetings
In this paper we present an autonomous meeting summarizer that transcribes an agile planning meeting and produces a textual summary of the discussion. We explore the issues involved in designing a speech-based interactive system that communicates with humans in a natural language. The inherent nature of ambiguity in conversational speech is overcome by suggesting a list of possible phrases to listen for. The system interacts with users in an interview-style dialogue for data collections. This is possible because we used the highly constrained structure and terminologies of agile planning meetings to make the approach successful.
36047409
A Comparison of Scalable Labeling Schemes for Detecting Races in OpenMP Programs
Detecting races is important for debugging shared-memory parallel programs, because the races result in unintended nondeterministic executions of the program. On-the-fly technique to detect races uses a scalable labeling scheme which generates concurrency information of parallel threads without any globally-shared data structure. Two efficient schemes of scalable labeling, BD Labeling and NR Labeling, show the similar complexities in space and time, but their actual efficiencies have been compared empirically in no literature to the best of our knowledge. In this paper, we empirically compare these two labeling schemes by monitoring a set of OpenMP kernel programs with nested parallelism. The empirical results show that NR Labeling is more efficient than BD Labeling by at least 1.5 times in generating the thread labels, and by at least 3.5 times in using the labels to detect races in the kernel programs.
17579236
Adaptive topology control for wireless Ad hoc networks
Topology control in ad-hoc networks is the problem of adjusting the transmission power at network nodes in order to achieve the optimal topology that maximizes network performance. Recently, using effective topology control to optimize energy usage in the network has come into focus in the research community [1, 2]. The common thesis arrived at by existing works is that the transmission range used by mobile nodes should be the minimum required to keep the network connected. We refer to such a topology as the minimally connected topology in the rest of the paper. We argue in this work that the minimally connected topology does not always provide the optimal performance in typical ad-hoc networks. We show that in contrast, for typical ad-hoc networks with a few hundred nodes distributed over a few square miles area, the optimal topology is a function of the traffic load.
9401551
Sink-to-sensors reliability in sensor networks
The issue of relability, thus far, has not been addressed throughly to any extent in sensor networking research. To the best of our knowledge the first such work that focused on some aspect of reliable communication in sensor networks appeared only in [1]. In this paper, we focus on the problem of communication reliability from the sink to the sensors in a static network.