can somone please help me go through this and ghow to do it and understand it Co

Question

can somone please help me go through this and ghow to do it and understand it

Consider a system of 9 processes, P = {p_1, p_2, ...p_8, p_9}. Associated with the system are 6 memory cells. M = {M1, M2, ...., M5, M6}. The domain and range for each process is given in the following table: In addition, you are given the following precedence relation: rightarrow = {(1, 2), (1, 6) (2, 3), (2, 4) (2, 5), (3, 6), (3, 8), (4, 6), (4, 7), (5, 7), (5, 8), (6, 8), (6, 9), (7, 9), (8, 9)} a. Construct the Precedence Graph (not containing redundant edges). b. Determine if the system above is determinate. If it is not, add to rightarrow necessary elements to make it determinate

Explanation / Answer

.data sizes: .asciiz"Enter N:" Er: .asciiz" Enter again: " print1: .asciiz" Mat1:" .align 2 space: .asciiz" " newline: .asciiz" " print2: .asciiz" Mat2:" .align 2 print3: .asciiz" Mat3:" .align 2 matrix1: .space 262140 # for storing arrays of 65535 matrix2: .space 262140 # for arrays of size 65535 matrix3: .space 262140 .text .globl main main: la $a0, sizes li $v0, 4 syscall li $v0, 5 syscall move $s0, $v0 la $a0, print1 li $v0, 4 syscall li $t4, 11 li $t1, 0 # i = 0 L1: li $t2, 0 # j = 0 la $a0, newline li $v0, 4 syscall loop1: mul $t3, $t1, $s0 # i * n add $t3, $t1, $t2 # i * n + j sll $t3, $t3, 2 # 4 * (i * n + j) # Generating random Numbers using tauswothe Algorithm sll $t5, $t4, 3 xor $t5, $t4, $t5 srl $t5, $t5, 4 xor $t4, $t5, $t4 and $t4, $t4, 24 add $t4, $t4, $t3 sw $t4, matrix1($t3) add $a0, $t4, $zero li $v0, 1 syscall la $a0, space li $v0, 4 syscall add $t2, $t2, 1 bne $t2, $s0, loop1 add $t1, $t1, 1 bne $t1, $s0, L1 la $a0, print2 li $v0, 4 syscall li $t4, 17 li $t1, 0 # i = 0 L2: li $t2, 0 # j = 0 la $a0, newline li $v0, 4 syscall loop2: mul $t3, $t1, $s0 #i * n add $t3, $t1, $t2 #i * n + j sll $t3, $t3, 2 #4 * (i * n + j) # Generating random Numbers using tausworthe Algorithm sll $t5, $t4, 2 xor $t5, $t4, $t5 srl $t5, $t5, 3 xor $t4, $t5, $t4 and $t4, $t4, 31 add $t4, $t4, $t3 sw $t4, matrix2($t3) add $a0, $t4, $zero li $v0, 1 syscall la $a0, space li $v0, 4 syscall add $t2, $t2, 1 bne $t2, $s0, loop2 add $t1, $t1, 1 bne $t1, $s0, L2 # MuLtiplication Loops li $t1, 0 # i = 0 K1: li $t2, 0 # j = 0 K2: li $t3, 0 # k = 0 add $s1, $zero, $zero inner: mul $s3, $t1, $s0 # i * n add $s4, $s3, $t3 # i * n + k sll $s4, $s4, 2 # 4 * (i * n + k) lw $t4, matrix1($s4) mul $s3, $t3, $s0 # k * n add $s4, $s3, $t2 # k * n + j sll $s4, $s4, 2 # 4 * (k * n + j) lw $t5, matrix2($s4) mul $t6, $t4, $t5 # x[i][k] * y[k][j] add $s1, $s1, $t6 # z[i][j] = z[i][j] + x[i][k] * y[k][j] add $t3, $t3, 1 bne $t3, $s0, inner mul $s3, $t1, $s0 #i*n add $s4, $s3, $t2 #i*n+j sll $s4, $s4, 2 #4*(i*n+j) sw $s1, matrix3($s4) add $t2, $t2, 1 #j=j+1 bne $t2, $s0, K2 #test loop condition add $t1, $t1, 1 #i=i+1 bne $t1, $s0, K1 #test loop condition la $a0, print3 li $v0, 4 syscall li $t1, 0 #i=0 L3: li $t2, 0 #j=0 la $a0, newline li $v0, 4 syscall loop3: mul $t3, $t1, $s0 # i * n add $t3, $t1, $t2 # i * n + j sll $t3, $t3, 2 # 4 * (i * n + j) lw $t4, matrix3($t3) add $a0, $t4, $zero li $v0, 1 syscall la $a0, space li $v0, 4 syscall add $t2, $t2, 1 bne $t2, $s0, loop3 add $t1, $t1, 1 bne $t1, $s0, L3 li $v0, 10 syscall

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.