Control phase plays a critical role in the performance of time-division multiple access (TDMA)-based networks. Within cluster-based wireless sensor networks, a nimble and adaptive control phase algorithm called NACPA to control the control phase of TDMA-based medium access control (MAC) in cluster-based sensor networks is proposed. This algorithm takes advantage of the wireless sensor hardware ...

Most of recent research on distributed shared memory (DSM) systems have focused on either careful design of node controllers or cache coherence protocols. While evaluating these designs, simplified models of networks (constant latency or average latency based on the network size) are typically used. Such models completely ignore network contention. To help network designers to design better net...

This paper studies implementations of concurrent objects that exploit the absence of step contention. These implementations use only reads and writes when a process is running solo. The other processes might be busy with other objects, swapped-out, failed, or simply delayed by a contention manager. We study in this paper two classes of such implementations, according to how they handle the case...

Disk contention is increasingly a significant problem for cloud storage, as applications are forced to co-exist on machines and share physical disk resources. Disks are notoriously sensitive to contention; a single application’s random I/O is sufficient to reduce the throughput of a disk array by an order of magnitude, disrupting every other application running on the same array. Log-structured...

Initial ranging is the primary and important process in wireless networks for the customer premise equipments (CPEs) to access the network and establish their connections with the base station. Contention may occur during the initial ranging process. To avoid contention, the mandatory solution defined in the standards is based on a truncated binary exponential random backoff (TBERB) algorithm w...

Transactional memory (TM) is an emerging concurrent programming abstraction. Numerous software-based transactional memory (STM) implementations have been developed in recent years. STM implementations must guarantee transaction atomicity and isolation. In order to ensure progress, an STM implementation must resolve transaction collisions by consulting a contention manager (CM). Recent work esta...

We propose a scalable all-optical switching architecture towards contention-free data center networking. The arrayed-waveguide-grating router (AWGR) based switching fabric utilizes wavelength parallelism to alleviate contention, to reduce latency, and to improve scalability. ©2010 Optical Society of America OCIS codes: (060.4250) Networks; (200.6715) Switching

Main-memory multicore transactional systems have achieved excellent performance using single-version optimistic concurrency control (OCC), especially on uncontended workloads. Nevertheless, based other protocols, such as hybrid OCC/ locking and variations multiversion (MVCC), are reported to outperform the best OCC systems, with increasing contention. This paper shows that implementation choice...

Uncertainty profiles are used to study the effects of contention within cloud and service-based environments. An uncertainty profile provides a qualitative description of an environment whose quality of service (QoS) may fluctuate unpredictably. Uncertain environments are modelled by strategic games with two agents; a daemon is used to represent overload and high resource contention; an angel i...

Based on effective contention access and perfect scheduling transmission, an enhanced multiple access protocol – UPMA++ protocol – is proposed. It allocates the resource dynamically according to the actual traffic requirement and does not require the synchronisation in the whole network. This protocol adjusts the length of contention access period and polling period effectively to resolve the c...