Characterizing and Optimizing EDA Flows for the Cloud
원문 초록
Cloud computing accelerates design space exploration in logic synthesis, and parameter tuning in physical design. However, deploying EDA jobs on the cloud requires EDA teams to deeply understand the characteristics of their jobs in cloud environments. Unfortunately, there has been little to no public information on these characteristics. Thus, in this paper, we formulate the problem of migrating EDA jobs to the cloud. First, we characterize the performance of four main EDA applications, namely: synthesis, placement, routing and static timing analysis. We show that different EDA jobs require different machine configurations. Second, using observations from our characterization, we propose a novel model based on Graph Convolutional Networks to predict the total runtime of a given application on different machine configurations. Our model achieves a prediction accuracy of 87%. Third, we develop a new formulation for optimizing cloud deployments in order to reduce deployment costs while meeting deadline constraints. We present a pseudo-polynomial optimal solution using a multi-choice knapsack mapping that reduces costs by 35.29%.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
GATES: Cost-aware Dynamic Workflow Scheduling via Graph Attention Networks and Evolution Strategy
Enhanced Outsourced and Secure Inference for Tall Sparse Decision Trees
InTec: integrated things-edge computing: a framework for distributing machine learning pipelines in edge AI systems
Persistence of Backdoor-based Watermarks for Neural Networks: A Comprehensive Evaluation
Toward Intelligent and Secure Cloud: Large Language Model Empowered Proactive Defense
All-in-one foundational models learning across quantum chemical levels
토론
이 논문과 연결된 포럼 글이 아직 없습니다.