A financial services company runs a high-throughput processing application on AWS. The application has two primary compute requirements: a web-tier backend running on Amazon ECS using AWS Fargate that requires a continuous, predictable baseline of vCPUs and GB RAM 24/7, scaling up during peak business hours; and a batch-tier risk analysis job that runs nightly for hours, requiring up to vCPUs of highly parallelized, fault-tolerant compute that checkpoints its state to Amazon DynamoDB. The application's database layer runs on an Amazon Aurora PostgreSQL DB cluster. Which two options should the solutions architect select to design a hosting and purchasing strategy that minimizes costs while meeting these requirements?
- Purchase a Compute Savings Plan to cover the continuous 24/7 baseline of the Amazon ECS tasks running on AWS Fargate.Answer
- Deploy the batch processing tier on Amazon EC2 Spot Instances using an EC2 Fleet with a capacity-optimized allocation strategy.Answer
- CPurchase an EC2 Instance Savings Plan to lower the cost of the Amazon Aurora PostgreSQL database instances.
- DRe-architect the 6-hour batch processing workload to run on AWS Lambda functions to leverage scale-to-zero billing.
- EPurchase an EC2 Instance Savings Plan to cover the 24/7 baseline usage of the Amazon ECS tasks running on AWS Fargate.
Answer
The correct strategy is to purchase a Compute Savings Plan for the steady-state Fargate tasks and deploy the fault-tolerant batch tier on Amazon EC2 Spot Instances.
Purchasing a Compute Savings Plan covers the continuous 24/7 baseline of the Amazon ECS tasks running on AWS Fargate. Deploying the batch processing tier on Amazon EC2 Spot Instances with a capacity-optimized allocation strategy minimizes compute costs for a parallelized, fault-tolerant workload that checkpoints its state.
Step-by-Step Solution
Key Concept
Selecting and combining cost-effective compute options (Compute Savings Plans, Spot Instances) based on workload stability, duration, tolerance to interruption, and service scope constraints.
Estimated Time:3m 0s