公开(公告)号：US3668647A

公开(公告)日：1972-06-06

申请号：US3668647D

申请日：1970-06-12

Applicant: IBM

Inventor： EVANGELISTI CARLO J ,  RITTENHOUSE LARRY E

IPC: G06F17/30 ,  G11B20/12 ,  G11B27/10 ,  G11B27/11 ,  G11B27/32 ,  G06F15/40

CPC classification number: G06F17/30949 ,  G11B20/1252 ,  G11B27/105 ,  G11B27/11 ,  G11B27/329 ,  G11B2020/10916 ,  G11B2220/20 ,  G11B2220/65 ,  Y10S707/99931

Abstract: A system is shown wherein, provided with an appropriate file organization, a data file can be read from a disk master file, given the file name, by performing one seek and one read operation. The system employs hash coding to compress a data file name to a disk file address. The disk file is positioned into fixed length blocks where each hashed file address points to a block, the block being as large as one cylinder or as small as one sector. Each block is organized such that it includes a directory for the files contained in the block and also contains the data files. Each entry in the directory contains the data file name and the address of that data file in the block. The process of locating and reading a data file entails the hash coding of a file name to yield a block address, the moving of the read head to the disk area having the block address and the reading of the directory and the remainder of the block to read out the data file. In the directory reading, the data file names are compared in real time, as they are read from the disk, with the name of the desired data file. When a name match occurs, the address of the data file in the block and the address of the next file address are read and stored. As the disk rotates, the desired data file address just read is constantly compared with the active disk address. When a match occurs, the file has been located and is read out. The reading is terminated at the address of the beginning of the next file. If the file name is not found in the directory of the block indicated by the hash coding of the file''s name, then the file is not present therein.

Abstract translation: 显示了一种系统，其中提供有适当的文件组织，可以通过执行一个查找和一个读取操作，从给定文件名的磁盘主文件中读取数据文件。 系统采用哈希编码将数据文件名压缩为磁盘文件地址。 磁盘文件位于固定长度的块中，其中每个散列文件地址指向一个块，该块与一个柱面一样大，或者小至一个扇区。 每个块被组织，使得它包括用于包含在块中的文件的目录，并且还包含数据文件。 目录中的每个条目都包含数据文件名和块中该数据文件的地址。 定位和读取数据文件的过程需要文件名的哈希编码以产生块地址，将读头移动到具有块地址的磁盘区和将目录的剩余部分读取到 读出数据文件。 在目录读取中，数据文件名称被实时比较，因为它们是从磁盘读取的，具有所需数据文件的名称。 当发生名称匹配时，读取并存储块中数据文件的地址和下一个文件地址的地址。 当磁盘旋转时，刚刚读取的所需数据文件地址与活动磁盘地址不断进行比较。 当匹配发生时，文件已被找到并被读出。 读取结束于下一个文件开头的地址。 如果在由文件名的散列编码表示的块的目录中找不到文件名，则该文件不在其中。

公开(公告)号：US3680078A

公开(公告)日：1972-07-25

申请号：US3680078D

申请日：1969-12-23

Applicant: IBM

Inventor： BASKIN HERBERT B ,  BELADY LASZLO A ,  EVANGELISTI CARLO J ,  MORSE STEPHEN P

IPC: G06F3/038 ,  G06F3/14

CPC classification number: G06F3/0383

Abstract: A light pen arrangement is described wherein the light pen has three degrees of freedom, viz. two-dimensional translation in the (X,Y) plane of a cathode ray tube screen and rotation about the projection of its own longitudinal axis to the normal of the screen. To sense the angular position of the light pen, at least two independent light sensitive elements, i.e., fiber optic bundles are required, the latter being suitably provided by dividing the bundle of fiber optics emerging from a single light pen into at least two separate groups and having photosensitive transducer respectively associated with each of the separate groups. When the light pen is placed on the screen and its presence there is sensed, an (X,Y) value pair is stored for the location of each light sensitive area of the light pen, i.e., each of the aforementioned separate fiber optic groups. The storing is accomplished by having an electron beam draw lines or points in each light sensitive area and, receiving in response thereto, interrupts for points or lines in the field of view of each fiber optic group, the (X,Y) coordinate of each point or line causing an interrupt and the fiber optic group that picked up the interrupt is now known to the computer or other control arrangement controlling the cathode ray tube. The computer or control arrangement can then compute the (X,Y) location of the light pen as the centroid of the individual areas and the angular position of the pen.

