DATA CODE TABLE

The B 5500 Information Processing System can manipulate data internally either in 48-bit binary words or in 6-bit BCD characters. Input-output operations can utilize three basic coding systems: binary, 6-bit Burroughs Common Language, and the standard Hollerith card code. Card readers and punches can accept data in Hollerith or binary code. The mag-netic drum storage unit reads and records only in the binary mode. The supervisory printer and line printers accept and print data only in BCL code, but the magnetic tape units and Disk File can utilize binary-coded information as well as BCL. Burroughs Common Language code is also the standard input-output data code for the paper tape devices and data communications equipment, although a paper tape code translator permits use of any 5, 6, 7, or 8-level code in read and punch operations, and the 5-level Baudot code can be used with Teletype terminal units.

The table of data codes below consolidates in one chart the several types of internal and external codes used in the B 5500 system.

INTERNAL CODE BCL CODE CARD CODE

CHAR. INTERNAL CODE BCLCODE CARD CODE CHAR.

OCTAL SA 8421

CODE SA 8421 ZONE NUM. OCTAL

SA 8421

CODE SA 8421 ZONE NUM.

Blank 11 0000 60 01 0000

- -

^H ⁰¹ ¹⁰⁰⁰ ³⁰ ¹¹ ¹⁰⁰⁰ ¹² ⁸

I 01 1001 31 11 1001 12 9

01 1010 32 11 1011 12 8-3

•

¹⁰ ⁰⁰⁰⁰ ⁴⁰ ¹⁰ ¹⁰¹⁰ ¹¹ ⁰

