Chita R. Das

Chita R. Das

Auto-generated profile, based on publicly available information

Chita R. Das

The Pennsylvania State University

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 April 2019
Verified
Conference Paper
Open access
PDF file
CLChun-Yi Liu
Chun-Yi Liu
JKJagadish B. Kotra
Jagadish B. Kotra
MJMyoungsoo Jung
Myoungsoo Jung
MKMahmut T. Kandemir
Mahmut T. Kandemir
CDChita R. Das
Chita R. Das
NAND-based solid-state disks (SSDs) are known for their superior random read/write performance due to the high degrees of multi-chip parallelism they exhibit. Currently, as the chip density increases dramatically, fewer 3D NAND chips are needed to build an SSD compared to the previous generation chips. As a result, SSDs can be made more compact. However, this decrease in the number of chips also results in reduced overall throughput, and prevents 3D NAND high density SSDs from being widely-adopted. We analyzed 600 storage workloads, and our analysis revealed that the small read operations suffer significant performance degradation due to reduced chip-level parallelism in newer 3D NAND SSDs. The main question is whether some of the inter-chip parallelism lost in these new SSDs (due to the reduced chip count) can be won back by enhancing intra-chip parallelism. Motivated by this question, we propose a novel SOML (Single-Operation-Multiple-Location) read operation, which can perform several small intra-chip read operations to different locations simultaneously, so that multiple requests can be serviced in parallel, thereby mitigating the parallelism-related bottlenecks. A corresponding SOML read scheduling algorithm is also proposed to fully utilize the SOML read. Our experimental results with various storage workloads indicate that, the SOML read-based SSD with 8 chips can outperform the baseline SSD with 16 chips.

1 November 2006
Verified
Conference Paper
Closed access
SLSunho Lim
Sunho Lim
CYChan(su) C. Yu
Chan(su) C. Yu
CDChita R. Das
Chita R. Das
Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free power-law connectivity distribution and a few densely populated nodes, known as hubs. We envision that wireless communication or sensor networks are directly deployed over such real-world networks to facilitate communication among participating entities. Here nodes move in such a way that they exhibit scale-free connectivity distribution at any instance, which cannot be modeled by most of the prior mobility models such as random waypoint (RWP) mobility model. This paper proposes clustered mobility model (CMM), which facilitates in forming hubs in a network satisfying the scale-free property. We call this a scale-free wireless network (SFWN). In CMM, it is possible to control the degree of node concentration or non-homogeneity to easily assess the strengths and weaknesses of the scale-free phenomena. To the best of the authors' knowledge, there has been no such mobility model reported in the literature and we believe the proposed CMM can be usefully used to investigate the properties of the SFWNs that are likely to occur in a real deployment of wireless multihop and sensor networks. Another important feature of CMM is that it does not possess any unintended spatial and temporal characteristics found in other mobility models such as RWP. Finally, to highlight the difference between a SFWN and a conventional wireless network, extensive simulation study has been conducted to measure network capacities at the physical, link and network layers

1 June 2007 in Computer Communications
Verified
Journal Article
Closed access
SLSunho Lim
Sunho Lim
WLWang-Chien Lee
Wang-Chien Lee
GCGuohong Cao
Guohong Cao
CDChita R. Das
Chita R. Das

11 April 2016 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
FFFarshid Farhat
Farshid Farhat
DTDiman Zad Tootaghaj
Diman Zad Tootaghaj
YHYuxiong He
Yuxiong He
ASAnand Sivasubramaniam
Anand Sivasubramaniam
MKMahmut Kandemir
Mahmut Kandemir
CDChita R. Das
Chita R. Das
MapReduce framework is widely used to parallelize batch jobs since it exploits a high degree of multi-tasking to process them. However, it has been observed that when the number of servers increases, the map phase can take much longer than expected. This paper analytically shows that the stochastic behavior of the servers has a negative effect on the completion time of a MapReduce job, and continuously increasing the number of servers without accurate scheduling can degrade the overall performance. We analytically model the map phase in terms of hardware, system, and application parameters to capture the effects of stragglers on the performance. Mean sojourn time (MST), the time needed to sync the completed tasks at a reducer, is introduced as a performance metric and mathematically formulated. Following that, we stochastically investigate the optimal task scheduling which leads to an equilibrium property in a datacenter with different types of servers. Our experimental results show the performance of the different types of schedulers targeting MapReduce applications. We also show that, in the case of mixed deterministic and stochastic schedulers, there is an optimal scheduler that can always achieve the lowest MST.

1 September 2006
Verified
Conference Paper
Closed access
DPDongkook Park
Dongkook Park
CNChrysostomos Nicopoulos
Chrysostomos Nicopoulos
JKJongman Kim
Jongman Kim
NVN. Vijaykrishnan
N. Vijaykrishnan
CDChita R. Das
Chita R. Das
The notion of a nerwork-on-chip (NoC) is rapidly gaining a foothold as the communication fabric in complex system-on-chip (SoC) architectures. Scalability is the NoC's most valuable asset, which makes it ideal for larger designs. However, increasingly diminishing feature sizes have rendered the interconnect as the primary bottleneck in terms of both latency and power consumption in on-chip systems. It is, therefore, imperative to optimize the network infrastructure to maximize performance. Research has primarily focused on architectural improvements within the router and the development of deadlock avoidance/recovery schemes. The latter tend to rely on fairly complex algorithms, which are sometimes infeasible to implement in NoCs due to their resource-constrained nature. In this paper, we propose a new NoC topology and architecture which injects data into the network using four sub-NICs (network interface controllers), rather than one NIC, per node. It is shown that this scheme achieves significant improvements in network latency and energy consumption with only negligible area overhead and complexity over existing architectures. In fact, in the case of MESH network topologies, the proposed scheme provides substantial savings in area as well, because it requires fewer routers. Cycle-accurate simulation validates our assertions. Most importantly, it is also shown that this implementation is inherently deadlock-free, thus eliminating the need to rely on specialized, resource-hungry algorithms for deadlock avoidance

19 April 2008 in Telecommunication Systems
Verified
Journal Article
Closed access
PDF file
SYSungwon Yi
Sungwon Yi
XDXidong Deng
Xidong Deng
GKGeorge Kesidis
George Kesidis
CDChita R. Das
Chita R. Das