Preview

Chapter 7-Matrix multiplication slides from Book of Parallel Computing Theory and practices by Michael J. Quinn

Satisfactory Essays
Open Document
Open Document
1110 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Chapter 7-Matrix multiplication slides from Book of Parallel Computing Theory and practices by Michael J. Quinn
MATRIX MULTIPLICATION
(Part b)
By:
Shahrzad Abedi
Professor: Dr. Haj Seyed Javadi

MATRIX Multiplication
• SIMD
• MIMD
– Multiprocessors
– Multicomputers

Chapter 7: Matrix Multiplication , Parallel Computing :Theory and Practice, Michael J. Quinn

2

Matrix Multiplication Algorithms for Multiprocessors p1 p2 p3 p4 p1 p2

Chapter 7: Matrix Multiplication , Parallel Computing :Theory and Practice, Michael J. Quinn

p3

p4

3

Matrix Multiplication Algorithm for a UMA Multiprocessor

p1 p2 p3 p4 Chapter 7: Matrix Multiplication , Parallel Computing :Theory and Practice, Michael J. Quinn

4

Matrix Multiplication Algorithm for a UMA Multiprocessor
Example:
n= 8 , P=2
C

 n/p= 4

A

B

p1

p2

n/p times 
We must read n/p rows of A and we must read every element of B, n/p times
Chapter 7: Matrix Multiplication , Parallel Computing :Theory and Practice, Michael J. Quinn

5

Matrix Multiplication Algorithms for Multiprocessors
• Question : Which Loop should be made parallel in the sequential Matrix multiplication algorithm? • Grain Size :
– Amount of work performed between processor interactions – Ratio of Computation time to Communication
Time : Computation time / Communication time
Chapter 7: Matrix Multiplication , Parallel Computing :Theory and Practice, Michael J. Quinn

6

Sequential Matrix Multiplication
Algorithm

Chapter 7: Matrix Multiplication , Parallel Computing :Theory and Practice, Michael J. Quinn

7

Matrix Multiplication Algorithms for Multiprocessors
• Design Strategy If load balancing is not a problem maximize grain size
• Question : Which Loop should be made parallel ? i or j or k ?
• K has data dependency X
• If j  Grain-size = O(n3/np)= O(n2/p)
• If i  Grain-size = O(n3/p)
Chapter 7: Matrix Multiplication , Parallel Computing :Theory and Practice, Michael J. Quinn

8

Matrix Multiplication Algorithm for a UMA Multiprocessor

