Burak Aksar

Burak Aksar

Auto-generated profile, based on publicly available information

Burak Aksar

Boston University

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
11 November 2023
Verified
Conference Paper
Open access
BABurak Aksar
Burak Aksar
ESEfe Sencan
Efe Sencan
BSBenjamin Schwaller
Benjamin Schwaller
OAOmar Aaziz
Omar Aaziz
VLVitus J. Leung
Vitus J. Leung
ACAyse K. Coskun
Ayse K. Coskun
Performance variations caused by anomalies in modern High Performance Computing (HPC) systems lead to decreased efficiency, impaired application performance, and increased operational costs. While machine learning (ML)-based frameworks for automated anomaly detection (often based on time series telemetry data) are gaining popularity in the literature, practical deployment challenges are often overlooked. Some ML-based frameworks require extensive customization, while others need a rich set of labeled samples, none of which are feasible for a production HPC system. This paper introduces a variational autoencoder-based anomaly detection framework, Prodigy, that outperforms the state-of-the-art alternatives by achieving a 0.95 F1-score when detecting performance anomalies. The paper also provides a real system implementation of Prodigy that enables easy integration with monitoring frameworks and rapid deployment. We deploy Prodigy on a production HPC system and demonstrate 88% accuracy in detecting anomalies. Prodigy involves an interface to provide job- and node-level analysis and explanations for anomaly predictions.

13 February 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
BABurak Aksar
Burak Aksar
ESEfe Sencan
Efe Sencan
BSBenjamin Schwaller
Benjamin Schwaller
OAOmar Aaziz
Omar Aaziz
VLVitus J. Leung
Vitus J. Leung
ACAyse K. Coskun
Ayse K. Coskun
With the increasing scale and complexity of High-Performance Computing (HPC) systems, performance variations in applications caused by anomalies have become significant bottlenecks in system health and operational efficiency. As we move towards exascale systems, these variations become more prominent due to the increased sharing of resources. Such variations lead to lower energy efficiency and higher operational costs. To mitigate these problems, one must quickly and accurately diagnose the root cause of the anomalies at scale. One way to evaluate system health and identify the underlying causes is by manually examining certain performance metrics in telemetry data or using rule-based methods. Due to the daily size of telemetry data reaching terabytes and the fact that the numeric telemetry data contains thousands of metrics, manual analysis of telemetry to diagnose problems becomes challenging. Given these limitations, Machine Learning (ML)-based approaches have been gaining popularity as they have been shown to be effective and practical in diagnosing previously encountered performance anomalies. One primary challenge for supervised ML models is that they require a significant amount of labeled samples during training. However, obtaining many labels for anomalies is extremely difficult and costly, considering anomalies occur infrequently and real-world numeric system telemetry data is hard to label since it contains thousands of metrics. This paper proposes a novel active learning-based framework that diagnoses performance anomalies (i.e., identifying the type of an anomaly) in HPC systems at runtime using significantly fewer labeled samples compared to state-of-the-art ML-based approaches. We show that the proposed framework achieves the same F1-score compared to a supervised approach using much fewer labeled samples (i.e., 16x fewer samples for achieving a 0.78 F1-score, 11x fewer samples for achieving a 0.82 F1-score), even when there are previously unseen applications and application inputs in the test dataset.

17 June 2021
Verified
Book Chapter
Closed access
PDF file
BABurak Aksar
Burak Aksar
YZYijia Zhang
Yijia Zhang
EAEmre Ates
Emre Ates
BSBenjamin Schwaller
Benjamin Schwaller
OAOmar Aaziz
Omar Aaziz
ACAyse K. Coskun
Ayse K. Coskun

25 August 2021
Verified
Book Chapter
Closed access
PDF file
BABurak Aksar
Burak Aksar
BSBenjamin Schwaller
Benjamin Schwaller
OAOmar Aaziz
Omar Aaziz
VLVitus J. Leung
Vitus J. Leung
JBJim Brandt
Jim Brandt
ACAyse K. Coskun
Ayse K. Coskun

10 August 2023
Verified
Conference Paper
Open access
BABurak Aksar
Burak Aksar
ESEfe Sencan
Efe Sencan
BSBenjamin Schwaller
Benjamin Schwaller
VLVitus J. Leung
Vitus J. Leung
JBJim Brandt
Jim Brandt
ACAyse K. Coskun
Ayse K. Coskun

19 December 2023 in arXiv
Verified
Preprint
Open access
PDF file
BABurak Aksar
Burak Aksar
YRYara Rizk
Yara Rizk
TCTathagata Chakraborti
Tathagata Chakraborti
Chatbots have become one of the main pathways for the delivery of business automation tools. Multi-agent systems offer a framework for designing chatbots at scale, making it easier to support complex conversations that span across multiple domains as well as enabling developers to maintain and expand their capabilities incrementally over time. However, multi-agent systems complicate the natural language understanding (NLU) of user intents, especially when they rely on decentralized NLU models: some utterances (termed single intent) may invoke a single agent while others (termed multi-intent) may explicitly invoke multiple agents. Without correctly parsing multi-intent inputs, decentralized NLU approaches will not achieve high prediction accuracy. In this paper, we propose an efficient parsing and orchestration pipeline algorithm to service multi-intent utterances from the user in the context of a multi-agent system. Our proposed approach achieved comparable performance to competitive deep learning models on three different datasets while being up to 48 times faster.