Super dense and distributed wireless sensor networks have become very popular with the development of small cell technology, Internet of Things (IoT), Machine-to-Machine (M2M) communications, Vehicular-to-Vehicular (V2V) communications and public safety networks. While densely deployed wireless networks provide one of the most important and sustainable solutions to improve the accuracy of sensi...

In this paper, we propose and evaluate an efficient multiaccess protocol for cell-based wireless networks. Our protocol addresses the problems in existing random-access protocols for wireless networks: long-term fairness as well as short-term fairness in accessing a shared channel and the detection of hidden and exposed collisions. Our proposed protocol is a limited contention protocol in which...

In this paper, we examine the causes and effects of contention for shared data access in parallel programs running on a software distributed shared memory (DSM) system. Specifically, we experiment on two widely-used, pagebased protocols, Princeton’s home-based lazy release consistency (HLRC) and TreadMarks. For most of our programs, these protocols were equally affected by latency increases cau...

This paper proposes a new lock-based concurrent binary tree using a methodology for writing concurrent data structures. This methodology limits the high contention induced by today’s multicore environments to come up with efficient alternatives to the most widely used search structures. Data structures are generally constrained to guarantee a big-oh step complexity even in the presence of concu...

We demonstrate the profound effects of contention on the performance of page-based software distributed shared memory systems, as such systems are scaled to a larger number of nodes. We argue that applications that suffer from increases in memory latency due to contention and imbalances in protocol load scale poorly Furthermore, we show that there is a relationship between protocol imbalance, c...