会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明授权
    • Stack machine with improved cache memory for variables
    • 堆叠机具有改进的高速缓存用于变量
    • US4517640A
    • 1985-05-14
    • US393533
    • 1982-06-30
    • Akira HattoriHiromu HayashiAkio ShinagawaTsuyoshi Shinogi
    • Akira HattoriHiromu HayashiAkio ShinagawaTsuyoshi Shinogi
    • G06F9/44G06F13/00
    • G06F8/312
    • The present invention discloses a data processing system having a program structure and execution mode where an actual argument is bound to a formal argument of a function to be called by storing a pair of a variable name as the formal argument and a variable as the actual argument into a First-In-Last-Out type stack memory which is an environment list, the function called executes processings using a latest bind value of said environment list when referring to variable values, when a value of such function is obtained, the function value is returned by deleting the formal argument variable of the function from the environment list. The system includes an associative buffer memory provided externally to the stack memory, where at least the variable name and location data of variable on the environment list are stored in the associative buffer memory, and thereby the access time for referring to variables stored in the stack memory can be curtailed.
    • 本发明公开了一种具有程序结构和执行模式的数据处理系统,其中通过存储一对变量名称作为形式参数和变量作为实际参数,实际参数被绑定到要调用的函数的形式参数 进入作为环境列表的先进先出型堆栈存储器中,当获得这种功能的值时,所述功能称为在引用变量值时使用所述环境列表的最新绑定值执行处理,功能值 通过从环境列表中删除函数的形式参数变量返回。 该系统包括在堆栈存储器的外部提供的关联缓冲存储器,其中至少将环境列表上变量的变量名称和位置数据存储在关联缓冲存储器中,从而存储参考存储在堆栈中的变量的访问时间 记忆可以减少
    • 14. 发明授权
    • Method and apparatus for encoding data types for object identification
    • 用于编码对象识别的数据类型的方法和装置
    • US5283878A
    • 1994-02-01
    • US560442
    • 1990-07-31
    • Kelly E. Murray
    • Kelly E. Murray
    • G06F9/44G06F12/06
    • G06F8/312G06F9/44
    • Method and apparatus are provided for encoding data types to identify the type of object being operated on during execution of a computer program on a data processing system including byte-addressed memory. The object is represented by at least one machine word having a plurality of bits. The method includes the steps of storing an object in the byte-addressed memory so that the lower three bits of the object are in a zero state and setting one of the lower three bits to a non-zero state to indicate a particular data type. Three different types of data can be verified by checking the state of a single bit. In one embodiment of the invention the method further includes the step of setting a second one of the lower three bits to a non-zero state to indicate that the object, such as NIL, is a member of two data types. In a second embodiment of the invention the method further includes the step of setting a bit immediately adjacent the lower three bits to a non-zero state to indicate whether the object is a short-float object. The invention has particular utility for use with the computer programs written in a LISP-like language.
    • 提供了用于编码数据类型以识别在包括字节寻址存储器的数据处理系统上的计算机程序执行期间正在操作的对象的类型的方法和装置。 该目标由具有多个位的至少一个机器字表示。 该方法包括以下步骤:将对象存储在字节寻址的存储器中,使得对象的低三位处于零状态,并将低三位中的一个设置为非零状态以指示特定数据类型。 可以通过检查单个位的状态来验证三种不同类型的数据。 在本发明的一个实施例中,该方法还包括将低三位中的第二位设置为非零状态以指示诸如NIL的对象是两种数据类型的成员的步骤。 在本发明的第二实施例中,该方法还包括将紧邻低三位的位设置为非零状态以指示对象是短浮点对象的步骤。 本发明特别适用于以类似LISP的语言编写的计算机程序。
    • 16. 发明授权
    • Computer
    • 电脑
    • US3646523A
    • 1972-02-29
    • US3646523D
    • 1969-09-24
    • IBM
    • BERKLING KLAUS JUERGEN
    • G06F9/00G06F9/44G06F15/00G11C15/04G06F7/00
    • G06F8/312G11C15/04
    • A computer is disclosed wherein the machine language thereof is a particular formal system, i.e., the ''''calculus of lambda conversion.'''' Such machine language is the language 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 columns. The 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.e., shifted through the whole tablet.