Abstract translation: 描述了一种光笔布置，其中光笔具有三个自由度，即， 在阴极射线管屏幕的（X，Y）平面上进行二维平移，并且围绕其自身纵轴的投影相对于屏幕的法线旋转。 为了感测光笔的角度位置，需要至少两个独立的光敏元件，即光纤束，后者通过将从单个光笔出射的光纤束分成至少两个分开的组来适当地提供 并具有分别与每个单独组相关联的光敏传感器。 当光笔被放置在屏幕上并且其中存在时，存储用于光笔的每个光敏区域（即上述各个光纤组）的位置的（X，Y）值对。 存储是通过在每个光敏区域中具有电子束绘制线或点来实现的，并且响应于此而接收每个光纤组的视场中的点或线的中断，每个光纤组的（X，Y）坐标 导致中断的点或线，拾取中断的光纤组现在已知到控制阴极射线管的计算机或其他控制装置。 计算机或控制装置然后可以计算光笔的（X，Y）位置作为各个区域的重心和笔的角位置。

公开(公告)号：CA1080365A

公开(公告)日：1980-06-24

申请号：CA266860

申请日：1976-11-30

Applicant: IBM

Inventor： BELADY LASZLO A ,  EVANGELISTI CARLO J

IPC: G06F12/14 ,  G06F11/30 ,  G06F11/34 ,  G06F12/00 ,  G06F21/00 ,  G07C1/00 ,  G06F1/04

Abstract: A data security system employing an automatic time-stamping mechanism for stamping a time accrued in a data storage area or register associated with each envelope or block of a memory or for each data channel of an auxiliary storage device, such that each access or data updates the appropriate time stamp in the memory of storage device. A first instruction provides the fetch of the time stamp with regard to the main memory, and a second instruction provides the fetch with regard to information contained in the data channel corresponding to the auxiliary storage device. For every envelope of a memory, there is a time stamp tag register associated with it. Similarly, there is a time stamp register associated with every data channel. Whenever an envelope of memory is accessed, the time stamp in the form of a unique binary number from a clock, indicating the time of day, is inserted into the tag register associated with that envelope. Examination of the contents of each tag register enables determination of whether there has been access to an envelope up to the present time. A full memory address register is used to access data in the memory while only special high order bits of the memory address register are used to access the time stamp associated with the envelope. The system provides a mechanism which automatically marks blocks of data as they are accessed and cannot be bypassed by altering the program.

公开(公告)号：CA1247251A

公开(公告)日：1988-12-20

申请号：CA502809

申请日：1986-02-26

Applicant: IBM

Inventor： EVANGELISTI CARLO J ,  LUMELSKY LEON

IPC: G06T11/00 ,  G06T1/20 ,  G06F15/66

Abstract: YO984-058 COLOR GRAPHIC PROCESSOR FOR PERFORMING LOGICAL OPERATIONS A color graphic processor includes one or more processing elements responsive to pixel data provided by a frame buffer. The processing element stores pixels from the frame buffer in source and distinction registers. The ALU portion of the procesing element includes a RAM addressed by the registers to produce a result pixel value which can be written back to the frame buffer. The RAM can implement a wide variety of pixel operations by loading the RAM with operation specific data.

公开(公告)号：CA1148264A

公开(公告)日：1983-06-14

申请号：CA363526

申请日：1980-10-29

Applicant: IBM

Inventor： BANTZ DAVID F ,  EVANGELISTI CARLO J ,  NELSON ROBERT A

IPC: G06F11/22 ,  G01R31/317 ,  G01R31/3185 ,  G06F11/267 ,  G06F11/36 ,  G06F11/00

Abstract: A DIAGNOSTIC/DEBUG MACHINE ARCHITECTURE A system is described for enabling the connection of a diagnostic/debugging processor to another host processor for the purpose of troubleshooting that processor's hardware and software. The system is composed of an interface between the diagnostic/ debugging processor per se and the host processor to be diagnosed, and of software resident in the diagnostic processor to perform functions required by the user of the system. The system is specifically designed for use with a host processor utilizing LSSD design rules. YO978-048

公开(公告)号：FR2334149A1

公开(公告)日：1977-07-01

申请号：FR7632296

申请日：1976-10-21

Applicant: IBM

Inventor： BELADY LASZLO A ,  EVANGELISTI CARLO J

IPC: G06F12/14 ,  G06F11/30 ,  G06F11/34 ,  G06F12/00 ,  G06F21/00 ,  G07C1/00 ,  G06F11/00 ,  G06F1/04

