Recherche Images Maps Play YouTube Actualités Gmail Drive Plus »
Connexion
Les utilisateurs de lecteurs d'écran peuvent cliquer sur ce lien pour activer le mode d'accessibilité. Celui-ci propose les mêmes fonctionnalités principales, mais il est optimisé pour votre lecteur d'écran.

Brevets

  1. Recherche avancée dans les brevets
Numéro de publicationUS3646523 A
Type de publicationOctroi
Date de publication29 févr. 1972
Date de dépôt24 sept. 1969
Date de priorité24 sept. 1969
Autre référence de publicationDE2047095A1
Numéro de publicationUS 3646523 A, US 3646523A, US-A-3646523, US3646523 A, US3646523A
InventeursKlaus Juergen Berkling
Cessionnaire d'origineIbm
Exporter la citationBiBTeX, EndNote, RefMan
Liens externes: USPTO, Cession USPTO, Espacenet
Computer
US 3646523 A
Résumé  disponible en
Images(83)
Previous page
Next page
Revendications  disponible en
Description  (Le texte OCR peut contenir des erreurs.)

United States Patent Berkling I Feb. 29, 1972 [54] COMPUTER [72] Inventor: Klaus Juergen Berkllng, Granite Springs,

[73] Assignee: International Business Machines Corporation, Armonk, N.Y.

[22] Filed: Sept. 24, 1969 [21] Appl. No.: 860,473

[52] US. Cl. ..340/172.5 [51] Int. [58] Field of [56] References Cited OTH ER PUBLICATIONS Schaffner, The Circulating Page Loose System, A New Solution for Data Processing, Research Report No. 15, Published by Smithsonian Astrophysical Observatory, Dec. I966 Primary Examiner-Raulfe B. Zache Assistant Examiner-Ronald F. Chapuran Attorney-Hamlin and .Iancin and Isidore Match [57] ABSTRACT of the well-formed formulas of the aforementioned lambda calculus whereby the theoretical properties of the lambda calculus are implemented in the computer. Consequently, the computer is capable of computing all computable functions with time and space being the only limitations. The nerve center of the system is termed a tablet which in one implementation may essentially consist of an array of high-speed registers, each one large enough to hold a primitive term together with its designator. The nodes of a tree given by some formula corresponds to rows in the tablet and the branches extending from the nodes correspond to columns in the tablet. In one embodiment, the tablet has three columns for the branches and can have a fourth column which holds the tree addresses of the nodes. Associative techniques permit access to a row upon a match with the contents of the data or designator fields of one or more columnsf'l'he basic unit of information consists of the contents of a complete row of the tablet, such unit being termed a message." The tablet, functioning as a central communication device, communicates with functional units, memory units, and input-output units, the latter issuing and accepting messages, or merging them with existing ones when the units obtain access to the tablet. The invention contemplates either the accessing by the units of the whole tablet, one after another in a fixed sequence, or the accessing by each unit of only a subset of the tablet, all units simultaneously accessing discrete subsets respectively. In order to render all messages available to all units, all of the messages are circulated, i.c., shifted through the whole tablet.

14 Claims, 133 Drawing Figures IIIPUT STORE "D- 5T0li IP UP BETA MINI-LOGIC lIlITII-LOGIC OUTPUT UIII'I' UNIT 1 IIIIIT mm II T IlIIlT IIIIIT I UIIIT ll IIIIIY LINEAR MEMORY PATENTEDFEBZH 1912 3,646,523

SHEET 0311183 FIG. 4 FIG. 5

STRUCTURES TREE STRUCTURE FUNCTIONS 0N U RELATIONS 0N U LINEAR STRUCTURE NATURAL NUMBERS (((D-EHCHAH-BH) SHH)"HH/S(O')"O'1,0'N SUU-m'O' cr creT FIG. 6 FIG. 7

TREE ADDRESSING VERSUS MACHINE LANGUAGE MAPPING OF TREE STRUCTURES SYNTAX:

FORWD' (ADDRESS t t P1 W 1 1,1

P4 t t,t,t P3 t {PRIMITIVE 151111} 5 En SEMANTTCS1 ))(q .m)p)) {Pl,.,,., P11} DATA 1111111 TFO ....O' m=MEMORY SIZE 3 'rnloq m 511s M2 5115 PAIENTEDFEBZS I972 3.646523 SHEET mm 83 FIG. 8

SYSTEM ARCHITECTURE TABLET= )Lv 25 M "X EXJZ NA MX L 3 )5 2,, 5

x123 A if I I I ml 1 l I FUNCTIONAL UNITS FIG. 9 FIG. 10

