Copyright © Philip M. Parker, INSEAD. Terms of Use.

PARALLEL RANDOM-ACCESS MACHINE

Specialty Definition: PARALLEL RANDOM-ACCESS MACHINE

DomainDefinition

Math

A shared-memory model of computation, where typically the processors all execute the same instruction synchronously, and access to any memory location occurs in unit time. (references)

Source: compiled by the editor from various references; see credits.

Top     


Alternative Orthography: PARALLEL RANDOM-ACCESS MACHINE


Hexadecimal (or equivalents, 770AD-1900s) (references)

50 41 52 41 4C 4C 45 4C      52 41 4E 44 4F 4D 2D 41 43 43 45 53 53      4D 41 43 48 49 4E 45

Leonardo da Vinci (1452-1519; backwards) (references)

        

Binary Code (1918-1938, probably earlier) (references)

01010000 01000001 01010010 01000001 01001100 01001100 01000101 01001100 00100000 01010010 01000001 01001110 01000100 01001111 01001101 00101101 01000001 01000011 01000011 01000101 01010011 01010011 00100000 01001101 01000001 01000011 01001000 01001001 01001110 01000101

HTML Code (1990) (references)

&#80 &#65 &#82 &#65 &#76 &#76 &#69 &#76 &#32 &#82 &#65 &#78 &#68 &#79 &#77 &#45 &#65 &#67 &#67 &#69 &#83 &#83 &#32 &#77 &#65 &#67 &#72 &#73 &#78 &#69

ISO 10646 (1991-1993) (references)

0050 0041 0052 0041 004C 004C 0045 004C      0052 0041 004E 0044 004F 004D 002D 0041 0043 0043 0045 0053 0053      004D 0041 0043 0048 0049 004E 0045

Encryption (beginner's substitution cypher): (references)

5035523546463946252354838494715353737395353247353742434839

Top     



INDEX

1. Orthography
2. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.