Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks
Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this paper, a special CDS, named \alpha Minimum rOuting Cost CDS (\alpha-MOC-CDS), ...
Efficient and Scalable Starvation Prevention Mechanism for Token Coherence
Token Coherence is a cache coherence protocol that simultaneously captures the best attributes of the traditional approximations to coherence: direct communication between processors (like snooping-based protocols) and no reliance on bus-like ...
A Memory-Efficient Bit-Split Parallel String Matching Using Pattern Dividing for Intrusion Detection Systems
For the low-cost hardware-based intrusion detection systems, this paper proposes a memory-efficient parallel string matching scheme. In order to reduce the number of state transitions, the finite state machine tiles in a string matcher adopt bit-level ...
Parallel Frequent Item Set Mining with Selective Item Replication
We introduce a transaction database distribution scheme that divides the frequent item set mining task in a top-down fashion. Our method operates on a graph where vertices correspond to frequent items and edges correspond to frequent item sets of size ...
A Deadlock-Free Dynamic Reconfiguration Scheme for Source Routing Networks Using Close Up*/Down* Graphs
Computer performance has significantly increased in recent years and, consequently, communication subsystems have become bottlenecks within systems. To counter this problem, current high-performance distributed systems employ switch-based ...
Athanasia: A User-Transparent and Fault-Tolerant System for Parallel Applications
This article presents Athanasia, a user-transparent and fault-tolerant system, for parallel applications running on large-scale cluster systems. Cluster systems have been regarded as a de facto standard to achieve multitera-flop computing power. These ...
Conditional-Fault Diagnosability of Multiprocessor Systems with an Efficient Local Diagnosis Algorithm under the PMC Model
Diagnosis is an essential subject for the reliability of multiprocessor systems. Under the PMC diagnosis model, Dahbura and Masson [12] proposed a polynomial-time algorithm with time complexity O(N^{2.5}) to identify all the faulty processors in a ...
Adaptive Power Control with Online Model Estimation for Chip Multiprocessors
As chip multiprocessors (CMPs) become the main trend in processor development, various power and thermal management strategies have recently been proposed to optimize system performance while controlling the power or temperature of a CMP chip to stay ...
Requirement-Aware Strategies with Arbitrary Processor Release Times for Scheduling Multiple Divisible Loads
This paper investigates the problem of scheduling multiple divisible loads in networked computer systems with a particular emphasis in capturing two important real-life constraints, the arbitrary processor release times (or ready times) and ...
An Effective Memory Optimization for Virtual Machine-Based Systems
Utilizing the popular virtualization technology (VT), users can benefit from server consolidation on high-end systems and flexible programming interfaces on low-end systems. In these virtualization environments, the intensive memory multiplexing for I/O ...
Fast Secure Communications in Shared Memory Multiprocessor Systems
Protection and security are becoming essential requirements in commercial servers. To provide secure memory and cache-to-cache communications, we presented Interconnect-Independent Security Enhanced Shared Memory Multiprocessor System (I^{2}SEMS), ...
Mobility in IPv6: Whether and How to Hierarchize the Network?
Mobile IPv6 (MIPv6) offers a basic solution to support mobility in IPv6 networks. Although Hierarchical MIPv6 (HMIPv6) has been designed to enhance the performance of MIPv6 by hierarchizing the network, it does not always outperform MIPv6. In fact, two ...
Effective Delay-Controlled Load Distribution over Multipath Networks
Owing to the heterogeneity and high degree of connectivity of various networks, there likely exist multiple available paths between a source and a destination. An effective model of delay-controlled load distribution becomes essential to efficiently ...
Coordinated Locomotion and Monitoring Using Autonomous Mobile Sensor Nodes
Stationary wireless sensor networks (WSNs) fail to scale when the area to be monitored is unbounded and the physical phenomenon to be monitored may migrate through a large region. Deploying mobile sensor networks (MSNs) alleviates this problem, as the ...
General Maximal Lifetime Sensor-Target Surveillance Problem and Its Solution
We address a new and general maximal lifetime problem in sensor-target surveillance. We assume that each sensor can watch at most k targets (k \ge 1) and each target should be watched by h sensors (h \ge 1) at any time. The problem is to schedule ...
Tracking Dynamic Boundaries Using Sensor Network
We examine the problem of tracking dynamic boundaries occurring in natural phenomena using a network of range sensors. Two main challenges of the boundary tracking problem are accurate boundary estimation from noisy observations and continuous tracking ...
A Comment on “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks”
The purpose of this comment is to show that Duato's condition for deadlock freedom is only sufficient and not necessary. We propose a fix to keep the condition necessary. The issue is subtle but essential: in a wormhole network worms necessarily do not ...