Search

Recent advances in 3D fabrication have allowed handling the memory bottlenecks for modern data-intensive applications by bringing the computation closer to the memory, enabling Near Memory Processing (NMP). Memory Centric Networks (MCN) are advanced memory architectures that use NMP architectures, where multiple stacks of the 3D memory units are equipped with simple processing cores, allowing numerous threads to execute concurrently. The performance of the NMP is crucially dependent upon the efficient task offloading and task-to-NMP allocation. Our work presents a multi-armed bandit (MAB) based approach in formulating an efficient resource allocation strategy for MCN. Most existing literature concentrates only on one application domain and optimizing only one metric, i.e., either execution time or power. However, our solution is more generic and can be applied to diverse application domains. In our approach, we deploy Upper Confidence Bound (UCB) policy to collect rewards and eventually use it for regret optimization. We study the following metrics: instructions per cycle, execution times, NMP core cache misses, packet latencies, and power consumption. Our study covers various applications from PARSEC and SPLASH2 benchmarks suite. The evaluation shows that the system's performance improves by ~11% on average and an average reduction in total power consumption by ~12%.

The current workloads and applications are highly diversified, facing critical challenges such as the Power Wall and the Memory Wall Problem. Different strategies over the multiple levels of Caches have evolved to mitigate these problems. Also, to work with such diversified applications, the Asymmetric Multi-Core Processor (AMP) presents itself as a viable solution. In this paper, we study the performance of L2 and Last Level Cache for different cache partitions against various AMP configurations. In addition, this study investigates the optimal cache partitioning for a collection of Multi-threaded benchmarks from PARSEC and SPLASH2 benchmark suites under medium-sized inputs. We have studied the effect of block replacement strategies and their impact on the key metrics such as total on-chip power consumption and L2 \& LLC Miss rates. Our study presents an intermediate cache design for AMPs between the two extremities of fully shared and fully private L2 \& LLC level Cache, which helps achieve the desired power values and optimal cache miss penalties.

We present PERISTOLE to study the various time delays associated with the pulsar rotation and other general relativistic aspects of binary pulsars. It is made available as an open-source python package which takes some parameters of the double pulsar system as input and outputs the rotational and latitudinal lensing delays along with the geometric and Shapiro delays that arise due to gravitational lensing. This package was intended to provide a way to quickly analyse, evaluate and study the differences between variations of the same systems and also to quantify the consequences that different parameters have over the system. Through this research note, we briefly describe the motivation behind PERISTOLE and showcase its capabilities using the only double pulsar system ever found, J0737-3039., Comment: 8 subfigures placed as sets of 2 to showcase the graph functions, accepted to RNAAS

The widely used Zadoff-Chu sequence (ZC sequence) for random access preamble in 5G has limitations in terms of the total number of preambles generated, forcing the reuse of preambles. Hence, the probability of collision of preambles of UEs increase, resulting in the failure of random access procedure. To truly qualify beyond 5G networks as green technology, the preamble capacity should be increased without sacrificing energy efficiency. In this paper, we propose a new candidate preamble sequence called $mALL$ sequence using the concept of cover sequences to achieve higher preamble capacity without degrading the power efficiency and hence minimizing device's carbon footprint. We compare the performance of $mALL$ sequence with Zadoff-Chu sequence and other sequences in the literature, such as $mZC$ and $aZC$ sequences. We evaluate the performance of the preamble sequences in terms of periodic correlation, detection probability and the effect of diversity combining. Also, this paper explores the Peak to Average Power Ratio (PAPR) and Cubic Metric(CM) for these sequences, as these are essential parameters to evaluate energy efficiency. We show that the preamble capacity of the proposed $mALL$ sequence is $10^{4}$ times higher than that of legacy ZC sequence without any deterioration in the detection performance.

This paper presents an analytical model for the average frame transmission delay and the jitter for the different Access Categories (ACs) of the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) mechanism. Following are the salient features of our model. As defined by the standard we consider (1) the virtual collisions among different ACs inside each EDCA station in addition to external collisions. (2) the effect of priority parameters, such as minimum and maximum values of Contention Window (CW) sizes, Arbitration Inter Frame Space (AIFS). (3) the role of Transmission Opportunity (TXOP) of different ACs. (4) the finite number of retrials a packet experiences before being dropped. Our model and analytical results provide an in-depth understanding of the EDCA mechanism and the effect of Quality of Service (QoS) parameters in the performance of IEEE 802.11e protocol.

Three body systems where one of the bodies is ejected without escaping the binary system have previously been studied in various restricted forms. However, none of these studies dwells on the problem in a general setting. Thus, to study this phenomenon qualitatively, we try to expand this problem's scope to unequal mass systems and generalize them by considering various configurations of fixed initial points with precisely calculated initial velocities, some zero velocity models, and some optimized models. We will see the use of terminology similar to the previous studies done in this domain, but incorporate different analytical and evaluation methods., Comment: 4 pages, 3 figures, A technical report on a specific case of three body systems

