EDBT 2026 Demo / reviewers in the wild / expert
Chandrasekhar Narayanaswami 0001
dblp:91/3542 · also Chandra Narayanaswami
· DBLP profile ↗
30ranked-venue papers
9as first author
9since 2021 · last 2026
0000-0002-4242-5352ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Human-computer interaction and ubiquitous computing · 8Databases, data management, data science and information retrieval · 7 · 3 first-author · 2 since 2021Artificial intelligence and machine learning · 6 · 1 first-author · 5 since 2021Systems, architecture and hardware · 6 · 3 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 1 since 2021Computer networks · 2Theory of computation · 2 · 2 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Agentic Solutions for IT Financial OperationsabstractThe dynamic nature of cloud spending and pricing structures pose challenges for practitioners in IT Financial Operations (FinOps). Recent advances in agentic systems enables them to instead rely on agents for complex FinOps tasks such as drawing insights from their data through natural language queries. In this work, we present an IT FinOps Data Insights Agent, that implements “chat with your data” approach to support practitioners in their daily tasks. Our agent achieves up to 90% accuracy across ITBench FinOps scenarios. Bekir O. Turkkan, Pavankumar Murali, Chandrasekhar Narayanaswami 0001, Vadim Sheinin |
AAAI | 3 |
| 2025 | CPU-Limits kill Performance: Time to rethink Resource Control
Chirag C. Shetty, Sarthak Chakraborty, Hubertus Franke, Larisa Shwartz, Chandrasekhar Narayanaswami 0001, Indranil Gupta, Saurabh Jha |
SoCC | 5 |
| 2025 | ITBench: Evaluating AI Agents across Diverse Real-World IT Automation TasksabstractRealizing the vision of using AI agents to automate critical IT tasks depends on the ability to measure and understand effectiveness of proposed solutions. We introduce ITBench, a framework that offers a systematic methodology for benchmarking AI agents to address real-world IT automation tasks. Our initial release targets three key areas: Site Reliability Engineering (SRE), Compliance and Security Operations (CISO), and Financial Operations (FinOps). The design enables AI researchers to understand the challenges and opportunities of AI agents for IT automation with push-button workflows and interpretable metrics. IT-Bench includes an initial set of 102 real-world scenarios, which can be easily extended by community contributions. Our results show that agents powered by state-of-the-art models resolve only 11.4% of SRE scenarios, 25.2% of CISO scenarios, and 25.8% of FinOps scenarios (excluding anomaly detection). For FinOps-specific anomaly detection (AD) scenarios, AI agents achieve an F1 score of 0.35. We expect ITBench to be a key enabler of AI-driven IT automation that is correct, safe, and fast. IT-Bench, along with a leaderboard and sample agent implementations, is available at https://github.com/ibm/itbench. Saurabh Jha, Rohan R. Arora, Yuji Watanabe, Takumi Yanagawa, Yinfang Chen, Jackson Clark, Bhavya, Mudit Verma, Hirokuni Kitahara, Noah Zheutlin, Saki Takano, Divya Pathak, Felix George, Xinbo Wu, Bekir O. Turkkan, Gerard Vanloo, Michael Nidd, Oishik Chatterjee, Pranjal Gupta, Suranjana Samanta, Pooja Aggarwal, Rong Lee, Jae-wook Ahn, Debanjana Kar, Amit M. Paradkar, Yu Deng 0004, Pratibha Moogi, Prateeti Mohapatra, Naoki Abe, Chandrasekhar Narayanaswami 0001, Tianyin Xu, Lav R. Varshney, Ruchi Mahindru, Anca Sailer, Larisa Shwartz, Daby M. Sow, Nicholas C. Fuller, Ruchir Puri |
ICML | 32 |
| 2025 | Practical Contextual Bandits for Large-Scale Structured Discrete Constrained Optimization ProblemsabstractWe address the contextual bandit problem for high-dimensional combinatorial action spaces involving a class of structured discrete constrained optimization problems. In this setting, key quantities within the optimization formulation, such as performance indicators contributing to the objective or constraints, must be estimated from data during the trial sequence of optimized actions. These problems frequently arise in the many operations management domains including IT resource allocation and retail assortment price optimization. We propose a novel, practical, and transparent approach based on general-purpose regression oracles, leveraging Inverse Gap Weighting (IGW) for seamless integration within an optimization framework. IGW sampling is efficiently managed by: (a) a column generation reformulation of the underlying Mixed Integer Programming (MIP) model which allows for flexible lower-level predictors, causal coherence, and efficient representation of large action spaces;(b) a diverse solution pool generation to balance the exploration-exploitation trade-off in large action spaces. To address non-smoothness in the reward function due to optimization constraints, we incorporate a risk-averse phased learning strategy. We validate our approach on a real-world auto-scaling problem in IT automation, achieving a significant reduction in cumulative regret through skillful exploration, with additional gains from risk-averse methods that effectively manage constraint violations. Pavithra Harsha, Naoki Abe, Shivaram Subramanian, Amadou Ba, Kevin Arturo Fernández Román, Mauricio Longinos Garrido, Chandrasekhar Narayanaswami 0001 |
KDD (2) | 8 |
| 2025 | Story of Two GPUs: Characterizing the Resilience of Hopper H100 and Ampere A100 GPUsabstractThis study characterizes GPU resilience in Delta, a large-scale AI system that consists of 1,056 A100 and H100 GPUs, with over 1,300 petaflops of peak throughput. We used 2.5 years of operational data (11.7 million GPU hours) on GPU errors. Our major findings include: (i) H100 GPU memory resilience is worse than A100 GPU memory, with 3.2x lower per-GPU MTBE for memory errors, (ii) The GPU memory error-recovery mechanisms on H100 GPUs are insufficient to handle the increased memory capacity, (iii) H100 GPUs demonstrate significantly improved GPU hardware resilience over A100 GPUs with respect to critical hardware components, (iv) GPU errors on both A100 and H100 GPUs frequently result in job failures due to the lack of robust recovery mechanisms at the application level, and (v) We project the impact of GPU node availability on larger-scales and find that significant overprovisioning of 5% is necessary to handle GPU failures. Shengkun Cui, Archit Patke, Aditya Ranjan, Ziheng Chen 0006, Phuong Cao, Gregory H. Bauer, Brett M. Bode, Catello Di Martino, Saurabh Jha, Chandrasekhar Narayanaswami 0001, Daby M. Sow, Zbigniew T. Kalbarczyk, Ravishankar K. Iyer |
SC | 11 |
| 2024 | SAM: Subseries Augmentation-Based Meta-Learning for Generalizing AIOps Models in Multi-Cloud MigrationabstractIn the context of cloud computing, enterprises are increasingly adopting multi-cloud strategies to enhance performance, ensure cost efficiency, and avoid vendor lock-in. This trend presents a significant challenge for the migration of AI for IT operations (AIOps) models across different cloud providers due to variations in architecture, performance, and data distribution. Traditional methods of re-training AIOps models for new cloud environments are labor-intensive and delay deployment. To address this issue, we introduce a novel framework called SAM (Subseries Augmentation-based Meta-learning), which facilitates seamless model migration between clouds without the need for re-training from scratch. SAM leverages data augmentation and meta-learning to efficiently adapt AIOps models to new cloud environments. It has proven effective in adapting anomaly detectors across various config-urations over both public and simulated datasets. We believe that SAM can also be adapted to other AI models used for automating IT tasks such as alerting and resource scaling. Paulito Palmes, Saurabh Jha, Bekir O. Turkkan, Gerard Vanloo, Frank Bagehorn, Chandrasekhar Narayanaswami 0001, Larisa Shwartz, Naoki Abe, Yu Deng 0004, Daby M. Sow |
CLOUD | 7 |
| 2024 | Optimizing IT FinOps and Sustainability through Unsupervised Workload CharacterizationabstractThe widespread adoption of public and hybrid clouds, along with elastic resources and various automation tools for dynamic deployment, has accelerated the rapid provisioning of compute resources as needed. Despite these advancements, numerous resources persist unnecessarily due to factors such as poor digital hygiene, risk aversion, or the absence of effective tools, resulting in substantial costs and energy consumption. Existing threshold-based techniques prove inadequate in effectively addressing this challenge. To address this issue, we propose an unsupervised machine learning framework to automatically identify resources that can be de-provisioned completely or summoned on a schedule. Application of this approach to enterprise data has yielded promising initial results, facilitating the segregation of productive workloads with recurring demands from non-productive ones. Rohan R. Arora, Saurabh Jha, Chandrasekhar Narayanaswami 0001, Cheuk Lam, Jerrold Leichter, Yu Deng 0004, Daby M. Sow |
AAAI | 4 |
| 2024 | Queue Management for SLO-Oriented Large Language Model ServingabstractLarge language model (LLM) serving is becoming an increasingly critical workload for cloud providers. Existing LLM serving systems focus on interactive requests, such as chatbots and coding assistants, with tight latency SLO requirements. However, when such systems execute batch requests that have relaxed SLOs along with interactive requests, it leads to poor multiplexing and inefficient resource utilization. To address these challenges, we propose QLM, a queue management system for LLM serving. QLM maintains batch and interactive requests across different models and SLOs in a request queue. Optimal ordering of the request queue is critical to maintain SLOs while ensuring high resource utilization. To generate this optimal ordering, QLM uses a Request Waiting Time (RWT) Estimator that estimates the waiting times for requests in the request queue. These estimates are used by a global scheduler to orchestrate LLM Serving Operations (LSOs) such as request pulling, request eviction, load balancing, and model swapping. Evaluation on heterogeneous GPU devices and models with real-world LLM serving dataset shows that QLM improves SLO attainment by 40-90% and throughput by 20-400% while maintaining or improving device utilization compared to other state-of-the-art LLM serving systems. QLM's evaluation is based on the production requirements of a cloud provider. QLM is publicly available at https://www.github.com/QLM-project/QLM. Archit Patke, Dhemath Reddy, Saurabh Jha, Haoran Qiu, Christian Pinto, Chandrasekhar Narayanaswami 0001, Zbigniew T. Kalbarczyk, Ravishankar K. Iyer |
SoCC | 6 |
| 2023 | Hierarchical Proxy Modeling for Improved HPO in Time Series ForecastingabstractSelecting the right set of hyperparameters is crucial in time series forecasting. The classical temporal cross-validation framework for hyperparameter optimization (HPO) often leads to poor test performance because of a possible mismatch between validation and test periods. To address this test-validation mismatch, we propose a novel technique, H-Pro to drive HPO via test proxies by exploiting data hierarchies often associated with time series datasets. Since higher-level aggregated time series often show less irregularity and better predictability as compared to the lowest-level time series which can be sparse and intermittent, we optimize the hyperparameters of the lowest-level base-forecaster by leveraging the proxy forecasts for the test period generated from the forecasters at higher levels. H-Pro can be applied on any off-the-shelf machine learning model to perform HPO. We validate the efficacy of our technique with extensive empirical evaluation on five publicly available hierarchical forecasting datasets. Our approach outperforms existing state-of-the-art methods in Tourism, Wiki, and Traffic datasets, and achieves competitive result in Tourism-L dataset, without any model-specific enhancements. Moreover, our method outperforms the winning method of the M5 forecast accuracy competition. Arindam Jati, Vijay Ekambaram, Shaonli Pal, Brian Quanz, Wesley M. Gifford, Pavithra Harsha, Stuart Siegel, Sumanta Mukherjee, Chandrasekhar Narayanaswami 0001 |
KDD | 9 |
| 2010 | A client-server architecture for state-dependent dynamic visualizations on the webabstractAs sophisticated enterprise applications move to the Web, some advanced user experiences become difficult to migrate due to prohibitively high computation, memory, and bandwidth requirements. State-dependent visualizations of large-scale data sets are particularly difficult since a change in the client’s context necessitates a change in the displayed results. This paper describes a Web architecture where clients are served a session-specific image of the data, with this image divided into tiles dynamically generated by the server. This set of tiles is supplemented with a corpus of metadata describing the immediate vicinity of interest; additional metadata is delivered as needed in a progressive fashion in support and anticipation of the user’s actions. We discuss how the design of this architecture was motivated by the goal of delivering a highly responsive user experience. As an example of a complete application built upon this architecture, we present OrgMaps, an interactive system for navigating hierarchical data, enabling fluid, low-latency navigation of trees of hundreds of thousands of nodes on standard Web browsers using only HTML and JavaScript. Daniel M. Coffman, Danny Soroker, Chandrasekhar Narayanaswami 0001, Aaron Zinman |
WWW | 3 |
| 2009 | Message from the Technical Program Chairs
Chatschik Bisdikian, Silvia Giordano, Chandrasekhar Narayanaswami 0001, Albrecht Schmidt 0001 |
PerCom | 3 |
| 2009 | Guest editorial: Special issue on pervasive computing and communications (PerCom) 2009
Chatschik Bisdikian, Silvia Giordano, Chandrasekhar Narayanaswami 0001, Albrecht Schmidt 0001 |
Pervasive Mob. Comput. | 3 |
| 2008 | Modeling and Managing Mobile Commerce Spaces Using RESTful Data ServicesabstractThis paper advocates the use of RESTful data services in mobile commerce information spaces. REST is a restriction of web services to a simple protocol centered on a limited set of access operations against data resources. This paper analyzes how REST may be used as a general design principle for mobile commerce spaces. This analysis is threefold. First, it provides an abstract component model that contains a minimal embodiment of the REST functionality needed to support mobile commerce. Second, it describes and analyzes the operation of a mobile commerce space, resulting in a reference REST-based data decomposition that may be reused across a variety of domains. Third, it provides and analyzes a set of usage cases in the mobile commerce domain, which can form the basis of future REST-oriented programming models and tools. This analysis is based on a substantial mobile commerce framework we have implemented, called Celadon. This framework is currently being used to demonstrate several ambitious mobile commerce applications. Scott McFaddin, Daniel M. Coffman, J. H. Han, H. K. Jang, J. K. Lee, Y. S. Moon, Chandrasekhar Narayanaswami 0001, Y. S. Paik, J. W. Park, Danny Soroker |
MDM | 9 |
| 2008 | User-driven visual mashups in interactive public spacesabstractSearching and presenting rich data using mobile devices is hard given their inherent I/O limitations. One approach for alleviating these limitations is device symbiosis, whereby the interaction with one’s personal mobile device is augmented by additionally engaging with more capable infrastructure d Danny Soroker, Y. S. Paik, Y. S. Moon, Scott McFaddin, Chandrasekhar Narayanaswami 0001, H. K. Jang, Daniel M. Coffman, J. K. Lee, J. W. Park |
MobiQuitous | 5 |
| 2006 | Prototyping retractable string-based interaction techniques for dual-display mobile devicesabstractAccessing information on mobile and wearable devices often requires the user's visual attention, and the precise operation of virtual or physical widgets. However, these interactions may sometimes be too time-consuming and socially inappropriate. To address this, we introduce a novel input/output device that is based on the manipulation of a retractable string in a polar coordinate frame. Depending on how the user pulls the string from its enclosure--to a particular length, at a particular angle--various system features may be directly accessed. Furthermore, we present our concept for a 1D pixel array, embedded in the string that may be used as a secondary 1D display. Since it is possible to unwind the display itself and trigger functionality with a single pull, information may be accessed and presented quickly, and perceived at a glance. We present scenarios for how the string input/output device may be used in conjunc-tion with the mobile device's primary 2D display and describe our augmented reality proof-of-concept prototype. Gábor Blaskó, Chandrasekhar Narayanaswami 0001, Steven K. Feiner |
CHI | 2 |
| 2006 | Inverted Browser: A Novel Approach towards Display SymbiosisabstractIn this paper we introduce the inverted browser, a novel approach to enable mobile users to view content from their personal devices on public displays. The inverted browser is a network service to start and control a browser that is then used to view the content. In contrast to a traditional Web browser, which runs on the client device and pulls content from a server, content is pushed to the inverted browser from a personal data source upon user input. This approach allows a wide variety of personal content to be viewed by facilitating symbiotic relationships between mobile devices and intelligent displays in the environment. Our initial inverted browser prototype is based on a Web services wrapper around a traditional Web browser. Our experiments show that the inverted browser approach is superior to other solutions in terms of user convenience, ease of use, energy consumption, and privacy, but interaction latencies need improvement. Mandayam T. Raghunath, Nishkam Ravi, Marcel-Catalin Rosu, Chandrasekhar Narayanaswami 0001 |
PerCom | 4 |
| 2006 | PowerNap: An Efficient Power Management Scheme for Mobile DevicesabstractWe present PowerNap, an OS power management scheme, which can significantly improve the battery life of mobile devices. The key feature of PowerNap is the skipping of the periodic system timer ticks associated with the operating system. On an idle device, this modification increases the time between successive timer interrupts and enables us to put the processor/system into a more efficient low power state. This saves the energy consumed by workless timer interrupts and the excess energy consumed by the processor in less efficient low power states. PowerNap is tightly integrated with the kernel and is designed for optimal control of the latency and energy associated with transitioning in and out of the low power states. We describe an implementation of PowerNap and its impact on system software. Experiments with IBM's WatchPad verify the ability of PowerNap to extend battery life. An analytical model that quantifies the ability of the scheme to reduce power is also presented. The model is in good agreement with experimental results. We apply the model to small form-factor devices which use processors that have a PowerDown state. In such devices, PowerNap may extend battery life by more than 42 percent for small processor workloads and for background power levels below 10 mW. C. Michael Olsen, Chandrasekhar Narayanaswami 0001 |
IEEE Trans. Mob. Comput. | 2 |
| 2005 | Form Factors for Mobile Computing and Device SymbiosisabstractSeveral novel portable and wearable form factors have been prototyped at IBM over the last eight years. Each of the different form factors has some unique advantages and addresses different user needs. This invited paper present our experience building these prototypes and describe how improvements in technology have advanced our prototypes over time. Recently we have been investigating the middleware necessary to use a collection of devices symbiotically to address some of the limitations of each form factor. Drawbacks of some form factors include battery, small screen size, limited bandwidth and limited user interface capability. However form factors with such limitations also typically come with several advantages, i.e., they are always with you and provide a private display and a trusted platform. The paper sketches a few applications that could use devices symbiotically and outline some of the challenges that need to be overcome to enable this symbiosis. Chandrasekhar Narayanaswami 0001 |
ICDAR | 1 |
| 2005 | Wearable computing: a catalyst for business and entertainmentabstractA variety of portable and wearable device form factors such as the VisionPad, WatchPad, WearableData, MetaPad, Personal Mobile Hub, and SoulPad have been prototyped at IBM Research over the last several years. Each of different form factors has some unique advantages and addresses different user needs. This talk will present our experience building these prototypes and describe how we expect this landscape of devices to change. The continuous availability of wearable and mobile devices enables the deployment of many novel applications and scenarios but places heavy demands on energy, infrastructure support, and usability. Recently we have been investigating how some of the inherent limitations of mobile devices can be alleviated by symbiosis with more powerful stationary devices. Effective device symbiosis requires middleware that addresses device heterogeneity, improves usability, provides privacy and ensures security. The availability of a variety of new form factors coupled with device symbiosis will catalyze the way we conduct business, entertain and take care of ourselves Chandrasekhar Narayanaswami 0001 |
ISLPED | 1 |
| 2005 | Reincarnating PCs with portable SoulPadsabstractThe ability to walk up to any computer, personalize it, and use it as one's own has long been a goal of mobile computing research. We present SoulPad, a new approach based on carrying an auto-configuring operating system along with a suspended virtual machine on a small portable device. With this approach, the computer boots from the device and resumes the virtual machine, thus giving the user access to his personal environment, including previously running computations. SoulPad has minimal infrastructure requirements and is therefore applicable to a wide range of conditions, particularly in developing countries. We report our experience implementing SoulPad and using it on a variety of hardware configurations. We address challenges common to systems similar to SoulPad, and show that the SoulPad model has significant potential as a mobility solution. Ramón Cáceres, Casey Carter, Chandrasekhar Narayanaswami 0001, Mandayam T. Raghunath |
MobiSys | 3 |
| 2005 | Unleashing the Power of Wearable Devices in a SIP InfrastructureabstractThe session initiation protocol (SIP) has been widely adopted for instant messaging (IM) and VoIP telephony both by the enterprise and in service provider systems. Till now, SIP functionality has been accessible to end-users primarily via computing platforms such as an IM client on a laptop or on communication platforms such as an IP phone or a cell phone. We show that wearable devices such as the IBM Linux Watch (WatchPad/spl trade/) can play a powerful role as a control device in a SIP infrastructure, given their easily accessible, always available, and visible user-interfaces. We have designed and prototyped several key control applications, using a SIP User Agent on the WatchPad, such as the ability to initiate and route incoming and outgoing phone calls, receive simple queries as instant messages, and call initiation based on address books residing on wearable devices. We discuss other examples such as video conferencing and the authentication layer for workflow. Our investigation and implementation shows that wearable devices can plug an important gap and significantly enhance user experience. Arup Acharya, Stefan Berger, Chandrasekhar Narayanaswami 0001 |
PerCom | 3 |
| 2005 | Using Symbiotic Displays to View Sensitive Information in PublicabstractSymbiotic displays are intelligent network devices that can be enlisted on demand by mobile devices, offering higher resolutions and larger viewing areas. Users of small mobile devices can consequently map various kinds of information to the displays that are most appropriate for comfortably viewing them. The availability of these displays in public areas, where passersby may glimpse another's sensitive information, introduces a privacy issue. To address this, we suggest a technique that combines the blurring of sensitive words on the public symbiotic display with a user interface that allows these words to be read on the display of a personal mobile device. We describe three ways in which such interactions can be enabled and discuss the architectural trade-offs associated with these approaches. We also describe a prototype implementation of an email reading application utilizing an IBM WatchPad and an Everywhere Display projector. This prototype was demonstrated at PerCom'04 Stefan Berger, Rick Kjeldsen, Chandrasekhar Narayanaswami 0001, Claudio S. Pinhanez, Mark Podlaseck, Mandayam T. Raghunath |
PerCom | 3 |
| 2002 | User Interfaces for Applications on a Wrist Watch
Mandayam T. Raghunath, Chandrasekhar Narayanaswami 0001 |
Pers. Ubiquitous Comput. | 2 |
| 1996 | Superscalar RISC machines, straight-line programs, and graphics
Chandrasekhar Narayanaswami 0001 |
Vis. Comput. | 1 |
| 1996 | A parallel polygon-clipping algorithm
Chandrasekhar Narayanaswami 0001 |
Vis. Comput. | 1 |
| 1995 | Efficient Parallel Gouraud Shading and Linear Interpolation over TrianglesabstractAbstract A parallel raster algorithm to draw Gouraud shaded triangles is presented. At the heart of the algorithm is a new constrained parallel edge‐traversal technique. This parallel traversal represents an increased level of parallelism compared to the existing solutions. Next, traditional algorithms take different amounts of time to advance from one horizontal span to another for the left edge and the right edge of the triangle when the slope of one of the edges is more than one and that of the other edge is less than one. This causes one processor to wait for another processor. The parallel constrained edge traversal technique removes this problem by directly jumping from one span to the next. It also ensures that adjacent triangles that share an edge do not share any pixels. Moreover, no cracks occur between adjacent polygons. Unlike some existing algorithms whose complexity depends on the size of the bounding box of the triangle, the complexity of our algorithm is solely dependenton the perimeter and area of the triangle. Due to the above features, the algorithm presented here exposes a greater degree of parallelism at considerably lesser cost and achieves better processor utilization, compared to existing algorithms for this problem1, 2, 3, 4, 5, 6. The algorithm is well suited for hardware implementation. Chandrasekhar Narayanaswami 0001 |
Comput. Graph. Forum | 1 |
| 1994 | Approximating chin Efficiently
Chandrasekhar Narayanaswami 0001, William L. Luken |
Inf. Process. Lett. | 1 |
| 1992 | Boolean Combinations of Polygons in Parallel
Chandrasekhar Narayanaswami 0001, W. Randolph Franklin |
ICPP (3) | 1 |
| 1992 | Edge Intersection on the Hypercube Computer
Chandrasekhar Narayanaswami 0001, W. Randolph Franklin |
Inf. Process. Lett. | 1 |
| 1991 | A Practical Convex Hull Algorithm
Chandrasekhar Narayanaswami 0001 |
ICPP (3) | 1 |