我正在学习python并行编程，我得到了这样的代码

import multiprocessing
import random
import time

def merge_buckets(final_bucket,bucket):
    helper=0
    for i in bucket:
        for j in i:
            final_bucket[helper].append(j)
        helper += 1
    return final_bucket
def radix_sort(array,start,end,digit,helper,result_queue):
        bucket = [[] for _ in range(10)]
        #cisklus ktory prechadza polom cisel a rozdelujem ich do bucketov
        for k in range(start,end):

            num = array[k]
            print(num)
            string_number = str(num)
            if(num < digit):
                bucket[0].append(num)
            else:
                #print((max_digits-helper),"=",num)
                bucket[int(str(num)[len(str(num))-helper])].append(num)
        result_queue.put(bucket)
        #reset pola cisel do ktoreho sa znovu vyhodia novo usporiadane cisla z bucketu
        #musi byt dakde ale ne tu dakde v dajakom inom proces
        #navysenie pocitadiel

if __name__ == '__main__':
    cores = int(input("Cores : "))
    array = [random.randint(0, 100) for _ in range(1000)]
    lock = multiprocessing.Lock()
    #arr = multiprocessing.Array('i',[3, 5, 1, 18, 25, 4, 17, 22, 31, 6, 89, 92, 7], lock=lock)
    #bucket = multiprocessing.Array ('i',[[] for _ in range(10)],lock=lock)
    manager = multiprocessing.Manager()
    arr = manager.list([3, 5, 1, 18, 25, 4, 17, 22, 31, 6, 89, 92, 7])

    # vybere maximalnu hodnotu z pola
    max_val = max(array)
    print("Maximum of numbers: ", max_val)
    # digit znamena ze ci polom prechadzame ze 1 , 10 , 100 ako ide radix zoraduje od poslednej cislice
    digit = 1


    num = len(array)//cores

    zvysok = len(array)%cores

    parts = []
    for i in range(cores):
        if(zvysok != 0):
            parts.append(num + 1)
            zvysok -= 1
        else:
            parts.append(num)

    result_queue = multiprocessing.Queue()
    start = time.time()
    helper = 1
    while(max_val // digit > 0):
        print(array[:20])
        results = []
        result_queue = multiprocessing.Queue()
        processes = []
        j = 0
        bucket = [[] for _ in range(10)]
        for o in parts:
            p = multiprocessing.Process(target=radix_sort, args=(array,j,j+o,digit,helper,result_queue))
            p.start()
            processes.append(p)
            j += o

        for p in processes:
            p.join()

        results = []
        for _ in range(len(parts)):
            results.append(result_queue.get())
        for result in results:
            bucket = merge_buckets(bucket,result)
        array = []
        for i in bucket:
            for j in i:
                array.append(j)
        for p in processes:
            p.terminate()

        digit *= 10
        helper = helper + 1
    end = time.time()
    #array = radix_sort(array)
    print(array)
    print("Cas : ", end - start)

我想问你我该怎么做现在你可以看到我为数字中的每个位置制作线程，比如如果有2个数字，我设置8个核心程序，程序会制作16个。如果有3个数字，我会制作24个。所以我知道在多处理中有一些同步工具，但我不知道如何将它们应用到基数排序中。有人想不出如何做到这一点的方法。我会很高兴的。