NEW CHALLENGES

• PP -4 Decades of Research –
MICROEL, PCBS,PACKAGING, ADV
PROCESSORS,MEM SYSTS, PERIP
DEVS, COMMN, LANG, COMPILER
DVP, OS’s, PROGR ENVIRONS, &
APPLN CHALLENGES
• To –date, it is difficult/too painful to
program Parallel & Vector Computers.
• Real Life problems- DES OF VLSI
CKTS, LARGE SCALE DBMS, AI,
CRIME CONTROL, SDI, ETC
SYST ATTRIBUTES TO
PERFORMANCE
• M/C CAP ENH – BETER H/W, INNOV
ARCH, & EFF RES MNGNT
• FACTORS AFFG PROGRAM BEHAVIOUR –
ALGOR DES, LANG EFF, PROGMR SKILL, &
COMPIL TECH
• PERFECT MATCH BETW H/W & S/W
• M/C PERF MAY VARY FROM PROGR TO
PROGR
• TURNAROUND TIME- time since the
job is submitted to the time its results
become available to the user
• INCLUDES – DISK & MEM ACC, I/P &
O/P ACTS, COMPIL TIME, OS
OVERHEAD & CPU TIME
CPU RATE & CPI

• CYCLE TIME TOW

• F=1/TOW
• SIZE OF PROGR DET BY ITS INSTRN
COUNT IC –M/C INSTRNS TO BE
EXECUTED
• CYCLES PER INSTRN –AVERAGE - CPI
PERF FACTORS
• CPU TIME T NEEDED TO EXEC THE
PROGR IS ESTIM –
• T=IC*CPI*TOW
• MEM CYCLE – TIME REQD TO COMPL ONE
MEM REF
• MEM CYCLE IS K TIMES PROC CYCLE
TOW
• VAL OF K DEPS ON SPEED OF MEM &
PROCR – MEM INTERCN SCHEME USED
• T=IC*(P+M*K)*TOW WHERE P IS THE
NO. OF PROC CYCLES NEEDED FOR
INSTRN DEC & EXECN, M IS THE NO. OF
MEM REFS NEEDED
• MIPS=IC/(T*10R6)
• =F/(CPI*10R6)
• =F*IC/(C*10R6) WHERE C IS THE
TOT NO OF CL CYCLES NEEDD TO EXEC A
PROGR
THROUGHPUT

• HOW MANY PROGRS A SYST CAN

EXEC PER UNIT TIME
• CPU THROPT WP=F/(IC*CPI)
PROGRAMS/SEC
Implicit parallelism
PROGRAMMER

SOURCE CODE IN
SEQ LANG

PARALLELIZING
COMPILER

PAR OBJ CODE

EXECN
Explicit parallelism
PROGRAMMER PROGRAMMER

SOURCE CODE iN
SOURCE CODE IN
CONCURRENT LANG
SEQ LANG

CONCURRENCY
COMPILER PARALLELIZING
COMPILER

CONCURRENT
OBJ CODE PAR OBJ CODE

EXECN
EXECN
• Implicit parallelism • Explicit parallelism

PROGRAMMER

SOURCE CODE IN
SEQ LANG

PARALLELIZING
COMPILER

PAR OBJ CODE

EXECN