Preventing and slowing the spread of epidemics are achieved through techniques such as vaccination and social distancing. Given practical limitations on the number of vaccines and the cost of administration, optimization becomes a necessity. Previous approaches using mathematical programming methods have been shown to be effective but are limited by computational costs. In this work, we make several contributions: First, we present a new approach to intervention via maximizing the influence of vaccinated nodes on the network. We call this method PREEMPT. Next, we present a new parallel algorithm for PREEMPT, along with a CPU-GPU implementation. Our results demonstrate that PREEMPT is able to achieve significant speedups on Summit while improving the quality of solutions. This work represents a first-of-its-kind effort in parallelizing greedy hill climbing and applying it toward devising effective interventions for epidemics.