multithread matrix

 public class MatrixMultiplicationMultithreaded {


    public static void main(String[] args) {
        int N = 500; // Matrix size (N x N)
       
        // Initializing matrices A and B
        int[][] A = new int[N][N];
        int[][] B = new int[N][N];
        int[][] C = new int[N][N]; // Result matrix

        // Randomly initializing matrices A and B
        initializeMatrix(A);
        initializeMatrix(B);

        // Multithreaded matrix multiplication
        long startTime = System.nanoTime();
        multiplyMatricesMultithreaded(A, B, C, N);
        long endTime = System.nanoTime();
       
        long duration = (endTime - startTime); // Time in nanoseconds
        System.out.println("Multithreaded Matrix Multiplication took: " + duration + " nanoseconds.");
    }

    // Initialize matrix with random values
    public static void initializeMatrix(int[][] matrix) {
        for (int i = 0; i < matrix.length; i++) {
            for (int j = 0; j < matrix[i].length; j++) {
                matrix[i][j] = (int)(Math.random() * 10); // Random values between 0 and 9
            }
        }
    }

    // Multithreaded Matrix Multiplication
    public static void multiplyMatricesMultithreaded(int[][] A, int[][] B, int[][] C, int N) {
        Thread[] threads = new Thread[N];

        // Each thread handles one row of the result matrix
        for (int i = 0; i < N; i++) {
            final int row = i;
            threads[i] = new Thread(() -> {
                for (int j = 0; j < N; j++) {
                    C[row][j] = 0;
                    for (int k = 0; k < N; k++) {
                        C[row][j] += A[row][k] * B[k][j];
                    }
                }
            });
            threads[i].start(); // Start the thread
        }

        // Wait for all threads to complete
        try {
            for (int i = 0; i < N; i++) {
                threads[i].join(); // Wait for thread to finish
            }
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }
}

Comments

Post a Comment

Popular posts from this blog

q3part b

  import java . util . Random ; public class TSPMutation {     public static void main( String [] args ) {         // Example cities (0, 1, 2, 3, 4)         int [] chromosome = { 0 , 1 , 2 , 3 , 4 }; // A possible solution (tour)                 System .out.println( "Original Chromosome:" );         printChromosome(chromosome);                 // Apply Mutation (Swap two cities in the path)         mutate(chromosome);                 System .out.println( "Mutated Chromosome:" );         printChromosome(chromosome);     }     // Mutation function: Swap two cities' positions     public static void mutate( int [] chromosome ) {         Random rand = new Random();           ...
Read more

Literal table

 #code import java.util.*; class Literal {     String value;     int address;     public Literal(String value) {         this.value = value;         this.address = -1; // not assigned yet     } } public class Ass2{     // Check if a literal already exists in the list     public static boolean literalExists(List<Literal> list, String value) {         for (Literal l : list) {             if (l.value.equals(value)) return true;         }         return false;     }     public static void main(String[] args) {         Scanner scanner = new Scanner(System.in);         List<String> code = new ArrayList<>();         List<Literal> literalTable = new ArrayList<>();         Lis...
Read more

quicksort 1

 import java.util.Random; public class QuicksortExample {     public static void main(String[] args) {         int N = 500; // Number of elements to sort         // Initialize an array of random integers         int[] arr = new int[N];         Random rand = new Random();         for (int i = 0; i < N; i++) {             arr[i] = rand.nextInt(1000); // Random integers between 0 and 999         }         // Displaying the unsorted array (optional)         System.out.println("Unsorted array:");         printArray(arr);         // Start measuring time         long startTime = System.nanoTime();         // Call the quicksort method         quicksort(arr, 0, N - 1);       ...
Read more