Abstract: 1534189 Monitoring storage accesses INTERNATIONAL BUSINESS MACHINES CORP 16 Nov 1976 [4 Dec 1975] 47656/76 Heading G4A A memory 12 or 32 is divided into envelopes 12a-12f or 34 each of which has an associated storage element 18 or 30 in which a time stamp from a clock 20 is recorded each time that envelope is accessed. Time stamp recording is automatic so that by reading the time stamps for particular memory elements a user can determine if any unauthorized access has been made since the last authorized access. Memory 12 may be a random access memory of which time stamp registers 18 form a part. Memory 32 may be a magnetic disc unit having two envelopes 34 and associated time stamp words 30 per track. The arrangement is described in detail in the context of a virtual memory system in which the time stamp registers 18 form an associative memory which is searched by block registers and stores time stamps together with indications as to whether the relevant accesses were for read or write. Any time stamp register 18 can be read by a special instruction FSM which loads the contents of the required register 18 into a specified register in the CPU 10. Each data channel 38 has a corresponding time stamp register 36 which is loaded with a time stamp word 30 whenever a disc envelope is moved via the channel to a memory 12 envelope (the appropriate register 18 and word 30 also time stamped from clock 20). The register 36 contents can be loaded into a specified CPU register by a special instruction FSC. Data envelope transfer between disc 32 and memory 12 takes place serially by word via a shift register buffer.

公开(公告)号：CA1309198C

公开(公告)日：1992-10-20

申请号：CA577725

申请日：1988-09-16

Applicant: IBM

Inventor： EVANGELISTI CARLO J ,  LUMELSKY LEON ,  PAVICIC MARK J

IPC: G06T15/50 ,  G06F15/72

Abstract: YO986-065 PARALLEL RENDERING OF SMOOTHLY SHADED COLOR TRIANGLES WITH ANTI-ALIASED EDGES FOR A THREE DIMENSIONAL COLOR DISPLAY The present invention comprises a method for utilizing an SIMD computer architecture in conjunction with a host processor and coordinate processor to render quality, three-dimensional, anti-aliased shaded color images into the frame buffer of a video display system. The method includes a parallel algorithm for rendering an important graphic primitive for accomplishing the production of a smoothly shaded color three-dimensional triangle with anti-aliased edges. By taking advantage of the SIMD architecture and said parallel algorithm, the very time consuming pixel by pixel computations are broken down for parallel execution. A single coordinate processor computes and transmits an overall triangle record which is essentially the same for all blocks of pixels within a given bounding box which box in turn surrounds each triangle. The individual pixel data is produced by a group of M x N pixel processors and stored in the frame buffer in a series of repetitive steps wherein each step corresponds to the processing of an M x N block of pixels within the bounding box of the triangle. Thus, each pixel processor performs the same operation, modifying its computations in accordance with triangle data received from the coordinate processor and positional data unique to its own sequential connectivity to the frame buffer, thus allowing parallel access to the frame buffer.

公开(公告)号：CA964373A

公开(公告)日：1975-03-11

申请号：CA113003

申请日：1971-05-14

Applicant: IBM

Inventor： EVANGELISTI CARLO J ,  RITTENHOUSE LARRY E

IPC: G06F17/30 ,  G11B20/12 ,  G11B27/10 ,  G11B27/11 ,  G11B27/32 ,  G11B5/09

Abstract: A system is shown wherein, provided with an appropriate file organization, a data file can be read from a disk master file, given the file name, by performing one seek and one read operation. The system employs hash coding to compress a data file name to a disk file address. The disk file is positioned into fixed length blocks where each hashed file address points to a block, the block being as large as one cylinder or as small as one sector. Each block is organized such that it includes a directory for the files contained in the block and also contains the data files. Each entry in the directory contains the data file name and the address of that data file in the block. The process of locating and reading a data file entails the hash coding of a file name to yield a block address, the moving of the read head to the disk area having the block address and the reading of the directory and the remainder of the block to read out the data file. In the directory reading, the data file names are compared in real time, as they are read from the disk, with the name of the desired data file. When a name match occurs, the address of the data file in the block and the address of the next file address are read and stored. As the disk rotates, the desired data file address just read is constantly compared with the active disk address. When a match occurs, the file has been located and is read out. The reading is terminated at the address of the beginning of the next file. If the file name is not found in the directory of the block indicated by the hash coding of the file's name, then the file is not present therein.