Develop a C++ program to find all prime numbers within a given range using parallel processing, making use of multiple cores to speed up the computation. The program should take the start and end integers of the range as input and display all prime numbers within that range.

def isPrime(n):
    if n==1:
        return False
    if n==2:
        return True
    if n%2==0 and n>2:
        return False
    i=3
    while i*i<=n:
        if n%i==0:
            return False
        i=i+2
    return True

x=int(input('Enter From: '))
y=int(input('Enter To: '))

for num in range(x,y):
    if isPrime(num):
        print(num)