  We consider a full-duplex wireless Distributed Computing (DC) system under
the MapReduce framework. New upper and lower bounds on the optimal tradeoff
between Normalized Delivery Time (NDT) and computation load are presented. The
upper bound strictly improves over the previous reported upper bounds and is
based on a novel interference alignment (IA) scheme tailored to the
interference cancellation capabilities of MapReduce nodes. The lower bound is
proved through information-theoretic converse arguments.