[ 01 1011 33 11 1100 12 8-4 J ¹⁰ ⁰⁰⁰¹ ⁴¹ ¹⁰ ⁰⁰⁰¹ ¹¹ ^I

( 01 1101 35 ¹¹ ¹¹⁰¹ ¹² ^8-5 _K 10 0010 42 10 0010 11 2

< ⁰¹ ¹¹¹⁰ ³⁶ ¹¹ ¹¹¹⁰ ¹² ^8-6 L 10 0011 43 10 0011 11 3

-

_& ⁰¹₀₁ ¹¹¹¹₁₁₀₀ ³⁷₃₄ ¹¹₁₁ ₀₀₀₀¹¹¹¹ ¹²₁₂ ^8-7

_-

^M ¹⁰ ⁰¹⁰⁰ ⁴⁴ ¹⁰ ⁰¹⁰⁰ ¹¹ ⁴

N 10 0101 45 10 0101 11 5

S ¹⁰ ¹⁰¹⁰ ⁵² ¹⁰ ¹⁰¹¹ ¹¹ ^8-3 0 10 0110 46 10 0110 11 6

.

¹⁰ ¹⁰¹¹ ⁵³ ¹⁰ ¹¹⁰⁰ ¹¹ ^8-4 ^P ¹⁰ ⁰¹¹¹ ⁴⁷ ¹⁰ ⁰¹¹¹ ¹¹ ⁷

) 10 1101 55 10 1101 11 8-5 Q 10 1000 50 10 1000 11 8

; 10 1110 56 10 1110 11 8-6 R 10 1001 51 10 1001 11 9

~ 10 1111 57 10 1111 11 8-7

-

¹⁰ ¹¹⁰⁰ ⁵⁴ ¹⁰ ⁰⁰⁰⁰ ¹¹

^-

^I_S ^II_II ¹¹⁰⁰0010 ⁷⁴62 ⁰¹01 ¹⁰¹⁰0010 ⁰0 ^8-22

/ ¹¹ ⁰⁰⁰¹ ⁶¹ ⁰¹ ⁰⁰⁰¹ a I T 11 0011 63 01 0011 0 3

11 1010 72 01 1011 0 8-3 U II 0100 64 01 0100 0 4

% 11 1011 73 01 1100 0 8-4 V 11 0101 65 01 0101 0 5

= 11 1101 75 01 1101 0 8-5 W 11 0110 66 01 0110 0 6

J ¹¹ ¹¹¹⁰ ⁷⁶ ⁰¹ ¹¹¹⁰ ⁰ ^d-6 ^X ¹¹ ⁰¹¹¹ ⁶⁷ ⁰¹ ⁰¹¹¹ ⁰ ⁷

" ¹¹ ¹¹¹¹ ⁷⁷ ⁰¹ ¹¹¹¹ ⁰ ^8-7 V ¹¹ ¹⁰⁰⁰ ⁷⁰ ⁰¹ ¹⁰⁰⁰ ⁰ 8

Z 11 1001 71 01 1001 0 9

; CO 1010 12 00 1011

-

^8-3

@ CO lDll 13 00 1100

-

^8-4 0 GO

=

⁰⁰ ⁰⁰ ¹⁰¹⁰

^-

⁰

: 00 1101 15 00 1101

-

^8-5 1 00 0001 01 00 0001

-

> ⁰⁰ ¹¹¹⁰ ¹⁶ ⁰⁰ ¹¹¹⁰

-

^8-6 2 00 GOl0 02 00 0010

-

~ 00 1111 17 00 1111

-

^8-7 3 00 GOII 03 00 0011

-

+ 01 0000 20 11 1010 12 a ⁴ ^GO ⁰¹⁰⁰ ⁰⁴ ⁰⁰ ⁰¹⁰⁰

-

⁴

A 01 0001 21 11 0001 12 I 5 GO 0101 05 00 0101

-

⁵

B 01 0010 22 II 0010 12 2 6 00 0110 06 00 0110

-

⁶

C 01 0011 23 11 0011 12 3 7 00 0111 07 00 0111

-

⁷

D 01 0100 24 II 0100 12 4 8 00 1000 10 00 1000

-

⁸

E ;'1 0101 :;5 11 0101 12 5 9 GO lGOI 11 00 1001

-

⁹

F 01 0110 26 11 0110 12 6

G 01 0111 27 11 0111 12 7 ? 00 1100 14 00 0000 ALL OTHER

CARD CODES

Table reproduced from Burroughs B 5500 Information Processing Systems Reference Manual, Appendix A, p. A-I.

&

^{STAND ...}

PROBLEM ORIENTED FACILITIES

· 1 UTILITY ROUTINES 63 characters per field.

any number of input reels that can be accommodated before any of the available scratch tapes is filled.

from 3 to 8.

April 1963.

The B 5500 Tape Sort Generator is an integral part of the COBOL Compiler, described in Report Sec-tions 203:162 (COBOL language) and 203:182 (COBOL translator). The generator is activated by the SORT verb, an elective feature of COBOL-61 Extended.

File and record descriptions are entered in the source program's Data Division section, and the maximum amount of core storage to be used for sorting is specified in the Environment Division.

The Tape Sort Generator sorts input records from magnetic tape in ascending or descending sequence according to key information contained in up to 25 fields of each record. Only fixed-length records can be sorted, and the record length must be a mul-tiple of eight characters (one B 5500 word). From three to eight magnetic tapes can be used for inter-mediate storage during the sorting operation, and the sorted output records are written on magnetic tape. The generator uses a "vector sort" technique' during the internal sort or "stringing" phase, and a polyphase Fibonacci merge during the output phase.

A simple sort of all records results when the SORT statement with the USING File Name Option is speci-fied in the Procedures Division. However, the IN-PUT PROCEDURE and OUTIN-PUT PROCEDURE can be utilized to enable the programmer to manipulate the records both before and after the actual sorting operation. The RELEASE verb can be used within the INPUT PROCEDURE to specify only selected

records to be sorted. Each SORT statement is self- . 14

initializing and can therefore be re-executed as desired. In addition, any number of SORT state-ments canbe used within a single COBOL program.

An example of the speed of the Tape Sort Generator is offered by Burroughs. A sort of 50,000 100-character records, blocked at 10 records per block and using a 10-character sort key, will take 12 minutes and 50 seconds on a'single-processor B 5500 that has two I/O Channels, 32K words of core storage, and six available 66KC magnetic tape units.

B 5500 Disk Sort Generator Reference: . . • . . . . 63 characters per field.

limited only by the amount of available intermediate storage (disc and tape).

any number that can con-tain between 1. 1 and 2.2 times the amount of data in the input file.

two.

November, 1965.

B 5500 users with available Disk File storage can utilize the more recent Disk Sort Generator. The Disk Sort is also an integral part of the B 5500's COBOL compiler, and is activated by the SORT verb in the same manner as the Tape Sort Generator.

Functionally, the Disk Sort program attempts to make exclusive use of Disk. File storage. However;

if the amount of available disc storage is exhausted before the sort or "stringing" phase is complete, the Disk Sort program will use magnetic tapes as overflow storage units. All the strings are then merged, and the sorted output file is written on any available output device. In order to ensure that the Sort program will function in a disc-only mode, disc storage must be made available in an amount at least 2.2 times the size of the input file.

The Disk Sort program will function with any B 5500 system capable of performing COBOL com-pilations.

Sort times for the B 5500 Disk Sort program have not been made available to date.

Report Writing: • • •• none •

. 15 Data Transcription

The only transcription routines announced to date are integral parts of the Master Control Program.

The card-to-tape routine can be used to keep the card reader(s) operating at maximum speed by transcribing input data from cards to magnetic tape, and then reading it from the tape when the program is ready to utilize the .data. If the operator indicates that no tape unit is available for the transcription, data is transcribed instead from cards to the Storage Drum or Disk File.

The tape-to-printer routine is used when the number of simultaneously-running programs requiring printer output exceeds the number of Line Printers in the system. Data to be printed is written on magnetic tape. A job number identifies each file, so the output from several programs can be written on the same tape reel. When a printer becomes available, the Master Control Program transcribes the accumulated output data from tape to printer.

Data transcriptions can also be performed off-line on the I/O-compatible Burroughs B 100/200/300 computer systems.

.16 File Maintenance: .. none.

.17

Scientific Library Procedures

Reference: . . . .. "Partial List of Scientific Library Procedures for the Burroughs B 5500. "

Date available: immediate.

Description:

The document referenced above lists 99mathematical and scientific routines that will be provided for the B 5500 by the manufacturer. These routines range in scope from "Tangent" to "Non-linear Multiple Regression." The major categories, and the number of routines falling into each, are as follows:

Trigonometric

special functions:. 37.

10/65 AUERBACH

A

Execution times and storage requirements for some of the standard functions and matrix algebra routines are listed below.

Single-Precision Matrix Algebra Time, msec Addition or Multiplication of 50 x

50 matrices: 33,440.

Note: Accuracy is at least 11 significant decimal digits for Single-precision functions and 23 for double-precision functions.

- ^&

m"",

Im Dokument An Analytical Reference Service for the Electronic Data Processing Field (Seite 179-183)

DATA CODE TABLE

DATA CODE TABLE

- -

•

-

-

.

-

-

-

-

=

-

-

-

-

-

-

-

-

-

-

-

-

-

&

PROBLEM ORIENTED FACILITIES

A

- &

_-

^-

^-

- ^&