Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
14 views2 pages

S23 PDC Mid Exam

parallel and distributrd computing

Uploaded by

abbastayyaba417
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
14 views2 pages

S23 PDC Mid Exam

parallel and distributrd computing

Uploaded by

abbastayyaba417
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
hiversity of Central Punjab Faculty of Information Technology Parallel and Distributed Computing Mia Term: Spring 2023 Name Registration Duration: 90mins Max. Maths 35 Note: Attempt all questions. a a) 7 What sort ofeache locality is achievable in the Follow ‘Assume row major ordering in memory forthe arrays.) g code and how would you obtain i? FeeGitienin) By cans, Loop evibeetonp ay ae For (i=0;i BEILI: nee Lent ire), Tens DF 50% ofa program's exscsan tie osu inside a loc ha z gpa in eva, What sth minum pest Ne sold expat om 8 fle Sea the executing 2of core CPU? If we wanted to achieve ‘times speedup how many processing units Will be required gpecdiper) @. Ategpe 8 Fynstaconomy ism clsiteaton of computer ates proposed by Miche yan. Dein the rleof stack with proper example in the context. Compare and cortrast SIMD and MIMD. 1b) Discuss he following in bic <9 superscalar processor vs mukiore processors ii) inerder and outor-orde processor, Wy malthreading, and mali-pocesing a j @, o / ‘We have an array of 100 elements, Writes thread program that ealeulates fr each array’ element the Square ‘of their index and stores it asthe element vahic using 4 threads. The program should be properly synchronized to avoid any race conition possibility. Hence THE man, Spredup cou be AeuTevE LSD Therefore Aspeed ap 4. h Ceald net be denveved, * e Gxt) Given below is the tusk dependency graph, weighted node represents the take and each directed edge ‘represents ils dependency Answer nest 6 questions based on this yroph, LWhat is critical path and its length, why critical path is important? .2y What isthe best possible parallel computation time? What is maximum degree of concurrency? 3 What isthe para computation ime or 2 processors? Minimum processor needed to achieve themasimum speedup? D> eastrend eeth S . eon: HTa~ US FT ETN evitio’ pall fest y+ tot rig aro tot It tells usthe shartet te competete Te Fagic- knktian time wo = 69 Liye, HED D._ post pewible comps Gat, npr ecessors 4 a8 Tx toast Ver foto ler? eng) by vee | Genco mars see? ‘\ io _ xe wits akan th * Deowtlel comprtteke ee » are tuo peeenter eaye sound 4 : a reeises WD The winin Mumbo te achare war Speak up hy. ‘be

You might also like