At least some embodiments disclosed herein relate generally to computer architecture and more specifically, but not limited to, memory addresses for computer processors.
A memory address in a computing system identifies a memory location in the computing system. Memory addresses are fixed-length sequences of digits conventionally displayed and manipulated as unsigned integers. The length of the sequences of digits or bits can be considered the width of the memory addresses. Memory addresses can be used in certain structures of central processing units (CPUs), such as instruction pointers (or program counters) and memory address registers. The size or width of such structures of a CPU typically determines the length of memory addresses used in such a CPU.
The embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.
The present disclosure includes the techniques of using static object identification numbers in addresses of a predetermined width (e.g., 128-bit) for an instruction set (e.g., 128-bit instructions) to represent certain types of objects, such as kernel objects, objects using addresses of a smaller width (e.g., 64-bit, 32-bit) that are generated and/or used by other instruction sets (e.g., 64-bit instructions, 32-bit instructions), etc. In general, the addresses of the predetermined width (e.g., 128-bit) can be generated using various instruction sets (e.g., 128-bit instructions, 64-bit instructions, 32-bit instructions) in various processors that can use such instruction sets to generate and/or use addresses of the predetermined width (e.g., 128-bit). Thus, the predetermined width (e.g., 128-bit) is not limited to a particular type of instruction sets and/or instructions of a particular width.
In
An example of the 128-bit instruction set is RV128 of RISC-V instruction set identified by the RISC-V Foundation.
The processor (101) is configured with registers (e.g., 102) of a predetermined width, such as 128 bits. The processor (101) can fetch an instruction (105) of the predetermined width, and use an execute unit (103) to perform operations on data provided in the instruction (105) and/or data provided in one or more registers (e.g., 102) identified in the instruction (105), and when applicable, store the result of the operations identified by the instruction (105) in a register identified in the instruction (105).
The registers (e.g., 102) can include a memory register of the predetermined width (e.g., 128 bits) and/or an instruction pointer (or program counter) of the predetermined width (e.g., 128 bits).
For example, an instruction can be coded according to the predetermined specification of an instruction set to perform integer computation (e.g., add, or, xor), to perform control transfer (e.g., jump, branch), to load data/instructions from memory at a memory location specified using an address (e.g., 111) of the predetermined width, or to store data at a memory location specified using an address (e.g., 111) of the predetermined width (e.g., 128 bits).
For example, the address (111) can be used to identify a memory location storing an instruction in the computer system; and the address (111) can be placed in an instruction pointer (or program counter) to identify the instruction to be executed by the processor (101).
For example, the address (111) can be used to identify a memory location storing a data item in the computer system; and the address (111) can be placed in a memory register to identify the data to be operated upon by the processor (101) in executing an instruction.
Typically, a 128-bit instruction set can address a 128-bit address space. Similarly, a 64-bit instruction set can address a 64-bit address space; and a 32-bit instruction set can address a 32-bit address space.
In some instances, a 64-bit instruction (e.g., 125) (or a 32-bit instruction (e.g., 126)) can also generate and/or use a 128-bit address (e.g., 111). For example, when a 128-bit address is stored in an address register (e.g., 102), the 64-bit instruction (125) (or a 32-bit instruction (126)) executed in the processor (101) (and/or another processor) can operate upon or use the 128-bit address (111) and/or generate another 128-bit address. Thus, the width of memory addresses is not necessarily limited by the width of instructions that generate or use the memory addresses.
In the computer system illustrated in
The 64-bit offset (115) can be used for indexing, such as program counter, stack pointer, for loading data and/or instruction from a memory location or for storing data at the location. The memory location can be in a main memory (107) connected to the processor (101) via one communication channel (e.g., a memory bus), or a storage (119) connected to the processor via another communication channel (e.g., over a network 109)
In general, the 128-bit address system illustrated in
In response to an instruction (105, 125 or 126), the processor (101) can access a data item identified by the 128-bit memory address (111) stored in a register (102). The object ID (113) of the address (111) is usable to identify an object having a distinct name. Such an object can be a software or hardware structure with a name controlled, allocated, issued, and/or registered by a centralized name server (117). The name server (117) can be coupled to the processor (101) via a computer network (109); and the object (e.g., 121 or 123) represented by the object ID (113) can be in the memory (107) that is coupled to the processor (101) via a memory bus, or in a storage (119) that is coupled to the processor (101) via the network (109), or in memory coupled to another processor on the network (109).
An object identified by an object ID (113) in the address (111) can be used to specify location and protection mechanisms, language specific/architecture attributes, such as partitioned global address space (PGAS) node), data encrypted, and/or blockchain.
The object ID (113) of the corresponding object (121 or 123) can be created or allocated using the name server (117) for the entire computer system connected by the network (109), which can include the Internet.
Preferably, the address space using addresses (e.g., 111) in the format illustrated in
When a processor (101) is accessing an object for the first time, the access can require verification of permission to access (e.g., download an executable file, access an entry in an Access Control List (ACL)), and verification of access privileges for the object (e.g., read, write, execute, access through a protected sub-object, execution domain). Execution domain can be identified via classifications of the levels of users (e.g., gold, platinum, executive platinum) and admin level (e.g., 1, 2, . . . , n).
Certain static object IDs can be used to identify predetermined object types or object spaces, as illustrated in
For example, an object ID (141) having a predetermined value of zero (0) can be used to identify any kernel object (133) of an operating system (131); and the object ID (141) can be static for kernel objects (e.g., 133) across all the nodes in the computer system, regardless of the location of the kernel object (133) in the computer system. The operation system (131) can have utilities (e.g., 135) are not part of the kernel (133).
For example, an object ID (143) having a predetermined value of one (1) can be used to identify any object of an application (137) programmed using 64-bit instructions (143); and the object ID (143) can be static for 64-bit instruction objects (e.g., 137) across all the nodes in the computer system, regardless of the location of the 64-bit instruction object (137) in the computer system.
For example, an object ID (145) having a predetermined value of two (2) can be used to identify any object of an application (139) programmed using 32-bit instructions (147); and the object ID (145) can be static for 32-bit instruction objects (e.g., 139) across all the nodes in the computer system, regardless of the location of the 32-bit instruction object (139) in the computer system.
The static object IDs (141, 143, and/or 145) provide predetermined information about the objects accessed via the memory addresses (e.g., 111) having the static object IDs (141, 143, and/or 145).
For example, when the processor (101) accesses a memory location using the address (111) where the object ID (113) is the static object ID (141), the processor (101) can determine that the data or instruction stored in the memory location is for a kernel object (133) of an operating system (131). Thus, the processor (101) can adjust its operations (e.g., priority level, security level) based on the information that the accessed memory is for an operating system kernel (133).
Similarly, when the processor (101) accesses a memory location using the address (111) where the object ID (113) is the static object ID (143 or 145), the processor (101) can determine that the data or instruction stored in the memory location is for a 64-bit application (137) or a 32-bit application (139). Thus, the processor (101) can adjust its operations to optimize performances, priority and/or security for the application.
In general, static object IDs (e.g., 141, 143, and/or 145) can be used to provide the processor (101) with predetermined information about the objects referenced by the memory address (111) containing the static object IDs (e.g., 141, 143, and/or 145), without a need to contact the name server (117) to look up the property of the objects (e.g., 121 or 123). Thus, the computer system and/or the processor (101) can use the predetermined information in efficiently processing the data and/or instruction fetched using the address (111) that contains the static object IDs (e.g., 141, 143, or 145). For example, a static ID can be used to identify a partitioned global address space (PGAS) address of a predetermined width (e.g., 128-bit or 64 bit), a version of internet protocol addresses (e.g., Internet Protocol version 6 (IPv6)), a unique ID, etc. For example, a static ID can be used to indicate whether the object is a user object, a kernel object of an operating system (OS), or a non-kernel portion of an OS/server object. For example, a static ID can be used to indicate whether a system call is invoked, whether a call to the non-kernel portion of an OS/server is invoked, or whether a call to the kernel of an OS is invoked. In some instances, an address can have more than one static object ID encoded therein according to a predetermined scheme. For example, the static object IDs can be provided in an address without being limited to a particular 64-bit field of the address.
Using the static object identifications (143 and 145), a computing system can automatically map the 64-bit address space and the 32-bit address space to the 128-bit address space according to predetermined rules. The conversion rule allows a 128-bit processor to run 64-bit applications and 32-bit applications.
For example, a 64-bit address (151) used by an application (137) programmed using 64-bit instructions (147) can be converted to a 128-bit address using the predetermined object ID (143) (e.g., a predetermined value of one (1)) for 64-bit objects, and using the 64-bit address (151) as the offset (115) in the 128-bit address (111), as illustrated in
For example, a 32-bit address (153) used by an application (139) programmed using 32-bit instructions (149) can be converted to a 128-bit address using the predetermined object ID (145) (e.g., a predetermined value of two (2)) for 32-bit objects, and using the 32-bit address (153) as the offset (115) in the 128-bit address (111), as illustrated in
The techniques disclosed herein can be applied to at least to computer systems where processors are separated from memory and processors communicate with memory and storage devices via communication buses and/or computer networks. Further, the techniques disclosed herein can be applied to computer systems in which processing capabilities are integrated within memory/storage. For example, the processing circuits, including executing units and/or registers of a typical processor, can be implemented within the integrated circuits and/or the integrated circuit packages of memory media to performing processing within a memory device. Thus, a processor (e.g., 101) as discussed above and illustrated in the drawings is not necessarily a central processing unit in the von Neumann architecture. The processor can be a unit integrated within memory to overcome the von Neumann bottleneck that limits computing performance as a result of a limit in throughput caused by latency in data moves between a central processing unit and memory configured separately according to the von Neumann architecture.
The description and drawings of the present disclosure are illustrative and are not to be construed as limiting. Numerous specific details are described to provide a thorough understanding. However, in certain instances, well known or conventional details are not described in order to avoid obscuring the description. References to one or an embodiment in the present disclosure are not necessarily references to the same embodiment; and, such references mean at least one.
In the foregoing specification, the disclosure has been described with reference to specific exemplary embodiments thereof. It will be evident that various modifications can be made thereto without departing from the broader spirit and scope as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.
The present application claims the benefit of the filing date of Prov. U.S. Pat. App. Ser. No. 62/665,936, filed May 2, 2018 and entitled “Static Identifications in Object-based Memory Access,” the entire disclosure of which application is hereby incorporated herein by reference. The present application relates to U.S. patent application Ser. No. 16/028,750, filed on the same day as the present application and entitled “Securing Conditional Speculative Instruction Execution”, which claims the benefit of the filing date of Prov. U.S. Pat. App. Ser. No. 62/665,743, filed May 2, 2018 and entitled “Static Identifications in Object-based Memory Access,” the entire disclosures of which applications are hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4445177 | Bratt et al. | Apr 1984 | A |
4454579 | Pilat et al. | Jun 1984 | A |
4514800 | Gruner et al. | Apr 1985 | A |
4525780 | Bratt et al. | Jun 1985 | A |
4660142 | Clancy et al. | Apr 1987 | A |
4821184 | Clancy et al. | Apr 1989 | A |
5226161 | Khoyi et al. | Jul 1993 | A |
6446188 | Henderson et al. | Sep 2002 | B1 |
7149878 | Jensen et al. | Dec 2006 | B1 |
7366882 | Sahraoui et al. | Apr 2008 | B2 |
8635412 | Wilshire | Jan 2014 | B1 |
8862861 | Olson et al. | Oct 2014 | B2 |
9798873 | Glew et al. | Oct 2017 | B2 |
9886532 | Scallon | Feb 2018 | B1 |
10761855 | Wallach | Sep 2020 | B2 |
20020031135 | Inoue | Mar 2002 | A1 |
20020174327 | Kruckemyer et al. | Nov 2002 | A1 |
20020174328 | Kruckemyer | Nov 2002 | A1 |
20030033344 | Abbott et al. | Feb 2003 | A1 |
20030140085 | Moir et al. | Jul 2003 | A1 |
20040103213 | Park | May 2004 | A1 |
20060095895 | K. | May 2006 | A1 |
20070043531 | Kosche et al. | Feb 2007 | A1 |
20090327613 | Nutter | Dec 2009 | A1 |
20090327617 | Furuichi et al. | Dec 2009 | A1 |
20100118734 | Weilnau, Jr. | May 2010 | A1 |
20100228936 | Wright et al. | Sep 2010 | A1 |
20100235598 | Bouvier | Sep 2010 | A1 |
20110314238 | Finkler et al. | Dec 2011 | A1 |
20120254497 | Ni et al. | Oct 2012 | A1 |
20130132695 | Heo et al. | May 2013 | A1 |
20140025770 | Warfield | Jan 2014 | A1 |
20140181480 | Diestelhorst et al. | Jun 2014 | A1 |
20150046661 | Gathala et al. | Feb 2015 | A1 |
20150370561 | Stark | Dec 2015 | A1 |
20160210082 | Frank et al. | Jul 2016 | A1 |
20160350019 | Koufaty et al. | Dec 2016 | A1 |
20160364172 | Frank et al. | Dec 2016 | A1 |
20160371496 | Sell | Dec 2016 | A1 |
20160381050 | Shanbhogue et al. | Dec 2016 | A1 |
20170091444 | Woodward et al. | Mar 2017 | A1 |
20170147505 | Baxter et al. | May 2017 | A1 |
20170199815 | Frank | Jul 2017 | A1 |
20180113811 | King | Apr 2018 | A1 |
20180191671 | Choi | Jul 2018 | A1 |
20190196983 | Khosravi et al. | Jun 2019 | A1 |
20190339977 | Wallach | Nov 2019 | A1 |
20200073822 | Wallach | Mar 2020 | A1 |
20200133677 | Wallach | Apr 2020 | A1 |
20200356374 | Wallach | Nov 2020 | A1 |
Entry |
---|
“Branch Predictor”, https://en.wikipedia.org/wiki/Branch_predictor, printed on Apr. 30, 2018, 12 pages. |
Speculative execution, Wikipedia, printed on Jun. 27, 2018. |
URL, Wikipedia, printed on Oct. 12, 2018. |
Branch predictor, Wikipedia, printed on Jun. 27, 2018. |
Computer file, Wikipedia, printed on Oct. 12, 2018. |
File system, Wikipedia, printed on Oct. 12, 2018. |
Steve Wallach, “128-Bit Addressing in RISC-V and Security”, 5th RISC-V Workshop Proceedings, Nov. 2016. |
Instruction set architecture, Wikipedia, printed on Oct. 16, 2018. |
Jann Hom, “Project Zero: Reading privileged memory with a side-channel”, Jan. 3, 2018. |
Mark D. Hill, “On the Meltdown & Spectre Design Flaws”, Feb. 2018. |
Memory address register, Wikipedia, printed on Jun. 26, 2018. |
Memory address, Wikipedia, printed on Jun. 26, 2018. |
Operating system, Wikipedia, printed on Apr. 18, 2018. |
Pointer, Wikipedia, printed on Oct. 11, 2018. |
Program counter, Wikipedia, printed on Jun. 26, 2018. |
Reference, Wikipedia, printed on Oct. 12, 2018. |
The RISC-V Instruction Set Manual, vol. II: Privileged Architecture, May 7, 2017. |
The RISC-V Instruction Set Manual, vol. I: User-Level ISA, May 7, 2017. |
International Search Report and Written Opinion, PCT/US2019/048006, dated Dec. 11, 2019. |
International Search Report and Written Optinion, PCT/US2019/056819, dated Feb. 7, 2020. |
Chen, et al. “Control Flow Obfuscation with Information Flow Tracking,” ACM, 2009. |
Wolczko, et al. “The influence of the Object-Oriented Language Model on a Supporting Architecture,” Kluwer Academic Publishers, 1994. |
Securing Conditional Speculative Instruction Execution, U.S. Appl. No. 16/028,750, filed Jul. 6, 2018 Inventor(s): Steven Wallach Status: Docketed New Case—Ready for Examination Status Date: Dec. 16, 2018. |
Universal Pointers for Data Exchange in a Computer System Having Independent Processors, U.S. Appl. No. 16/170,799, filed Oct. 25, 2018 Inventor(s): Steven Wallach Status: Docketed New Case—Ready for Examination Status Date: Dec. 14, 2018. |
Number | Date | Country | |
---|---|---|---|
20190339974 A1 | Nov 2019 | US |
Number | Date | Country | |
---|---|---|---|
62665936 | May 2018 | US |