Patent application number | Description | Published |
20130076275 | ELECTROSTATIC PARALLEL PLATE ACTUATORS WHOSE MOVING ELEMENTS ARE DRIVEN ONLY BY ELECTROSTATIC FORCE AND METHODS USEFUL IN CONJUNCTION THEREWITH - An actuator apparatus is provided that includes at least one actuator device, each actuator device including an array of moving elements, each individual moving element is operative to be constrained to travel alternately back and forth along a respective axis responsive to an individual first electrostatic force operative thereupon, wherein each moving element has an at-rest position and is driven away from its at rest position solely by the first electrostatic force; and at least one electrode operative to apply a controlled temporal sequence of potential differences with at least one individual moving element from among the array of moving elements thereby to selectably generate the first electrostatic force; and a controller operative to receive the digital input signal and to control at least one of the at least one electrode and the individual moving element to apply the sequence of potential differences. | 03-28-2013 |
20150142173 | SYSTEM, A METHOD AND A COMPUTER PROGRAM PRODUCT FOR CONTROLLING A GROUP OF ACTUATOR ARRAYS FOR PRODUCING A PHYSICAL EFFECT - A system which controls a group of multiple arrays of actuator elements, each of the actuator elements including a moving element which moves between a first and a second extreme positions; the system including: a controller, configured to generate control commands for at least one array of the multiple arrays in each individual cycle out of a series of sampling cycles, based on obtained information; and (b) an interface configured to transfer the control commands to the at least one array, thereby resulting in releasing from the first extreme position during the intended cycle of at least one moving element that is included in the at least one array; wherein release of all moving elements of at least one restrained array out of the multiple arrays is prevented during the intended cycle. | 05-21-2015 |
20150241863 | SYSTEM, A METHOD AND A COMPUTER PROGRAM PRODUCT FOR CONTROLLING A SET OF ACTUATOR ELEMENTS - A system which controls an apparatus which comprises a set of actuator elements, each comprising a moving element which moves between first and second extreme positions, wherein each actuator element of the set is comprised in: (a) exactly one first subset out of a plurality of non-empty first subsets (R-subsets) of the set of actuator elements; and (b) exactly one second subset out of a plurality of non-empty second subsets (C-subsets) of the set of actuator elements. | 08-27-2015 |
20150350800 | SYSTEM AND METHOD FOR TESTING - The present disclosure provides a method for testing an apparatus which comprises a set of operational subunits each comprising a moving element, wherein the moving elements move between respective first and second extreme positions, the method comprising: transferring to the apparatus stabilization control commands; transferring to the apparatus first latching-commands for latching to the first extreme position a candidate moving element which is a moving element of a candidate operational subunit; when the first latching control commands are in effect, measuring a first output frequency of an oscillator whose output is coupled to the candidate operational subunit in an electrical coupling setup which causes the output frequency of the oscillator to depend on positions of a plurality of moving elements which comprises the candidate moving element; and based on the first output frequency determining a state of the candidate operational subunit. | 12-03-2015 |
Patent application number | Description | Published |
20090055813 | Method for Enabling Profile-Based Call Site Tailor-ing Using Profile Gathering of Cloned Functions - Methods and systems for computer program optimization utilize function cloning in program code, such as post-linked code. Each function call is directed to a different cloned version of the called function. Conventional profiling methods such as hardware event sampling, basic block profiling, and edge profiling may then be applied to the modified program code to obtain call path-based, clone-specific profile data. The profile data can be further exploited to optimize the program code. | 02-26-2009 |
20090064117 | Device, System, and Method of Computer Program Optimization - Device, system, and method of computer program optimization. For example, an apparatus to analyze a plurality of versions of computer program includes: a code analyzer to determine one or more code differences between first and second versions of the computer program, based on at least one optimization log associated with at least one of the first and second versions of the computer program. | 03-05-2009 |
20090193402 | Iterative Compilation Supporting Entity Instance-Specific Compiler Option Variations - Optimizing a computer program by setting a first compiler optimization configuration for a first entity of a computer program, setting a second compiler optimization configuration for a second entity of the computer program, where the first and second entities are of the same type and where the first and second compiler optimization configurations differ, and compiling the computer program in accordance with the compiler optimization configurations, thereby creating a compiled program. | 07-30-2009 |
20100299661 | Load-Time Code Optimization In a Computing Environment - A method for optimizing program code is provided. The method comprises receiving a request to execute a computer program on a computer system; loading executable code generated for the computer program into memory; optimizing the executable code during the loading; and executing the optimized executable code. The executable code is optimized according to information collected about the computer system, and the optimized executable code and the collected information are stored for use during future optimization of the executable code. | 11-25-2010 |
20120232880 | PERFORMANCE ASSESSMENT OF A PROGRAM MODEL - An apparatus and a computer-implemented method performed by a computerized device comprising: receiving a model describing an aspect of a computer program; and determining comparative performance assessment of a property of the model by operating the model. | 09-13-2012 |
20130031537 | Specialized Function Implementation Using Code Frequency Profiling - Systems, methods and products for code optimization are provided. In one embodiment, the method comprises dividing a target code into basic blocks; analyzing traversed execution paths between the basic blocks during multiple executions of the target code to determine a frequency with which the execution path between two or more basic blocks are traversed; and determining whether code optimization may be achieved by identifying execution paths that have been traversed subject to one or more threshold levels. | 01-31-2013 |
20130054494 | EFFICIENT DATA PROFILING TO OPTIMIZE SYSTEM PERFORMANCE - Systems and methods for data profiling are provided. In one embodiment, the method comprises monitoring value of at least a target parameter during execution of logic code in a computing environment, wherein the value of the target parameter is incrementally updated in a sequence of data points; and using statistical analysis to determine a target value for the target parameter as of a current data point, in response to determining a change in the value of the target parameter at each data point. | 02-28-2013 |
Patent application number | Description | Published |
20130268742 | CORE SWITCHING ACCELERATION IN ASYMMETRIC MULTIPROCESSOR SYSTEM - An asymmetric multiprocessor system (ASMP) may comprise computational cores implementing different instruction set architectures and having different power requirements. Program code executing on the ASMP is analyzed by a binary analysis unit to determine what functions are called by the program code and select which of the cores are to execute the program code, or a code segment thereof. Selection may be made to provide for native execution of the program code, to minimize power consumption, and so forth. Control operations based on this selection may then be inserted into the program code, forming instrumented program code. The instrumented program code is then executed by the ASMP. | 10-10-2013 |
20140019723 | BINARY TRANSLATION IN ASYMMETRIC MULTIPROCESSOR SYSTEM - An asymmetric multiprocessor system (ASMP) may comprise computational cores implementing different instruction set architectures and having different power requirements. Program code for execution on the ASMP is analyzed and a determination is made as to whether to allow the program code, or a code segment thereof to execute on a first core natively or to use binary translation on the code and execute the translated code on a second core which consumes less power than the first core during execution. | 01-16-2014 |
20140095832 | METHOD AND APPARATUS FOR PERFORMANCE EFFICIENT ISA VIRTUALIZATION USING DYNAMIC PARTIAL BINARY TRANSLATION - Methods, apparatus and systems for virtualization of a native instruction set are disclosed. Embodiments include a processor core executing the native instructions and a second core, or alternatively only the second processor core consuming less power while executing a second instruction set that excludes portions of the native instruction set. The second core's decoder detects invalid opcodes of the second instruction set. A microcode layer disassembler determines if opcodes should be translated. A translation runtime environment identifies an executable region containing an invalid opcode, other invalid opcodes and interjacent valid opcodes of the second instruction set. An analysis unit determines an initial machine state prior to execution of the invalid opcode. A partial translation of the executable region that includes encapsulations of the translations of invalid opcodes and state recoveries of the machine states is generated and saved to a translation cache memory. | 04-03-2014 |
20150370567 | METHOD AND APPARATUS FOR PERFORMANCE EFFICIENT ISA VIRTUALIZATION USING DYNAMIC PARTIAL BINARY TRANSLATION - Methods, apparatus and systems for virtualization of a native instruction set are disclosed. Embodiments include a processor core executing the native instructions and a second core, or alternatively only the second processor core consuming less power while executing a second instruction set that excludes portions of the native instruction set. The second core's decoder detects invalid opcodes of the second instruction set. A microcode layer disassembler determines if opcodes should be translated. A translation runtime environment identifies an executable region containing an invalid opcode, other invalid opcodes and interjacent valid opcodes of the second instruction set. An analysis unit determines an initial machine state prior to execution of the invalid opcode. A partial translation of the executable region that includes encapsulations of the translations of invalid opcodes and state recoveries of the machine states is generated and saved to a translation cache memory. | 12-24-2015 |
Patent application number | Description | Published |
20120179675 | DATA MANAGEMENT AND CONTROL USING DATA IMPORTANCE LEVELS - Data management and control, including obtaining an importance level associated with a data item, identifying a data entry interface as a source of the data item, associating the importance level with the data entry interface, and performing an action corresponding to the association of the importance level with the data entry interface. | 07-12-2012 |
20130191813 | Metamodeling Contextual Navigation of Computer Software Applications - Using metamodels during context-sensitive analyses of reusable components of computer software applications, including identifying entry and exit paths into and from a reusable component within a metamodel of a computer application development environment, determining during a static analysis of a computer software application that navigation will proceeds along a path corresponding in the metamodel to such an entry or exit path, retaining, if an entry path, an identifier of an invoking node along the path within the computer software application, and, if an exit path, for each terminal node along each of a plurality of paths from the reusable component within the computer software application, comparing an identifier of an invoking node preceding the terminal node with the retained invoking node identifier, and determining, if the invoking node identifiers match, that the path among the plurality of paths is a correct path for a current context of the static analysis. | 07-25-2013 |
20150150015 | ELIMINATING EXECUTION OF JOBS-BASED OPERATIONAL COSTS OF RELATED REPORTS - Optimizing operational costs in a computing environment includes identifying high-cost jobs that are executed to generate one or more reports in the computing environment, identifying one or more reports the generation of which is dependent on the execution of the high-cost jobs, and culling at least a first job from among the high-cost jobs, in response to determining that a benefit achieved from the reports that depend on the first job does not justify costs associated with generating the reports. | 05-28-2015 |