It looks like you're new here. If you want to get involved, click one of these buttons!

- 141K All Categories
- 103.8K Programming Languages
- 6.5K Assembler Developer
- 1.9K Basic
- 40K C and C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.7K Java
- 4.1K Pascal
- 1.3K Perl
- 2K PHP
- 551 Python
- 37 Ruby
- 4.4K VB.NET
- 1.6K VBA
- 20.9K Visual Basic
- 2.6K Game programming
- 317 Console programming
- 92 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 744 Computer Hardware
- 3.5K Database & SQL
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 258 XML Development
- 3.3K Classifieds
- 199 Co-operative Projects
- 198 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 604 Jobs Wanted
- 210 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 3.4K Miscellaneous
- 7 Join the Team
- 355 Comments on this site
- 70 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 628 Off topic board
- 217 Mobile & Wireless
- 89 Android
- 126 Palm Pilot
- 340 Multimedia
- 156 Demo programming
- 184 MP3 programming
- Bash scripts
- 27 Cloud Computing
- 53 FreeBSD
- 1.7K LINUX programming
- 370 MS-DOS
- Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 942 Software Development
- 417 Algorithms
- 68 Object Orientation
- 92 Project Management
- 95 Quality & Testing
- 269 Security
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 62 AJAX
- 5 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 37 JQuery
- 308 WEB Servers
- 151 WEB-Services / SOAP

p_v
Member Posts: **61**

Hello,

I am presenting here a pascal program for matrix multiplication and the corresponding PDP-11 program from the book "Computer Organization" by Carl Hamacher. I have some doubts which I would request the list to look into. I have appended these questions at the end.

Pascal program

for i:= 0 to n-1 do

begin

for j:= 0 to n-1 do

begin

C(i,j)= 0;

for k:= 0 to n-1 do

C(i,j):= C(i,j) + A(i,k) x B(i,k)

end

end

PDP-11 program

CLR RO

LOOPI: CLR R2

LOOPJ: MOV R2,R1

MUL N,R1

ADD R0,R1

ASL R1

CLR C(R1)

CLR R4

LOOPK: MOV R4,R3

MUL N,R3

ADD R0,R3

ASL R3

MOV A(R3),R3

MOV R2,R5

MUL N,R5

ADD R4,R5

ASL R5

MUL B(R5),R3

ADD R3,C(R1)

INC R4

CMP R4,N

BLT LOOPK

INC R2

CMP R2,N

BLT LOOPJ

INC R0

CMP R0,N

BLT LOOPI

Here, R0, R2 and R4 hold the values i, j and k respectively. N is the memory location holding the value n. Array subscripts run from (0,0) to (n-1,n-1). The elements of each array are stored in consecutive word locations beginning with (0,0) and continuing in column order. All the elements are 16-bit integers.

My question is: In the book, the formula for calculating the byte address of element(i,j) of an array, relative to the address of the first element, is given as 2(nxj+i). Could anyone provide an explanation?.

Secondly, how is it that the addressable space of a PDP-11 is 2-to-the-power-of-15 words or 2-to-the-power-of-16 bytes? Since each word consists of 16 bits, it should have been 2-to-the-power-of-16 words.

thanks and regards

PV

I am presenting here a pascal program for matrix multiplication and the corresponding PDP-11 program from the book "Computer Organization" by Carl Hamacher. I have some doubts which I would request the list to look into. I have appended these questions at the end.

Pascal program

for i:= 0 to n-1 do

begin

for j:= 0 to n-1 do

begin

C(i,j)= 0;

for k:= 0 to n-1 do

C(i,j):= C(i,j) + A(i,k) x B(i,k)

end

end

PDP-11 program

CLR RO

LOOPI: CLR R2

LOOPJ: MOV R2,R1

MUL N,R1

ADD R0,R1

ASL R1

CLR C(R1)

CLR R4

LOOPK: MOV R4,R3

MUL N,R3

ADD R0,R3

ASL R3

MOV A(R3),R3

MOV R2,R5

MUL N,R5

ADD R4,R5

ASL R5

MUL B(R5),R3

ADD R3,C(R1)

INC R4

CMP R4,N

BLT LOOPK

INC R2

CMP R2,N

BLT LOOPJ

INC R0

CMP R0,N

BLT LOOPI

Here, R0, R2 and R4 hold the values i, j and k respectively. N is the memory location holding the value n. Array subscripts run from (0,0) to (n-1,n-1). The elements of each array are stored in consecutive word locations beginning with (0,0) and continuing in column order. All the elements are 16-bit integers.

My question is: In the book, the formula for calculating the byte address of element(i,j) of an array, relative to the address of the first element, is given as 2(nxj+i). Could anyone provide an explanation?.

Secondly, how is it that the addressable space of a PDP-11 is 2-to-the-power-of-15 words or 2-to-the-power-of-16 bytes? Since each word consists of 16 bits, it should have been 2-to-the-power-of-16 words.

thanks and regards

PV

Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven

© 1997-2017 Programmersheaven.com - All rights reserved.

## Comments

198Memory is linear, one dimensional, that array is not. To simulate a second dimension, each j value is an offset, and the i values remain constant. That j value then must be equal to (max i)*j, forcing the element location in memory relative to the first element in the array to be (max i)*j+i. This is the most effecient use of memory for something like this, but causes problems resizing the max i value of the array.

Also, you don't need 10 extra blank lines at the bottom of the post...

: Hello,

:

: I am presenting here a pascal program for matrix multiplication and the corresponding PDP-11 program from the book "Computer Organization" by Carl Hamacher. I have some doubts which I would request the list to look into. I have appended these questions at the end.

:

: Pascal program

:

: for i:= 0 to n-1 do

: begin

: for j:= 0 to n-1 do

: begin

: C(i,j)= 0;

: for k:= 0 to n-1 do

: C(i,j):= C(i,j) + A(i,k) x B(i,k)

: end

: end

:

: PDP-11 program

:

: CLR RO

: LOOPI: CLR R2

:

: LOOPJ: MOV R2,R1

: MUL N,R1

: ADD R0,R1

: ASL R1

: CLR C(R1)

: CLR R4

:

: LOOPK: MOV R4,R3

: MUL N,R3

: ADD R0,R3

: ASL R3

: MOV A(R3),R3

: MOV R2,R5

: MUL N,R5

: ADD R4,R5

: ASL R5

: MUL B(R5),R3

: ADD R3,C(R1)

: INC R4

: CMP R4,N

: BLT LOOPK

: INC R2

: CMP R2,N

: BLT LOOPJ

: INC R0

: CMP R0,N

: BLT LOOPI

:

: Here, R0, R2 and R4 hold the values i, j and k respectively. N is the memory location holding the value n. Array subscripts run from (0,0) to (n-1,n-1). The elements of each array are stored in consecutive word locations beginning with (0,0) and continuing in column order. All the elements are 16-bit integers.

:

: My question is: In the book, the formula for calculating the byte address of element(i,j) of an array, relative to the address of the first element, is given as 2(nxj+i). Could anyone provide an explanation?.

:

: Secondly, how is it that the addressable space of a PDP-11 is 2-to-the-power-of-15 words or 2-to-the-power-of-16 bytes? Since each word consists of 16 bits, it should have been 2-to-the-power-of-16 words.

:

: thanks and regards

: PV