You May Also Find These Documents Helpful

  • Satisfactory Essays

    For the second event Event2, the algorithm C does not abort during the challenge phase if one of d_0 and d_1 is 0. By the definition of H-list Pr[d_b=0]=1/(m!q_T+1) where b∈{0,1} and the two values are independent of one another, we have that both Pr[d_0=d_1=1]=1-1/q_T≥〖(1-1/(q_T+1))〗^2. Hence, the Pr[Event2] is at least 1/q_T. Since A never issues trapdoor queries for target keyword vectors, Event1 and Event2 are independent. Hence, the probability that C does not abort during the entire simulation, that is Pr[Event_1 ∧ Event_2]≥1/(eq_T).…

    • 111 Words
    • 1 Page
    Satisfactory Essays
  • Good Essays

    Assume that win=2 draw=1 and lose=0. If the supremacy matrix is calculated, tie always occurs, which proves that if there is a small gap between win and draws, that supremacy matrix isn’t valid.…

    • 3264 Words
    • 14 Pages
    Good Essays
  • Good Essays

    The purpose of the parallel array structure is to hold 2 different elements of information on budget numbers for each month. I created two parallel arrays one to hold the budget scheduled amount and another array to hold the budgeted amount that was achieved. Each array will hold information for each month. If I created this by using inputs without arrays, I would have had to create 24 different input statements to hold the 24 different elements of information. Using the array was much each and quicker. I just needed to create a loop with an end value of 12, which represented the 12 months of the year. Each pass through the loop, the month would change and I was able to enter both the scheduled budgeted information and the achieved budget. Once the loop was completed, the array was filled with information.…

    • 503 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Array Structure Paper

    • 833 Words
    • 4 Pages

    Once again Berry’s Bug Blasters are requesting an update to the previous program that was designed to help them to better serve their customers. The company has requested a way to display the name and phone number of their clients so that they can keep a record of what clients have called. The best way in the opinion to accomplish this is to build an array into the program. This will allow those in charge of the company record to record who has called and then to display the names of the clients and their number in a chart so that it can be recalled at a later date as needed.…

    • 833 Words
    • 4 Pages
    Good Essays
  • Good Essays

    2w – 3 + 3(w – 4) – 5(w – 6) We were given this expression to simplify.…

    • 611 Words
    • 3 Pages
    Good Essays
  • Better Essays

    Cja 354 Matrix

    • 959 Words
    • 4 Pages

    | First offense is up to 1 year imprisonment and/or a maximum fine of $100,000. Second offense is 15 days to 2 years and/or a fine of $2,500 - $250,000. Third and subsequent offenses are 90 days to 3 years and/or a fine of $5,000 - $250,000.…

    • 959 Words
    • 4 Pages
    Better Essays
  • Good Essays

    MPII 002: Task 1 (part 1)

    • 398 Words
    • 2 Pages

    Within my role I need a written consent from the child’s parents for proof that the child actually needs that medication as well as having the parents signature within that written consent, having verbal consent isn’t official you need to have prescribed.…

    • 398 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    MATRIX GRID hcs 455 week 2

    • 2468 Words
    • 9 Pages

    Currently in the health care environment insurance companies are no longer allowed to discriminate against children with preexisting conditions and are not allowed to deny or limit coverage. Individuals are now entitled to coverage regardless of their health status.…

    • 2468 Words
    • 9 Pages
    Powerful Essays
  • Powerful Essays

    Rutgers Expos Paper

    • 2612 Words
    • 11 Pages

    In countless ways, experiencing trauma is a no-win situation; it is difficult if not impossible to benefit from such an experience. But how does trauma affect the current state of the victim? More importantly, how can we sympathize with victims of incomprehensible trauma? Leila Ahmed, Beth Loffreda, and Martha Stout with their respective works, On Becoming an Arab, Selections from Losing Matthew Shepard, and When I Woke Up Tuesday Morning it was Friday discuss the use of distancing in response to trauma in one’s past. Remarkably, human beings have developed the ability to distance themselves, or in some cases to dissociate, from the ordeal at the cost of loss of memory or even identity. There are times when this can be so extensive that hours, days or even years of one’s life can completely vanish along with the emotions and physical stimulations that compliment these memories. The absence of such emotions could potentially jeopardize the completeness of one’s identity along with the ability to create new memories and lasting relationships with others. Leila Ahmed, in her essay On Becoming an Arab, is forced to reflect on painful histories to cope with the loss of her Egyptian community; her identifications of harsh realities reflect anger towards those who made her ‘become an Arab’. As she journeys through history to resolve the loss, Ahmed distances herself to cope with the anger associated with her loss of community and ultimately deconstructs then reconstructs her identity. Likewise, Beth Loffreda also references individuals in her essay who have also experienced loss and distance themselves from it. Beth Loffreda’s essay, Selections from Losing Matthew Shepard, deals with the brutal murder of Matthew Shepard, a homosexual teenager from Laramie, Wyoming. Loffreda recapitulates the responses and reactions of those in and out of Laramie. But more in depth, Loffreda wonders if people nationwide paid more attention to Matthew’s…

    • 2612 Words
    • 11 Pages
    Powerful Essays
  • Powerful Essays

    COMM1000 Exam Study #1

    • 2164 Words
    • 9 Pages

    3. In communication, the content is what is being intentionally conveyed within a message. When we say that there is also a relational dimension, we mean that an added meaning is attached to the message by how the message is sent.…

    • 2164 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    Apple Ife Matrix Analysis

    • 271 Words
    • 2 Pages

    It was pretty surprising to me to find that all the different groups came up with fairly similar ratings in their IFE matrix for Apple Inc. My group, management, had the second highest rating at a 2.78 and I felt that we were fairly critical of the different strengths and weaknesses for the company. The groups that pertained to a more financial aspect like finance and accounting seemed to have lower scores, which were not as far above the average for utilization of resources internally. This seems interesting because many companies use resources outside their company to assist them in correcting financial problems. Also, there were a few strengths and weaknesses that every group mentioned in their matrix and they were: Steve Jobs leaving and then returning(W), large increase in inventory(W), products are globalized(S). It was interesting to see that Steve Jobs leaving and then returning was on everyone groups list because with out him these last few years Apple Inc. would probably not be where it is at today. The only downside to this is that there seems to be this great dependency on one person in this company and that is the reason that it is seen as a weakness. Overall, every group stated that Apple Inc. is utilizing internal resources above the average in their industry and this is based on the ratings given by the groups. These ratings ranged form 2.4 to 2.84 and the differences between these were a matter of a few points added to a different category that can skew the final…

    • 271 Words
    • 2 Pages
    Good Essays
  • Good Essays

    Solu2

    • 11506 Words
    • 85 Pages

    2. a. Consider the definition-based algorithm for adding two n-by-n matrices. What is its basic operation? How many times is it performed as…

    • 11506 Words
    • 85 Pages
    Good Essays
  • Good Essays

    Parallel Arrays

    • 427 Words
    • 2 Pages

    In contrast, many array data structures allow access to any element with a constant number of operations,…

    • 427 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    Computer Systems

    • 1233 Words
    • 5 Pages

    I certify that the work submitted or this assignment is my own and research sources are fully acknowledged.Learner signature: Date:|…

    • 1233 Words
    • 5 Pages
    Powerful Essays
  • Satisfactory Essays

    Answer ALL questions in the Answer Booklet. Begin EACH answer on a new page. lndicate clearly answers that are cancelled, if any. Where applicable, show clearly steps taken in arriving at the solutions and…

    • 514 Words
    • 3 Pages
    Satisfactory Essays

Related Topics