What is the complexity class of exponential parallelism?

Consider the class of problems that can be computed when you have access to exponentially many processors working in parallel.

How does one capture that in a proper formalism? Is there some literature on it already? Would it be true that such a class would be a superset of BQP?