You need JavaScript to view this

Absolute symbolic addressing, a structure making time-sharing easier; Adressage symbolique absolu, structure facilitant le travail en partage de temps

Abstract

Time-sharing of computers asks for a certain number of conditions, particularly, an efficient dynamic loading of programs and data. This paper indicates a paging method making linkages with a minimum of table-looking operations. The principle is to use associative memory registers for calling blocks of physical memory, the block address being given by the concatenation of a file number (located in a base register) and a page number (located in the instruction proper). The position within the block is given by a displacement located in the instruction. A second associated base register contains the local part (page number + displacement) of the base address. This extended base register system allows executing programs in a very large programming complex without loss of time. The addresses are fixed at assembly time and the blocks can be loaded anywhere without modification for execution. The various problems associated with the execution of complex programs are presented in this context and shown to be easily solved by the proposed system, the realization of which would be very easy starting from the computer structures existing now. (author) [French] Le partage de temps des ordinateurs demande la realisation d'un certain nombre de conditions, en particulier, un chargement  More>>
Authors:
Debraine, P [1] 
  1. Commissariat a l'Energie Atomique, 91 - Saclay (France). Centre d'Etudes Nucleaires, services scientifiques
Publication Date:
Aug 01, 1968
Product Type:
Technical Report
Report Number:
CEA-R-3588
Resource Relation:
Other Information: 17 refs; PBD: Aug 1968
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; COMPUTER ARCHITECTURE; COMPUTER CALCULATIONS; COMPUTER NETWORKS; DATA PROCESSING; EXECUTIVE CODES; MATHEMATICAL LOGIC; MEMORY MANAGEMENT; OPTIMIZATION; PARALLEL PROCESSING; TASK SCHEDULING
OSTI ID:
20523371
Research Organizations:
CEA Saclay, 91 (France)
Country of Origin:
France
Language:
French
Other Identifying Numbers:
TRN: FR04R3588091426
Availability:
Available from INIS in electronic form
Submitting Site:
FRN
Size:
[64] pages
Announcement Date:
Dec 10, 2004

Citation Formats

Debraine, P. Absolute symbolic addressing, a structure making time-sharing easier; Adressage symbolique absolu, structure facilitant le travail en partage de temps. France: N. p., 1968. Web.
Debraine, P. Absolute symbolic addressing, a structure making time-sharing easier; Adressage symbolique absolu, structure facilitant le travail en partage de temps. France.
Debraine, P. 1968. "Absolute symbolic addressing, a structure making time-sharing easier; Adressage symbolique absolu, structure facilitant le travail en partage de temps." France.
@misc{etde_20523371,
title = {Absolute symbolic addressing, a structure making time-sharing easier; Adressage symbolique absolu, structure facilitant le travail en partage de temps}
author = {Debraine, P}
abstractNote = {Time-sharing of computers asks for a certain number of conditions, particularly, an efficient dynamic loading of programs and data. This paper indicates a paging method making linkages with a minimum of table-looking operations. The principle is to use associative memory registers for calling blocks of physical memory, the block address being given by the concatenation of a file number (located in a base register) and a page number (located in the instruction proper). The position within the block is given by a displacement located in the instruction. A second associated base register contains the local part (page number + displacement) of the base address. This extended base register system allows executing programs in a very large programming complex without loss of time. The addresses are fixed at assembly time and the blocks can be loaded anywhere without modification for execution. The various problems associated with the execution of complex programs are presented in this context and shown to be easily solved by the proposed system, the realization of which would be very easy starting from the computer structures existing now. (author) [French] Le partage de temps des ordinateurs demande la realisation d'un certain nombre de conditions, en particulier, un chargement dynamique efficace des programmes et des donnees. Cet article indique une methode de pagination realisant les liaisons avec un minimum de consultations de tables. Le principe consiste a utiliser une memoire associative composee de registres pour appeler les blocs de la memoire physique, l'adresse de bloc etant donnee par concatenation d'un no de fichier (loge dans un registre de base) et d'un no de page (loge dans l'instruction proprement dite). La position a l'interieur du bloc est donnee par un deplacement loge dans l'instruction. Un second registre de base, associe au premier, contient la partie locale (no de page + deplacement) de l'adresse de base. Ce systeme d'extension de registre de base permet l'execution de programmes appartenant a un tres grand complexe sans introduire de pertes de temps. Les adresses sont fixees au moment de l'assemblage et les blocs peuvent etre charges n'importe ou, pour execution, sans modification. Les differents problemes lies a l'execution de programmes complexes sont presentes dans ce cadre et l'on montre qu'ils sont facilement resolus par le systeme propose dont la realisation serait tres facile a partir des structures d'ordinateurs existant actuellement. (auteur)}
place = {France}
year = {1968}
month = {Aug}
}