Super-resolution is an innovative technique that upscales the resolution of an image or a video and thus enables us to reconstruct high-fidelity images from low-resolution data. This study performs super-resolution analysis on turbulent flow fields spatially and temporally using various state-of-the-art machine learning techniques like ESPCN, ESRGAN and TecoGAN to reconstruct high-resolution flow fields from low-resolution flow field data, especially keeping in mind the need for low resource consumption and rapid results production/verification. The dataset used for this study is extracted from the 'isotropic 1024 coarse' dataset which is a part of Johns Hopkins Turbulence Databases (JHTDB). We have utilized pre-trained models and fine tuned them to our needs, so as to minimize the computational resources and the time required for the implementation of the super-resolution models. The advantages presented by this method far exceed the expectations and the outcomes of regular single structure models. The results obtained through these models are then compared using MSE, PSNR, SAM, VIF and SCC metrics in order to evaluate the upscaled results, find the balance between computational power and output quality, and then identify the most accurate and efficient model for spatial and temporal super-resolution of turbulent flow fields., Comment: 10 pages, 10 figures, 2 tables, accepted for IMECE2021

We review the properties of fractals, the Mandelbrot set and how deterministic chaos ties to the picture. A detailed study on three body systems, one of the major applications of chaos theory was undertaken. Systems belonging to different families produced till date were studied and their properties were analysed. We then segregated them into three classes according to their properties. We suggest that such reviews be carried out in regular intervals of time as there are an infinite number of solutions for three body systems and some of them may prove to be useful in various domains apart from hierarchical systems., Comment: 7 pages, 11 figures, Research note based on this article submitted to RNAAS

Recent advances in physical layer communication techniques, enable receivers to decode multiple simultaneous transmissions. This technique is known as the multipacket reception (MPR). In this paper, we propose an enhancement to the IEEE 802.11ac EDCA protocol for channels supporting MPR for QoS provisioning. We show that in the case of MPR, in addition to CWmin, CWmax and AIFSN, we can use two more parameters namely (i) threshold and (ii) counter decrement value, that can offer service differentiation. The performance evaluation of the different metrics of the proposed protocol (throughput, delay, and jitter) is carried out using extensive simulations., Comment: 5 pages, 4 figures, In Proceedings of 9th International Symposium on Communication Systems, Networks & Digital Sign (CSNDSP), Manchester, 2014. arXiv admin note: text overlap with arXiv:1308.5360

In Cognitive Radio Network (CRN), the secondary user (SU) opportunistically access the wireless channels whenever they are free from the licensed / Primary User (PU). Even after occupying the channel, the SU has to sense the channel intermittently to detect reappearance of PU, so that it can stop its transmission and avoid interference to PU. Frequent channel sensing results in the degradation of SU's throughput whereas sparse sensing increases the interference experienced by the PU. Thus, optimal sensing interval policy plays a vital role in CRN. In the literature, optimal channel sensing strategy has been analysed for the case when the ON-OFF time distributions of PU are exponential. However, the analysis of recent spectrum measurement traces reveals that PU exhibits heavy-tailed idle times which can be approximated well with Hyper-exponential distribution (HED). In our work, we deduce the structure of optimal sensing interval policy for channels with HED OFF times through Markov Decision Process (MDP). We then use dynamic programming framework to derive sub-optimal sensing interval policies. A new Multishot sensing interval policy is proposed and it is compared with existing policies for its performance in terms of number of channel sensing and interference to PU., Comment: 20 pages (single column), 7 figures, Submitted to IEEE Transactions on Cognitive Communications and Networking for possible publication

We consider a multichannel Cognitive Radio Network (CRN), where secondary users sequentially sense channels for opportunistic spectrum access. In this scenario, the Channel Selection Algorithm (CSA) allows secondary users to find a vacant channel with the minimal number of channel switches. Most of the existing CSA literature assumes exponential ON-OFF time distribution for primary users (PU) channel occupancy pattern. This exponential assumption might be helpful to get performance bounds; but not useful to evaluate the performance of CSA under realistic conditions. An in-depth analysis of independent spectrum measurement traces reveals that wireless channels have typically heavy-tailed PU OFF times. In this paper, we propose an extension to the Predictive CSA framework and its generalization for heavy tailed PU OFF time distribution, which represents realistic scenarios. In particular, we calculate the probability of channel being idle for hyper-exponential OFF times to use in CSA. We implement our proposed CSA framework in a wireless test-bed and comprehensively evaluate its performance by recreating the realistic PU channel occupancy patterns. The proposed CSA shows significant reduction in channel switches and energy consumption as compared to Predictive CSA which always assumes exponential PU ON-OFF times.Through our work, we show the impact of the PU channel occupancy pattern on the performance of CSA in multichannel CRN., Comment: 14 pages, 14 Figures

As a result of the recent advances in physical (PHY) layer communication techniques, it is possible to receive multiple packets at the receiver concurrently. This capability of a receiver to decode multiple simultaneous transmissions is known as multi-packet reception (MPR). In this paper, we propose a simple Medium Access Control (MAC) protocol for an MPR wireless channel, where we modify the backoff procedure as a function of number of ongoing transmissions in the channel. Our protocol is backward compatible with the IEEE 802.11 DCF protocol. The performance analysis of the proposed protocol is carried out using extensive simulations and it is compared with some of the existing MPR MAC protocols. The proposed mechanism improves the throughput and delay performance of the IEEE 802.11 DCF., Comment: 7 pages, 8 figures, Proceedings of 22nd International Conference on Computer Communications and Networks (ICCCN) 2013, Nassau, Bahamas