US20170132346A1 - Circuit modification - Google Patents
Circuit modification Download PDFInfo
- Publication number
- US20170132346A1 US20170132346A1 US14/936,690 US201514936690A US2017132346A1 US 20170132346 A1 US20170132346 A1 US 20170132346A1 US 201514936690 A US201514936690 A US 201514936690A US 2017132346 A1 US2017132346 A1 US 2017132346A1
- Authority
- US
- United States
- Prior art keywords
- memory address
- physical memory
- instruction
- circuit
- translation path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000012986 modification Methods 0.000 title claims abstract description 49
- 230000004048 modification Effects 0.000 title claims abstract description 49
- 238000013519 translation Methods 0.000 claims abstract description 93
- 238000012360 testing method Methods 0.000 claims abstract description 78
- 238000000034 method Methods 0.000 claims abstract description 37
- 230000007547 defect Effects 0.000 claims abstract description 28
- 238000013507 mapping Methods 0.000 claims abstract description 21
- 230000000051 modifying effect Effects 0.000 claims abstract description 14
- 230000008859 change Effects 0.000 claims abstract description 10
- 238000004590 computer program Methods 0.000 claims description 12
- 238000010586 diagram Methods 0.000 description 16
- 239000003607 modifier Substances 0.000 description 14
- 238000013461 design Methods 0.000 description 10
- 238000012545 processing Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 7
- 230000008569 process Effects 0.000 description 5
- 230000006399 behavior Effects 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 230000001902 propagating effect Effects 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 229910052802 copper Inorganic materials 0.000 description 1
- 239000010949 copper Substances 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000004936 stimulating effect Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R31/00—Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
- G01R31/28—Testing of electronic circuits, e.g. by signal tracer
-
- G06F17/5045—
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/22—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
- G06F11/26—Functional testing
- G06F11/263—Generation of test inputs, e.g. test vectors, patterns or sequences ; with adaptation of the tested hardware for testability with external testers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/10—Address translation
- G06F12/1027—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/32—Circuit design at the digital level
- G06F30/33—Design verification, e.g. functional simulation or model checking
- G06F30/3308—Design verification, e.g. functional simulation or model checking using simulation
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R27/00—Arrangements for measuring resistance, reactance, impedance, or electric characteristics derived therefrom
- G01R27/28—Measuring attenuation, gain, phase shift or derived characteristics of electric four pole networks, i.e. two-port networks; Measuring transient response
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R31/00—Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
- G01R31/12—Testing dielectric strength or breakdown voltage ; Testing or monitoring effectiveness or level of insulation, e.g. of a cable or of an apparatus, for example using partial discharge measurements; Electrostatic testing
- G01R31/14—Circuits therefor, e.g. for generating test voltages, sensing circuits
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/10—Program control for peripheral devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G06F17/30312—
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/68—Details of translation look-aside buffer [TLB]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/32—Circuit design at the digital level
- G06F30/33—Design verification, e.g. functional simulation or model checking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
Definitions
- the present disclosure relates to circuits, and more specifically, but not exclusively, to modifying a circuit.
- a system for modifying a circuit can include a processor to generate a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address.
- the processor can also detect a predetermined modification to a translation path corresponding to a memory address mapping, the predetermined modification to change the first physical memory address associated with the first virtual memory address to the second physical memory address.
- the processor can also generate a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the second physical memory address in the translation path.
- the processor can transmit the test template to the circuit for each of a plurality of software instruction threads and detect a defect in the execution of the test template by the circuit. Additionally, the processor can modify the circuit to prevent the defect during execution of the test template.
- a method for modifying a circuit can include generating a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address.
- the method can also include detecting a predetermined modification to a translation path corresponding to a memory address mapping, the predetermined modification to change the first physical memory address associated with the first virtual memory address to the second physical memory address.
- the method can include generating a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the second physical memory address in the translation path.
- the method can include transmitting the test template to the circuit for each of a plurality of software instruction threads and detecting a defect in the execution of the test template by the circuit. Moreover, the method can include modifying the circuit to prevent the defect during execution of the test template.
- a computer program product for modifying a circuit can include a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se.
- the program instructions can be executable by a processor to cause the processor to generate a set of testing data, the set of testing data comprising at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address.
- the program instructions can be executable by a processor to cause the processor to detect a predetermined modification to a translation path corresponding to a memory address mapping, the predetermined modification to change the first physical memory address associated with the first physical memory address to the second physical memory address.
- the program instructions can be executable by a processor to cause the processor to generate a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the second physical memory address in the translation path and transmit the test template to the circuit for each of a plurality of software instruction threads.
- the program instructions can be executable by a processor to cause the processor to detect a defect in the execution of the test template by the circuit and modify the circuit to prevent the defect during execution of the test template.
- FIG. 1 depicts a block diagram of an example computing system that can modify a circuit according to an embodiment described herein;
- FIG. 2 is a process flow diagram of an example method that can modify a circuit according to an embodiment described herein;
- FIG. 3 is an example illustration of a modified translation path
- FIG. 4 is an example illustration of a modified translation path
- FIG. 5 is a tangible, non-transitory computer-readable medium that can modify a circuit according to an embodiment described herein.
- the testing process can include stimulating a circuit design, detecting erroneous behavior, detecting a root cause of erroneous behavior, and determining a modification to the circuit or circuit design that prevents the erroneous behavior from occurring.
- techniques include generating applications that can modify or translate a memory path used to access data. The modification to the memory path can be generated offline in some examples.
- a translation path includes any number of mappings from any number of tables to retrieve data stored at a physical memory address. For example, data stored in some physical memory addresses can be retrieved through various memory tables that map a first virtual memory address to a second memory address.
- the techniques described herein can enable the modification of a table so that a virtual memory address points to an alternate table or alternate physical memory address.
- the techniques described herein can also enable a modification of properties of the translation path.
- the tables in the translation path may include any number of pages of virtual memory addresses and the tables may map virtual addresses according to caching properties.
- these properties of the translation paths can be modified.
- the modifications to the translation paths can identify defects or unexpected behavior in the execution of instructions by a circuit being tested.
- the modifications to the translation paths can be generated offline prior to executing a test on a circuit.
- the techniques described herein can reduce the amount of time to test a circuit and result in a circuit or circuit design that is free from defects.
- the computing device 100 may be for example, a server, desktop computer, laptop computer, tablet computer, or smartphone.
- computing device 100 may be a cloud computing node.
- Computing device 100 may be described in the general context of computer system executable instructions, such as program modules, being executed by a computer system.
- program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types.
- Computing device 100 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network.
- program modules may be located in both local and remote computer system storage media including memory storage devices.
- the computing device 100 may include a processor 102 that is adapted to execute stored instructions, a memory device 104 to provide temporary memory space for operations of said instructions during operation.
- the processor can be a single-core processor, multi-core processor, computing cluster, or any number of other configurations.
- the memory 104 can include random access memory (RAM), read only memory, flash memory, or any other suitable memory systems.
- the processor 102 may be connected through a system interconnect 106 (e.g., PCI®, PCI-Express®, etc.) to an input/output (I/O) device interface 108 adapted to connect the computing device 100 to one or more I/O devices 110 .
- the I/O devices 110 may include, for example, a keyboard and a pointing device, wherein the pointing device may include a touchpad or a touchscreen, among others.
- the I/O devices 110 may be built-in components of the computing device 100 , or may be devices that are externally connected to the computing device 100 .
- the processor 102 may also be linked through the system interconnect 106 to a display interface 112 adapted to connect the computing device 100 to a display device 114 .
- the display device 114 may include a display screen that is a built-in component of the computing device 100 .
- the display device 114 may also include a computer monitor, television, or projector, among others, that is externally connected to the computing device 100 .
- a network interface controller (NIC) 116 may be adapted to connect the computing device 100 through the system interconnect 106 to the network 118 .
- the NIC 116 can transmit data using any suitable interface or protocol, such as the internet small computer system interface, among others.
- the network 118 may be a cellular network, a radio network, a wide area network (WAN), a local area network (LAN), or the Internet, among others.
- An external computing device 120 may connect to the computing device 100 through the network 118 .
- external computing device 120 may be an external webserver 120 .
- external computing device 120 may be a cloud computing node.
- the processor 102 may also be linked through the system interconnect 106 to a storage device 122 that can include a hard drive, an optical drive, a USB flash drive, an array of drives, or any combinations thereof.
- the storage device may include a builder 124 , a generator 126 , and a modifier 128 .
- the builder 124 , generator 126 , and modifier 128 together can detect defects in circuits or circuit designs based on test templates and modify the circuits or circuit designs.
- the builder 124 can generate a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address.
- the builder 124 can also detect a predetermined modification to a translation path corresponding to a memory address mapping. Mapping, or memory address mapping, as referred to herein, includes detecting or generating pointers from one virtual memory address to a second virtual memory address or physical memory address.
- the predetermined modification can change a first physical memory address mapped to, or associated with, a first virtual memory address to a second physical memory address.
- a translation path may include a table with a first virtual memory address that maps or links to a physical memory address.
- the translation path may be modified to include an alternate table with a second virtual memory address that maps to the physical memory address.
- the properties of the translation path can be modified. This is discussed in greater detail below in relation to FIGS. 2-4 .
- the generator 126 can generate a test template comprising a first instruction to implement the predetermined modification of a translation path and a second instruction comprising an alternate or second physical memory address in the translation path.
- the first instruction can modify a table in the translation path and the second instruction can include a request for data stored in the physical memory address referenced by the modified table.
- the generator 126 can also transmit the test template to a circuit for each of a plurality of software instruction threads. For example, any number of software instruction threads can modify translation paths in order to search for and identify defects in a circuit.
- the modifier 128 can detect a defect in the execution of the test template by the circuit. For example, the modifier 128 can detect that the modified translation path does not return the correct or expected data from a physical memory address. In some embodiments, the modifier 128 can modify the circuit to prevent the defect during execution of the test template. For example, the modifier 128 can modify a circuit or circuit design so that a modified translation path accesses data from the correct physical memory address. This is discussed in greater detail below in relation to FIG. 2 .
- FIG. 1 the block diagram of FIG. 1 is not intended to indicate that the computing device 100 is to include all of the components shown in FIG. 1 . Rather, the computing device 100 can include fewer or additional components not illustrated in FIG. 1 (e.g., additional memory components, embedded controllers, modules, additional network interfaces, etc.). Furthermore, any of the functionalities of the builder 124 , generator 126 , and modifier 128 may be partially, or entirely, implemented in hardware and/or in the processor 102 . For example, the functionality may be implemented with an application specific integrated circuit, logic implemented in an embedded controller, or in logic implemented in the processor 102 , among others.
- the functionalities of the builder 124 , generator 126 , and modifier 128 can be implemented with logic, wherein the logic, as referred to herein, can include any suitable hardware (e.g., a processor, among others), software (e.g., an application, among others), firmware, or any suitable combination of hardware, software, and firmware.
- the logic can include any suitable hardware (e.g., a processor, among others), software (e.g., an application, among others), firmware, or any suitable combination of hardware, software, and firmware.
- FIG. 2 is a process flow diagram of an example method that can modify a circuit.
- the method 200 can be implemented with any suitable computing device, such as the computing device 100 of FIG. 1 .
- a builder 124 can generate a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address.
- the builder 124 can generate a first virtual memory address that maps to a first physical memory address through any suitable number of tables.
- the builder 124 can also generate a second virtual memory address that maps to a second physical memory address through a separate set of tables. This is described in greater detail below in relation to FIG. 4 .
- a builder 124 can detect a predetermined modification to a translation path corresponding to a memory address mapping.
- a translation path can include any number of mappings from any number of tables to retrieve data stored at a physical memory address.
- the translation path can also include a mapping from a range of virtual memory addresses to a range of physical memory addresses.
- the translation path includes a number of tables that can map a virtual memory address to a physical memory address.
- the predetermined modification can change a first virtual memory address associated with a first physical memory address to a second physical memory address.
- a range of virtual memory addresses can be modified to map to an alternate or new range of physical memory addresses.
- the range of virtual memory addresses linked to a range of physical memory addresses can correspond to a mapping stored in a translation look aside buffer.
- the predetermined modification can also include changes to the properties of the translation path.
- the properties of the translation path such as the size of tables that store virtual memory addresses, can be modified.
- modifying properties of the translation path can include modifying a page size or a caching property, or any other suitable characteristic of a translation path.
- the generator 126 can generate a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the physical memory address in the translation path.
- the first instruction is executed prior to the second instruction.
- the first instruction can modify the translation paths used by a system to access data stored at one or more physical memory addresses. The modification can be implemented in accordance with the various techniques outlined above in relation to block 204 .
- the second instruction generated by the generator 126 can include any suitable operation that requests data from a physical memory address corresponding to the modified translation path.
- the second instruction can include a read or write instruction, among others, that requests data stored in the physical memory address corresponding to the modified translation path.
- the physical memory address corresponding to the modified translation path can be accessed via a different table in the modified translation path, accessed via a different virtual memory address via the modified translation path, or the physical memory address may correspond to an alternate physical memory address.
- the alternate physical memory address may be a new physical memory address that is mapped or linked to an existing virtual memory address.
- the generator 126 can randomly generate any number of instructions for the test template and detect a location in the test template to insert the first instruction and the second instruction. For example, the generator 126 can detect a predetermined location to insert the first instruction and the second instruction in the test template. In some examples, the predetermined location to insert the first instruction and the second instruction can be included in a statement within the test template.
- the generator 126 can transmit the test template to a circuit for each of a plurality of software instruction threads.
- transmitting the test template to a circuit is simulated by an application that transmits the test template to a verification or simulation program for a circuit model.
- the test template as referred to herein, can include any suitable number of modifications to translation paths corresponding to any number of physical memory addresses.
- the test template can also include any number of instructions that can be executed following the modifications to the translation paths, wherein the instructions verify that the modified translation paths retrieve the expected values.
- the instruction of the test template that modified a translation path can be an atomic instruction that includes a semaphore or lock.
- the semaphore or lock can prevent other threads from accessing a translation path as the translation path is modified.
- each thread executing the test template can, during a locked phase, invalidate translation entries in existing tables in translation paths in memory and cache devices, select new modified translation paths, and update tables in existing translation paths based on the modifications.
- the tables can be updated by copying data to map or link tables in the modified translation paths.
- any number of tables associated with a first virtual memory address can be copied to tables associated with a second virtual memory address. Thus, the data used to translate a virtual memory address to a physical address can be copied.
- the modifier 128 can detect a defect in the execution of the test template by the circuit. For example, the modifier 128 can detect that a circuit or circuit design returns an incorrect or unexpected value in response to executing an instruction that references a modified translation path.
- the defect can include returning a value that differs from the value stored in a physical memory address linked to the modified translation path.
- the modifier 128 can modify the circuit to prevent the defect during execution of the test template.
- the modifier 128 can modify the design of a circuit so that the circuit accesses the correct physical memory address based on the modified translation path.
- the method 200 can include any suitable number of additional operations.
- the modifier 128 can store data related to a circuit test in a database.
- any number of instructions that modify translation paths, instructions that are executed to detect defects in a circuit, translation paths, modified virtual memory addresses, and physical memory addresses linked to modified virtual memory addresses, among others, can be stored in a database.
- the predetermined modification can be based on constraints associated with a translation path.
- the constraints may include a maximum number of virtual memory addresses that can be stored in a table in a translation path, and the like.
- the modified translation path can include a table that is modified to link to an alternate or new physical memory address.
- FIG. 3 is an example illustration of a modified translation path.
- the modified translation path can be generated with any suitable computing device such as computing device 100 of FIG. 1 .
- a translation path 300 can include a link from a first set of virtual memory addresses 302 in a first table 304 (also referred to herein as EA-T0) to a set of physical memory addresses 306 (also referred to herein as main reservation) in a second table 308 (also referred to herein as RA).
- the set of physical memory addresses 306 can also be linked or mapped to a second set of virtual memory addresses 310 in a third table 312 (also referred to herein as EA-T1).
- the translation path 300 can be modified so that the first set of virtual memory addresses 302 in the first table 304 are linked or mapped to an alternate set of memory addresses 314 (also referred to herein as a shadow reservation).
- the alternate set of memory addresses in the second table 308 can map to the same virtual memory addresses 310 in the third table 312 as the set of physical memory addresses 306 in the second table 308 .
- FIG. 4 is an example illustration of a modified translation path.
- the modified translation path can be generated with any suitable computing device such as computing device 100 of FIG. 1 .
- the translation path 400 can include a virtual memory address 402 (also referred to herein as an effective address) that can map or link to any number of tables such as table 1 404 , table 2 406 , through table N 408 .
- a virtual memory address 402 also referred to herein as an effective address
- any suitable number of tables can link to each other between table 2 406 and table N 408 .
- Table N 408 can link to one or more physical memory addresses (also referred to herein as a real address) 410 .
- the translation path 400 can be modified so that the virtual memory address 402 is no longer linked to data stored in the real or physical address 410 .
- table 1 404 can be linked to table 2′ 412 rather than table 2 406 .
- Table 2′ can be linked through any suitable number of tables to table N′ 414 , which can be linked or mapped to an auxiliary or alternate real address 416 .
- the alternate real address 416 can be any suitable physical memory address that can store data.
- the modified translation path 400 can then return data values stored in the auxiliary real address 416 when instructions including the effective address 402 are executed.
- an auxiliary effective address 418 can also link or map to the data stored in the auxiliary real address 416 through table 1′ 420 , table 2′ 412 , and table N′ 414 .
- the present invention may be a system, a method, and/or a computer program product.
- the computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
- the computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device.
- the computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing.
- a non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing.
- RAM random access memory
- ROM read-only memory
- EPROM or Flash memory erasable programmable read-only memory
- SRAM static random access memory
- CD-ROM compact disc read-only memory
- DVD digital versatile disk
- memory stick a floppy disk
- a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon
- a computer readable storage medium is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
- Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network.
- the network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers.
- a network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
- Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages.
- the computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server.
- the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
- electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
- These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
- These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
- the computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
- each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s).
- the functions noted in the block may occur out of the order noted in the figures.
- two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved.
- FIG. 5 a block diagram is depicted of an example of a tangible, non-transitory computer-readable medium that can modify a circuit.
- the tangible, non-transitory, computer-readable medium 500 may be accessed by a processor 502 over a computer interconnect 504 .
- the tangible, non-transitory, computer-readable medium 500 may include code to direct the processor 502 to perform the operations of the current method.
- a builder 506 can generate a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address.
- the builder 506 can also detect a predetermined modification to a translation path corresponding to a memory address mapping, wherein the predetermined modification can change a first physical memory address associated with a first physical memory address to a second physical memory address.
- a generator 508 can generate a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the second physical memory address in the translation path.
- the generator 508 can also transmit the test template to the circuit for each of a plurality of software instruction threads.
- a modifier 510 can detect a defect in the execution of the test template by the circuit and modify the circuit to prevent the defect during execution of the test template.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- Tests Of Electronic Circuits (AREA)
Abstract
Description
- The present disclosure relates to circuits, and more specifically, but not exclusively, to modifying a circuit.
- According to an embodiment described herein, a system for modifying a circuit can include a processor to generate a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address. The processor can also detect a predetermined modification to a translation path corresponding to a memory address mapping, the predetermined modification to change the first physical memory address associated with the first virtual memory address to the second physical memory address. The processor can also generate a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the second physical memory address in the translation path. Furthermore, the processor can transmit the test template to the circuit for each of a plurality of software instruction threads and detect a defect in the execution of the test template by the circuit. Additionally, the processor can modify the circuit to prevent the defect during execution of the test template.
- According to another embodiment, a method for modifying a circuit can include generating a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address. The method can also include detecting a predetermined modification to a translation path corresponding to a memory address mapping, the predetermined modification to change the first physical memory address associated with the first virtual memory address to the second physical memory address. Furthermore, the method can include generating a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the second physical memory address in the translation path. Additionally, the method can include transmitting the test template to the circuit for each of a plurality of software instruction threads and detecting a defect in the execution of the test template by the circuit. Moreover, the method can include modifying the circuit to prevent the defect during execution of the test template.
- According to another embodiment, a computer program product for modifying a circuit can include a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se. The program instructions can be executable by a processor to cause the processor to generate a set of testing data, the set of testing data comprising at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address. Additionally, the program instructions can be executable by a processor to cause the processor to detect a predetermined modification to a translation path corresponding to a memory address mapping, the predetermined modification to change the first physical memory address associated with the first physical memory address to the second physical memory address. Furthermore, the program instructions can be executable by a processor to cause the processor to generate a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the second physical memory address in the translation path and transmit the test template to the circuit for each of a plurality of software instruction threads. Moreover, the program instructions can be executable by a processor to cause the processor to detect a defect in the execution of the test template by the circuit and modify the circuit to prevent the defect during execution of the test template.
-
FIG. 1 depicts a block diagram of an example computing system that can modify a circuit according to an embodiment described herein; -
FIG. 2 is a process flow diagram of an example method that can modify a circuit according to an embodiment described herein; -
FIG. 3 is an example illustration of a modified translation path; -
FIG. 4 is an example illustration of a modified translation path; and -
FIG. 5 is a tangible, non-transitory computer-readable medium that can modify a circuit according to an embodiment described herein. - Various techniques can be used to test and modify circuits and circuit designs. For example, the testing process can include stimulating a circuit design, detecting erroneous behavior, detecting a root cause of erroneous behavior, and determining a modification to the circuit or circuit design that prevents the erroneous behavior from occurring. In some examples, techniques include generating applications that can modify or translate a memory path used to access data. The modification to the memory path can be generated offline in some examples.
- The techniques described herein identify defects in circuits and circuit designs by generating modifications to translation paths that the circuits use to access data. A translation path, as referred to herein, includes any number of mappings from any number of tables to retrieve data stored at a physical memory address. For example, data stored in some physical memory addresses can be retrieved through various memory tables that map a first virtual memory address to a second memory address. In some embodiments, the techniques described herein can enable the modification of a table so that a virtual memory address points to an alternate table or alternate physical memory address. The techniques described herein can also enable a modification of properties of the translation path. For example, the tables in the translation path may include any number of pages of virtual memory addresses and the tables may map virtual addresses according to caching properties. In some examples, these properties of the translation paths can be modified. The modifications to the translation paths can identify defects or unexpected behavior in the execution of instructions by a circuit being tested. In some examples, the modifications to the translation paths can be generated offline prior to executing a test on a circuit. In some embodiments, the techniques described herein can reduce the amount of time to test a circuit and result in a circuit or circuit design that is free from defects.
- With reference now to
FIG. 1 , an example computing device is depicted that can modify a circuit. Thecomputing device 100 may be for example, a server, desktop computer, laptop computer, tablet computer, or smartphone. In some examples,computing device 100 may be a cloud computing node.Computing device 100 may be described in the general context of computer system executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types.Computing device 100 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices. - The
computing device 100 may include aprocessor 102 that is adapted to execute stored instructions, amemory device 104 to provide temporary memory space for operations of said instructions during operation. The processor can be a single-core processor, multi-core processor, computing cluster, or any number of other configurations. Thememory 104 can include random access memory (RAM), read only memory, flash memory, or any other suitable memory systems. - The
processor 102 may be connected through a system interconnect 106 (e.g., PCI®, PCI-Express®, etc.) to an input/output (I/O)device interface 108 adapted to connect thecomputing device 100 to one or more I/O devices 110. The I/O devices 110 may include, for example, a keyboard and a pointing device, wherein the pointing device may include a touchpad or a touchscreen, among others. The I/O devices 110 may be built-in components of thecomputing device 100, or may be devices that are externally connected to thecomputing device 100. - The
processor 102 may also be linked through the system interconnect 106 to adisplay interface 112 adapted to connect thecomputing device 100 to adisplay device 114. Thedisplay device 114 may include a display screen that is a built-in component of thecomputing device 100. Thedisplay device 114 may also include a computer monitor, television, or projector, among others, that is externally connected to thecomputing device 100. In addition, a network interface controller (NIC) 116 may be adapted to connect thecomputing device 100 through the system interconnect 106 to thenetwork 118. In some embodiments, the NIC 116 can transmit data using any suitable interface or protocol, such as the internet small computer system interface, among others. Thenetwork 118 may be a cellular network, a radio network, a wide area network (WAN), a local area network (LAN), or the Internet, among others. Anexternal computing device 120 may connect to thecomputing device 100 through thenetwork 118. In some examples,external computing device 120 may be anexternal webserver 120. In some examples,external computing device 120 may be a cloud computing node. - The
processor 102 may also be linked through the system interconnect 106 to astorage device 122 that can include a hard drive, an optical drive, a USB flash drive, an array of drives, or any combinations thereof. In some examples, the storage device may include abuilder 124, agenerator 126, and a modifier 128. Thebuilder 124,generator 126, and modifier 128 together can detect defects in circuits or circuit designs based on test templates and modify the circuits or circuit designs. In some embodiments, thebuilder 124 can generate a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address. Thebuilder 124 can also detect a predetermined modification to a translation path corresponding to a memory address mapping. Mapping, or memory address mapping, as referred to herein, includes detecting or generating pointers from one virtual memory address to a second virtual memory address or physical memory address. In some embodiments, the predetermined modification can change a first physical memory address mapped to, or associated with, a first virtual memory address to a second physical memory address. For example, a translation path may include a table with a first virtual memory address that maps or links to a physical memory address. The translation path may be modified to include an alternate table with a second virtual memory address that maps to the physical memory address. Furthermore, in some examples, the properties of the translation path can be modified. This is discussed in greater detail below in relation toFIGS. 2-4 . - In some embodiments, the
generator 126 can generate a test template comprising a first instruction to implement the predetermined modification of a translation path and a second instruction comprising an alternate or second physical memory address in the translation path. For example, the first instruction can modify a table in the translation path and the second instruction can include a request for data stored in the physical memory address referenced by the modified table. Thegenerator 126 can also transmit the test template to a circuit for each of a plurality of software instruction threads. For example, any number of software instruction threads can modify translation paths in order to search for and identify defects in a circuit. - In some embodiments, the modifier 128 can detect a defect in the execution of the test template by the circuit. For example, the modifier 128 can detect that the modified translation path does not return the correct or expected data from a physical memory address. In some embodiments, the modifier 128 can modify the circuit to prevent the defect during execution of the test template. For example, the modifier 128 can modify a circuit or circuit design so that a modified translation path accesses data from the correct physical memory address. This is discussed in greater detail below in relation to
FIG. 2 . - It is to be understood that the block diagram of
FIG. 1 is not intended to indicate that thecomputing device 100 is to include all of the components shown inFIG. 1 . Rather, thecomputing device 100 can include fewer or additional components not illustrated inFIG. 1 (e.g., additional memory components, embedded controllers, modules, additional network interfaces, etc.). Furthermore, any of the functionalities of thebuilder 124,generator 126, and modifier 128 may be partially, or entirely, implemented in hardware and/or in theprocessor 102. For example, the functionality may be implemented with an application specific integrated circuit, logic implemented in an embedded controller, or in logic implemented in theprocessor 102, among others. In some embodiments, the functionalities of thebuilder 124,generator 126, and modifier 128, can be implemented with logic, wherein the logic, as referred to herein, can include any suitable hardware (e.g., a processor, among others), software (e.g., an application, among others), firmware, or any suitable combination of hardware, software, and firmware. -
FIG. 2 is a process flow diagram of an example method that can modify a circuit. Themethod 200 can be implemented with any suitable computing device, such as thecomputing device 100 ofFIG. 1 . - At
block 202, abuilder 124 can generate a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address. For example, thebuilder 124 can generate a first virtual memory address that maps to a first physical memory address through any suitable number of tables. In some embodiments, thebuilder 124 can also generate a second virtual memory address that maps to a second physical memory address through a separate set of tables. This is described in greater detail below in relation toFIG. 4 . - At
block 204, abuilder 124 can detect a predetermined modification to a translation path corresponding to a memory address mapping. A translation path, as discussed above, can include any number of mappings from any number of tables to retrieve data stored at a physical memory address. In some embodiments, the translation path can also include a mapping from a range of virtual memory addresses to a range of physical memory addresses. In some examples, the translation path includes a number of tables that can map a virtual memory address to a physical memory address. - The predetermined modification can change a first virtual memory address associated with a first physical memory address to a second physical memory address. In some examples, a range of virtual memory addresses can be modified to map to an alternate or new range of physical memory addresses. The range of virtual memory addresses linked to a range of physical memory addresses can correspond to a mapping stored in a translation look aside buffer. In some examples, the predetermined modification can also include changes to the properties of the translation path. For example, the properties of the translation path, such as the size of tables that store virtual memory addresses, can be modified. In some embodiments, modifying properties of the translation path can include modifying a page size or a caching property, or any other suitable characteristic of a translation path.
- At
block 206, thegenerator 126 can generate a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the physical memory address in the translation path. In some embodiments, the first instruction is executed prior to the second instruction. The first instruction can modify the translation paths used by a system to access data stored at one or more physical memory addresses. The modification can be implemented in accordance with the various techniques outlined above in relation to block 204. - In some embodiments, the second instruction generated by the
generator 126 can include any suitable operation that requests data from a physical memory address corresponding to the modified translation path. For example, the second instruction can include a read or write instruction, among others, that requests data stored in the physical memory address corresponding to the modified translation path. In some examples, the physical memory address corresponding to the modified translation path can be accessed via a different table in the modified translation path, accessed via a different virtual memory address via the modified translation path, or the physical memory address may correspond to an alternate physical memory address. The alternate physical memory address may be a new physical memory address that is mapped or linked to an existing virtual memory address. In some examples, thegenerator 126 can randomly generate any number of instructions for the test template and detect a location in the test template to insert the first instruction and the second instruction. For example, thegenerator 126 can detect a predetermined location to insert the first instruction and the second instruction in the test template. In some examples, the predetermined location to insert the first instruction and the second instruction can be included in a statement within the test template. - At
block 208, thegenerator 126 can transmit the test template to a circuit for each of a plurality of software instruction threads. In some embodiments, transmitting the test template to a circuit is simulated by an application that transmits the test template to a verification or simulation program for a circuit model. The test template, as referred to herein, can include any suitable number of modifications to translation paths corresponding to any number of physical memory addresses. The test template can also include any number of instructions that can be executed following the modifications to the translation paths, wherein the instructions verify that the modified translation paths retrieve the expected values. In some embodiments, the instruction of the test template that modified a translation path can be an atomic instruction that includes a semaphore or lock. The semaphore or lock can prevent other threads from accessing a translation path as the translation path is modified. In some embodiments, each thread executing the test template can, during a locked phase, invalidate translation entries in existing tables in translation paths in memory and cache devices, select new modified translation paths, and update tables in existing translation paths based on the modifications. For example, the tables can be updated by copying data to map or link tables in the modified translation paths. In some embodiments, any number of tables associated with a first virtual memory address can be copied to tables associated with a second virtual memory address. Thus, the data used to translate a virtual memory address to a physical address can be copied. - At
block 210, the modifier 128 can detect a defect in the execution of the test template by the circuit. For example, the modifier 128 can detect that a circuit or circuit design returns an incorrect or unexpected value in response to executing an instruction that references a modified translation path. In some embodiments, the defect can include returning a value that differs from the value stored in a physical memory address linked to the modified translation path. - At
block 212, the modifier 128 can modify the circuit to prevent the defect during execution of the test template. For example, the modifier 128 can modify the design of a circuit so that the circuit accesses the correct physical memory address based on the modified translation path. - The process flow diagram of
FIG. 2 is not intended to indicate that the operations of themethod 200 are to be executed in any particular order, or that all of the operations of themethod 200 are to be included in every case. Additionally, themethod 200 can include any suitable number of additional operations. For example, the modifier 128 can store data related to a circuit test in a database. In some examples, any number of instructions that modify translation paths, instructions that are executed to detect defects in a circuit, translation paths, modified virtual memory addresses, and physical memory addresses linked to modified virtual memory addresses, among others, can be stored in a database. Furthermore, in some examples, the predetermined modification can be based on constraints associated with a translation path. For example, the constraints may include a maximum number of virtual memory addresses that can be stored in a table in a translation path, and the like. Moreover, the modified translation path can include a table that is modified to link to an alternate or new physical memory address. -
FIG. 3 is an example illustration of a modified translation path. The modified translation path can be generated with any suitable computing device such ascomputing device 100 ofFIG. 1 . - In some embodiments, a
translation path 300 can include a link from a first set of virtual memory addresses 302 in a first table 304 (also referred to herein as EA-T0) to a set of physical memory addresses 306 (also referred to herein as main reservation) in a second table 308 (also referred to herein as RA). The set of physical memory addresses 306 can also be linked or mapped to a second set of virtual memory addresses 310 in a third table 312 (also referred to herein as EA-T1). In some embodiments, thetranslation path 300 can be modified so that the first set of virtual memory addresses 302 in the first table 304 are linked or mapped to an alternate set of memory addresses 314 (also referred to herein as a shadow reservation). In some embodiments, the alternate set of memory addresses in the second table 308 can map to the same virtual memory addresses 310 in the third table 312 as the set of physical memory addresses 306 in the second table 308. - It is to be understood that the modification of a translation path in
FIG. 3 is only an example. The translation paths can be modified in any suitable number of ways. -
FIG. 4 is an example illustration of a modified translation path. The modified translation path can be generated with any suitable computing device such ascomputing device 100 ofFIG. 1 . - In some embodiments, the
translation path 400 can include a virtual memory address 402 (also referred to herein as an effective address) that can map or link to any number of tables such as table 1 404, table 2 406, throughtable N 408. In some examples, any suitable number of tables can link to each other between table 2 406 andtable N 408.Table N 408 can link to one or more physical memory addresses (also referred to herein as a real address) 410. In some embodiments, thetranslation path 400 can be modified so that thevirtual memory address 402 is no longer linked to data stored in the real orphysical address 410. For example, table 1 404 can be linked to table 2′ 412 rather than table 2 406. Table 2′ can be linked through any suitable number of tables to table N′ 414, which can be linked or mapped to an auxiliary or alternatereal address 416. The alternatereal address 416 can be any suitable physical memory address that can store data. The modifiedtranslation path 400 can then return data values stored in the auxiliaryreal address 416 when instructions including theeffective address 402 are executed. In some embodiments, an auxiliaryeffective address 418 can also link or map to the data stored in the auxiliaryreal address 416 through table 1′ 420, table 2′ 412, and table N′ 414. - The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
- The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
- Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
- Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
- Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
- These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
- The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
- The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
- Referring now to
FIG. 5 , a block diagram is depicted of an example of a tangible, non-transitory computer-readable medium that can modify a circuit. The tangible, non-transitory, computer-readable medium 500 may be accessed by aprocessor 502 over acomputer interconnect 504. Furthermore, the tangible, non-transitory, computer-readable medium 500 may include code to direct theprocessor 502 to perform the operations of the current method. - The various software components discussed herein may be stored on the tangible, non-transitory, computer-
readable medium 500, as indicated inFIG. 5 . For example, abuilder 506 can generate a set of testing data, wherein the set of testing data comprises at least a first virtual memory address corresponding to a first set of tables and a first physical memory address, and a second virtual memory address corresponding to a second set of tables and a second physical memory address. Thebuilder 506 can also detect a predetermined modification to a translation path corresponding to a memory address mapping, wherein the predetermined modification can change a first physical memory address associated with a first physical memory address to a second physical memory address. Additionally, agenerator 508 can generate a test template comprising a first instruction to implement the predetermined modification and a second instruction comprising the second physical memory address in the translation path. Thegenerator 508 can also transmit the test template to the circuit for each of a plurality of software instruction threads. In some embodiments, amodifier 510 can detect a defect in the execution of the test template by the circuit and modify the circuit to prevent the defect during execution of the test template. - It is to be understood that any number of additional software components not shown in
FIG. 5 may be included within the tangible, non-transitory, computer-readable medium 500, depending on the specific application. - The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Claims (20)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/936,690 US9633155B1 (en) | 2015-11-10 | 2015-11-10 | Circuit modification |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/936,690 US9633155B1 (en) | 2015-11-10 | 2015-11-10 | Circuit modification |
Publications (2)
Publication Number | Publication Date |
---|---|
US9633155B1 US9633155B1 (en) | 2017-04-25 |
US20170132346A1 true US20170132346A1 (en) | 2017-05-11 |
Family
ID=58547142
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/936,690 Active US9633155B1 (en) | 2015-11-10 | 2015-11-10 | Circuit modification |
Country Status (1)
Country | Link |
---|---|
US (1) | US9633155B1 (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN117112575B (en) * | 2023-10-20 | 2024-02-13 | 杭州行芯科技有限公司 | Name management method, system and query method for circuit elements |
Family Cites Families (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4228496A (en) * | 1976-09-07 | 1980-10-14 | Tandem Computers Incorporated | Multiprocessor system |
JPH0619913B2 (en) * | 1984-03-30 | 1994-03-16 | パイオニア株式会社 | Error correction method for data carried in video format signal |
US4899275A (en) * | 1985-02-22 | 1990-02-06 | Intergraph Corporation | Cache-MMU system |
US5893152A (en) * | 1996-03-08 | 1999-04-06 | Sun Microsystems, Inc. | Method and apparatus that detects and tolerates inconsistencies between the cache and main memory, and the translation lookaside buffer and the virtual memory page table in main memory |
US6108797A (en) * | 1997-12-11 | 2000-08-22 | Winbond Electronics Corp. | Method and system for loading microprograms in partially defective memory |
US8127121B2 (en) * | 1999-01-28 | 2012-02-28 | Ati Technologies Ulc | Apparatus for executing programs for a first computer architechture on a computer of a second architechture |
US7251744B1 (en) * | 2004-01-21 | 2007-07-31 | Advanced Micro Devices Inc. | Memory check architecture and method for a multiprocessor computer system |
US7484062B2 (en) * | 2005-12-22 | 2009-01-27 | International Business Machines Corporation | Cache injection semi-synchronous memory copy operation |
US20080209160A1 (en) | 2007-02-27 | 2008-08-28 | Yoav Avraham Katz | Device, System and Method of Verification of Address Translation Mechanisms |
US7992059B2 (en) | 2007-09-11 | 2011-08-02 | International Business Machines Corporation | System and method for testing a large memory area during processor design verification and validation |
GB2455106B (en) * | 2007-11-28 | 2012-08-01 | Icera Inc | Memory errors |
US8370705B1 (en) * | 2009-09-23 | 2013-02-05 | Nvidia Corporation | System and method for calculating a checksum address while maintaining error correction information |
US9081501B2 (en) * | 2010-01-08 | 2015-07-14 | International Business Machines Corporation | Multi-petascale highly efficient parallel supercomputer |
JP5221699B2 (en) * | 2011-03-23 | 2013-06-26 | 株式会社東芝 | Semiconductor memory device |
US8892386B2 (en) | 2011-07-10 | 2014-11-18 | International Business Machines Corporation | Method and apparatus for post-silicon testing |
US8959577B2 (en) * | 2012-04-13 | 2015-02-17 | Cisco Technology, Inc. | Automatic curation and modification of virtualized computer programs |
US9811472B2 (en) | 2012-06-14 | 2017-11-07 | International Business Machines Corporation | Radix table translation of memory |
US9384088B1 (en) * | 2014-02-24 | 2016-07-05 | Western Digital Technologies, Inc. | Double writing map table entries in a data storage system to guard against silent corruption |
US9569115B2 (en) * | 2014-03-31 | 2017-02-14 | International Business Machines Corporation | Transparent code patching |
US9329850B2 (en) * | 2014-06-24 | 2016-05-03 | International Business Machines Corporation | Relocation of instructions that use relative addressing |
-
2015
- 2015-11-10 US US14/936,690 patent/US9633155B1/en active Active
Also Published As
Publication number | Publication date |
---|---|
US9633155B1 (en) | 2017-04-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10261917B2 (en) | Identifying stale entries in address translation cache | |
US9934129B1 (en) | Determining application test results using screenshot metadata | |
US9990458B2 (en) | Generic design rule checking (DRC) test case extraction | |
US20170147507A1 (en) | Direct memory access of dynamically allocated memory | |
US10241926B2 (en) | Migrating buffer for direct memory access in a computer system | |
US9501327B2 (en) | Concurrently processing parts of cells of a data structure with multiple processes | |
US11061821B2 (en) | Method, system, and apparatus for stress testing memory translation tables | |
US10558510B2 (en) | Testing a data coherency algorithm | |
US9330037B2 (en) | Dynamically resizing direct memory access (DMA) windows | |
US10007568B2 (en) | Testing a non-core MMU | |
US9633155B1 (en) | Circuit modification | |
US9798850B2 (en) | System and method for combined path tracing in static timing analysis | |
US9946589B2 (en) | Structure for reducing power consumption for memory device | |
US10360137B2 (en) | Adaptive testing using dynamically determined system resources of a computer system | |
US10748637B2 (en) | System and method for testing processor errors | |
US10324815B2 (en) | Error checking of a multi-threaded computer processor design under test | |
US9857979B2 (en) | Optimizing page boundary crossing in system memory using a reference bit and a change bit | |
JP2019537090A (en) | Testing hybrid instruction architecture |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:IBRAHEEM, WESAM;KOLAN, TOM;KOYFMAN, ANATOLY;AND OTHERS;SIGNING DATES FROM 20151102 TO 20151107;REEL/FRAME:036997/0526 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 4 |
|
AS | Assignment |
Owner name: SYNOPSYS, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:064663/0509 Effective date: 20230629 |