Recursive data structures (lists, trees, graphs, etc.) are used throughout scientific and commercial software. The common approach is to allocate storage to the individual nodes of such structures dynamically, maintaining the logical connection between them via pointers. Once such a data structure goes through a sequence of updates (inserts and deletes), it may get scattered all over memory yie...

Network coding is a new technique in the field of information theory and coding theory. This emerging technique offers great benefits in the communication networks such as increased throughput and energy savings. In this paper, we evaluate network coding for video transmission scenarios. In these scenarios, the source nodes encode the video packets, while the intermediate nodes implement networ...

Most distributed shared memory systems use point-topoint networks in conjunction with directory-based cache coherence protocols. Cache invalidation transaction generates a number of unicast invalidation messages and as many acknowledgment messages. This results in heavy network traffic, high latency, and high occupancy at home nodes. This paper introduces a fast cache invalidation method, calle...

L1 cache design contributes significantly to the performance and energy consumption of microprocessors due to L1’s large proportion of die size and high activity factor. Voltage reduction reduces energy per operation, however, increased process variability in modern technology nodes causes an exponential growth in SRAM failure probability for linear voltage reduction, necessitating some form of...

Active power used to be the primary contributor to total power dissipation of CMOS designs, but with the technology scaling, the share of leakage in total power consumption of digital systems continues to grow. Moreover, temperature is another factor that exponentially increases the leakage current. In this paper, we show the effects of temperature and technology nodes on the optimal (minimum-e...

Cooperative caching, which allows the sharing and coordination of cached data among multiple nodes, can be used to improve the performance of data access in ad hoc networks. When caching is used, data from the server is replicated on the caching nodes. Since a mobile node may return the cached data, or modify the route and forward a request to a caching node, it is very important that the mobil...

The explosion of mobile video traffic imposes tremendous challenges on present cellular networks. To alleviate the pressure on backhaul links and to enhance the quality of experience (QoE) of video streaming service, small cell base stations (SBS) with caching ability are introduced to assist the content delivery. In this paper, we present the first study on the optimal caching strategy of scal...

AM-heap is a heap data structure with O(1) amortized insertion time and O(logn) deletion time complexities. This paper presents cache-aligned 4-ary AM-heap in which every node has four children except that the root has three children. In this heap, the leftmost node of each sibling has an index of a multiple of four. Also, every node index matches its corresponding array index and every sibling...

In recent years, ubiquitous computing using Mobile Ad Hoc Networks (MANET) created many researches in all the application areas. Since the nodes in MANET are small with limited resources, highly mobile and has no centralized administrative control, it is used for tracking and monitoring in unattended environments. Dynamic topological changes due to the high mobility of the nodes make challenges...