Let's back up a bit. I'll talk about parallelization below, but let's not focus on that for right now.  RegionPlot3D wasn't meant to handle this problem. It was meant to handle the common plotting tasks you'll find in the definition for the function. I'm not sure I understand your problem, but RegionPlot3D is not the answer.

You have over 1500 inequalities.
 - If each (or most of them) matter then you have a very very complicated 3D graphic you're trying to make. There's probably a better way of making it. You probably don't want a 3D graphic that complicated. Your eyes probably can't interpret the results.
 - If most of the inequalities are redundant or eliminatable, then you want to simplify the system of inequalities before working with it like this.
 - Maybe the case is inbetween and both of the bullet points above apply.

Without more information about the task, it's hard for me to say what should be done. Maybe each of the inequalities define a face on a surface. Maybe your problem is complicated and we need to talk to someone who does computational geometry. What is this thing you're trying to plot? If it is super complicated, why are you plotting it? What info are you trying to get out of the plot? Do all the inequalities have some form (like being linear inequalities? Quadratic?).

Parallelization is not an instant win.
It's important to understand a bit more about what the computation is actually doing and how parallel programming works.
RegionPlot3D is effectively making a 3D vector graphic using some adaptive sampling of some kind. The code for this isn't parallelizable either because it was not written for that or because the algorithm underneath it doesn't parallelize easily. The function does does some pretty complicated stuff in order to try drawing the shape with the fewest samples possible.
Something that would parallelize very easily: Sampling whether a large set of points satisfied the inequality or not.

Thank you, looks like what I need.  Would it be logical to assume that running evaluations on their 32 core system will be ~16 times faster than my 2 core in most cases?

Hmm I think it may be embarassingly parallel, not sure.  My code is a RegionPlot3D with thousands of inequalities defining many small regions bounded by planes, shown below.  I just tried parallelizing it and got :" cannot be parallelized; proceeding with sequential evaluation."  I'm not sure if this would be the proper way to make the code run in parallel.

otherregions  has been defined in a previous evaluation as   inequalities1 || inequalities2 || inequalities3 ..... inequalities1500 .   It is also noteworty is that I want to use a high number of PlotPoints (1000 or 1500), which seems to be the determining factor is slowing down evaluation.  So I guess my question boils down to...

What's the best way to optimize computation speed for a RegionPlot3D which is defined (mostly) by thousands of small regions bounded by planes (similar to a bunch of little cubes linked together) and uses PlotPoints > 1000 ?