/github/workspace/src/MatrixFunctions/mat_mult/plp_mat_mult_q8_parallel.c

Functions

	Name
void	plp_mat_mult_q8_parallel(const int8_t restrict pSrcA, const int8_t restrict pSrcB, uint32_t M, uint32_t N, uint32_t O, uint32_t shift, uint32_t nPE, int8_t *restrict pDstC) Glue code for parallel matrix mutliplication of 8-bit fix-point matrices.

Functions Documentation

function plp_mat_mult_q8_parallel

void plp_mat_mult_q8_parallel(
    const int8_t *__restrict__ pSrcA,
    const int8_t *__restrict__ pSrcB,
    uint32_t M,
    uint32_t N,
    uint32_t O,
    uint32_t shift,
    uint32_t nPE,
    int8_t *__restrict__ pDstC
)

Glue code for parallel matrix mutliplication of 8-bit fix-point matrices.

Parameters:

• pSrcA points to the first input matrix
• pSrcB points to the second input matrix
• M height of the first input matrix
• N width of the first input matrix and hight of the second
• O width of the second input matrix
• shift Amount to shift the result of each multiplication.
• nPE Number of cores to use
• pDstC points to the output matrix

Return: none

Par: Fix-Point and Shifting

The result will be shifted by the parameter shift to the right (multiplied by 2^-shift). Assume that matrix A is represented as pSrcA * 2^-x, and matrix B as pSrcB * 2^-y (in other words, A has it's x last digits after the binary point). Then, the output is represented as pDstC * 2^-(x + y - shift).

Glue code for parallel matrix matrix multiplication of a 8-bit fix-point matrices.

The output of the matrix multiplication will also be stored as an 8-bit array. Set the shift parameter such that no overflow ocurrs.

Source code

/* =====================================================================
 * Project:      PULP DSP Library
 * Title:        plp_mat_mult_i8_parallel.c
 * Description:  parallel 8-bit integer matrix multiplication glue code
 *
 * $Date:        18. July 2019
 * $Revision:    V0
 *
 * Target Processor: PULP cores
 * ===================================================================== */
/*
 * Copyright (C) 2020 ETH Zurich and University of Bologna.
 *
 * Author: Tibor Schneider, ETH Zurich
 *
 * SPDX-License-Identifier: Apache-2.0
 *
 * Licensed under the Apache License, Version 2.0 (the License); you may
 * not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an AS IS BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#include "plp_math.h"

void plp_mat_mult_q8_parallel(const int8_t *__restrict__ pSrcA,
                              const int8_t *__restrict__ pSrcB,
                              uint32_t M,
                              uint32_t N,
                              uint32_t O,
                              uint32_t shift,
                              uint32_t nPE,
                              int8_t *__restrict__ pDstC) {

    if (hal_cluster_id() == ARCHI_FC_CID) {
        printf("parallel processing supported only for cluster side\n");
        return;
    } else {
        plp_mat_mult_instance_q8 args = { .pSrcA = pSrcA,
                                          .pSrcB = pSrcB,
                                          .M = M,
                                          .N = N,
                                          .O = O,
                                          .shift = shift,
                                          .nPE = nPE,
                                          .pDstC = pDstC };
        hal_cl_team_fork(nPE, plp_mat_mult_q8p_xpulpv2, (void *)&args);
    }
}

---

Updated on 2023-03-01 at 16:16:33 +0000