I SA'ACCEPTANCE STATE,

SE-ERROR STATE STATE DIAGRAM FOR neVf'lxkeVt S, SUCCESSOR FUNCTION=V1'xVf*VfST(S,l\,n)-nk Ta (TRTT '(P.T1)UNDEF|NE0T0= =UNDEFINED PAIENTEDrwzsmrz 3,646,523

SHEET CBUF 83 FIG. 15

CH RAC 2L E AINPUIER pusuooww I T J STACK I I I I L J J N0 U DPERATION PRIME I PRIME I H v I4 I W I l I W I I I I I I I l I I I l I I I L L I i J L L 5 S L J; J

TABLET COMMUNICATION REGISTERS PAIENIEDFEB29 I972 SHEET CSUF 83 PAIENIEDFEBZB m2 3,646,523

SHEET 10 0F 83 FIG. 17C

PATENTEUFEBZS I972 3.646.523

sum 11 (1F 83 FIG. 17D

PAIENTEnmszs :912 3,646,523

SHEET 13 [1F 83 FIG.17F

READ COMPLETE COMPLETE PATENTEDFEBZSIBTZ 3,646,523

SHEET 150? 83 ASSOCIATIVE MEMORY CONTROL F I 19A wRITE A SELECT) F.

READ SELJECT 162" l I A 446 A FIF IL I 5 CA3 A Z A A Z v A j READ sE EcT FF J T *1 0 IIRITE A A 2 TIcIsII A READ SELIECT TI T I F. I 0 WRITE cA-I A A A SELECT) M 1L M W q A l READ W VVVV q SELECT) T T FF I52 A J I 0 65-1 A A I Y WRITE REIII) I IRITE PAHZNTEDFEBZSIQYZ 3.646.523

SHEET 15 [1F 83 FIG. 19B ASSOCIATIVE DATA MEMORY PLANE WORD 1 WORD1 WORD 1 BiT#1 BIT#2 B|T#161 worm 2 WORD 2 WORD 2 BIT#I BIT# 2 B1T# 161 WORD :1 WORD 3 WORD a BIT #1 BIT#2 a11#1s1 WORD 4 wono 4 wono 4 B11 1 1111111 2 BIT#16I 1 w 111 I i (DATA 01-2 PULSE 13 1111 11111 MJ 10 1111s 11111 10 10011 f 011-2 1 11151 15 11111111 1011 1111 11 51101 111 s111c11n 111115 101001 FOR INPUT MESSAGE FAIENIEUFEBZSIBTZ 3,646,523

QHEET 17UF 83 ASSOCIATIVE MEMORY VACANCY BIT STORAGE ELEMENT (BIT 1 INITIAL RESET wans SELECT 0 FIG. 21 fiw MISMMEL 4Q;Assoc|m 7 1 0 READ sum W sum 3610 /3 ASSOCIATIVE M EMORY STORAGE ELEMENT(B|T 2161) w WRITE SELECT ASSOCIATE

Référencé par
Brevet citant Date de dépôt Date de publication Déposant Titre
US3978452 *28 févr. 197431 août 1976Burroughs CorporationSystem and method for concurrent and pipeline processing employing a data driven network
US4156903 *28 févr. 197429 mai 1979Burroughs CorporationData driven digital data processor
US4447875 *7 juil. 19818 mai 1984Burroughs CorporationReduction processor for executing programs stored as treelike graphs employing variable-free applicative language codes
US5099450 *22 sept. 198824 mars 1992Syracuse UniversityComputer for reducing lambda calculus expressions employing variable containing applicative language code
US5434972 *10 janv. 199218 juil. 1995Gec-Marconi LimitedNetwork for determining route through nodes by directing searching path signal arriving at one port of node to another port receiving free path signal
US8739137 *19 oct. 200727 mai 2014Purdue Research FoundationAutomatic derivative method for a computer programming language
US20090077543 *19 oct. 200719 mars 2009Jeffrey Mark SiskindAutomatic derivative method for a computer programming language
EP0069525A1 *29 juin 198212 janv. 1983Fujitsu LimitedData processing system
EP0232386A1 *12 août 198619 août 1987Fairchild SemiconductorA pattern addressable memory.
WO1992012487A1 *7 janv. 199223 juil. 1992Marconi Gec LtdParallel processing apparatus
Classifications
Classification aux États-Unis717/143
Classification internationaleG06F9/44, G11C15/04, G06F15/00, G06F9/00
Classification coopérativeG11C15/04, G06F8/312
Classification européenneG06F8/312, G11C15/04