Best of Both Worlds: High Performance Interactive and Batch Launching
arXiv:2008.02223 · doi:10.1109/HPEC43674.2020.9286142
Abstract
Rapid launch of thousands of jobs is essential for effective interactive supercomputing, big data analysis, and AI algorithm development. Achieving thousands of launches per second has required hardware to be available to receive these jobs. This paper presents a novel preemptive approach to implement spot jobs on MIT SuperCloud systems allowing the resources to be fully utilized for both long running batch jobs while still providing fast launch for interactive jobs. The new approach separates the job preemption and scheduling operations and can achieve 100 times faster performance in the scheduling of a job with preemption when compared to using the standard scheduler-provided automatic preemption-based capability. The results demonstrate that the new approach can schedule interactive jobs preemptively at a performance comparable to when the required computing resources are idle and available. The spot job capability can be deployed without disrupting the interactive user experience while increasing the overall system utilization.
References in corpus (10)
- Interactive Supercomputing on 40,000 Cores for Machine Learning and Data Analysis
- Computing on Masked Data: a High Performance Method for Improving Big Data Veracity
- D4M 2.0 Schema: A General Purpose High Performance Schema for the Accumulo Database
- Achieving 100,000,000 database inserts per second using Accumulo and D4M
- D4M: Bringing Associative Arrays to Database Engines
- Enabling On-Demand Database Computing with MIT SuperCloud Database Management System
- Big Data Strategies for Data Center Infrastructure Management Using a 3D Gaming Platform
- Scalability of VM Provisioning Systems
- LLMapReduce: Multi-Level Map-Reduce for High Performance Data Analysis
- Benchmarking Data Analysis and Machine Learning Applications on the Intel KNL Many-Core Processor