| Patent application number | Description | Published |
|---|
| 20080258915 | Managing Of Items Distributed In A Global Supply Chain - A method for determining locations in a predefined area for placing a Radio Frequency Identification (RFID) reader in order to obtain a full coverage of the predefined area is provided. The method includes arranging a plurality of hexagonal area to form a combined area until the total area of the combined area is equal or larger than the predefined area, aligning the predefined area within the combined area, and determining the hexagonal area which is fully or partially covered by the predefined area. Each hexagonal area represents an area of coverage of the RFID reader, and the center of the hexagonal area which is determined to be fully or partially covered by the predefined area corresponds to one of the locations for placing the RFID reader. | 10-23-2008 |
| 20090276765 | COMPILER DRIVEN MECHANISM FOR REGISTRATION AND DEREGISTRATION OF MEMORY PAGES - A method, system and article of manufacture are disclosed for registering and deregistering memory pages in a computer system. The method comprises the steps of hoisting register and deregister calls in a given routine where temporal locality is present to overlap computation and communication; using software pipelined registration and deregistration where spatial locality is observed; and using intra-procedural and inter-procedural analysis by a compiler of the computer system to deregister dynamically allocated buffers. The preferred embodiment of the invention is based on an optimizing compiler. The compiler is used to extract information such as addresses of buffers which are being reused repeatedly (temporal locality), preferably in a loop. The compiler may also find information about spatial locality, such as arrays whose indexes are used in a well-defined manner in a series of messages, for example, array pages being accessed in a pre-defined pattern in a loop. | 11-05-2009 |
| 20090295165 | METHOD FOR WIND TURBINE PLACEMENT IN A WIND POWER PLANT - A method for determining wind turbine location within a wind power plant based on at least one design criteria. A wind turbine layout including at least one wind turbine location is prepared and site conditions at each wind turbine location are determined. One or more plant design metrics are evaluated in response to the site conditions. The plant design metrics are analyzed in response to the site conditions. The method further includes applying constraints to the wind turbine layout and comparing the plant design metrics to the design criteria and constraints. Thereafter, the wind turbine locations are selectively adjusted within the layout in response to the comparing step until a stop criteria is reached. | 12-03-2009 |
| 20110055843 | Scheduling Jobs For Execution On A Computer System - A technique includes determining an order for projects to be performed on a computer system. Each project is associated with multiple job sets, such that any of the job sets may be executed on the computer system to perform the project. The technique includes selecting the projects in a sequence according to the determined order to progressively build a schedule of jobs for execution on the computer system. For each selected project, incorporating one of the associated job sets into the schedule based on a cost of each of the associated job sets. | 03-03-2011 |
| 20110223018 | Control System, Wind Farm, And Methods Of Optimizing The Operation Of A Wind Turbine - A control system for a wind turbine configured to generate an acoustic emission during operation includes a communication device. The communication device is configured to receive at least one penalty notification identifying a penalty to be assessed based on the acoustic emission generated. The control system also includes a processor coupled to the communication device. The processor is configured to calculate an acoustic emission level to be generated by the wind turbine based on the penalty and based on at least one of a power generated by the wind turbine and an economic value attributed to the wind turbine, and adjust at least one characteristic of the wind turbine to cause the wind turbine to operate at the calculated acoustic emission level. | 09-15-2011 |
| Patent application number | Description | Published |
|---|
| 20080271004 | COMPUTER-IMPLEMENTED METHOD, SYSTEM, AND PROGRAM PRODUCT FOR OPTIMIZING A DISTRIBUTED APPLICATION - A computer-implemented method, system, and program product for optimizing a distributed (software) application are provided. Specifically, a configuration of a target computing environment, in which the distributed application is deployed, is discovered upon deployment of the distributed application. Thereafter, based on a set of rules and the discovered configuration, one or more optimization techniques are applied to optimize the distributed application. In a typical embodiment, the set of rules can be embedded in the distributed application, or they can be accessed from an external source such as a repository. Regardless, the optimization techniques applied can include at least one of the following: (1) identification and replacement of an underperforming component of the distributed application with a new component; (2) generation of interface layers (to allow selection of optimal bindings) between distributed objects of the distributed application; and/or (3) execution of code transformation of the distributed application using program analysis techniques. | 10-30-2008 |
| 20090070628 | HYBRID EVENT PREDICTION AND SYSTEM CONTROL - A system for predicting an occurrence of a critical even in a computer cluster includes: a control system that includes an event log, a system parameter log, a memory for storing information related to occurrences of critical events, and a processor. The processor implements a hybrid prediction system; loads the information from the event log and the system performance log into a Bayesian network model; uses the Bayesian network model to predict a future critical event; makes future scheduling and current data migration selections; and adapts the Bayesian network model by feeding the scheduling and data migration selections. | 03-12-2009 |
| 20090260018 | METHOD FOR COMPUTATION-COMMUNICATI0N OVERLAP IN MPI APPLICATIONS - A computer implemented method is provided for optimizing at the time of compiling a program that employs a message-passing interface (MPI). The method includes: detecting an MPI application source file; identifying a non-blocking communication within the MPI application source file; and overlapping independent computation concurrently with the non-blocking communication. A system is also provided. | 10-15-2009 |
| 20100017804 | Thread-to-Processor Assignment Based on Affinity Identifiers - For each thread of a computer program to be executed on a multiple-processor computer system, an affinity identifier is associated to the thread by the computer program. The affinity identifiers of the threads denote how closely related the threads are. For each thread, a processor of the multiple-processor computer system on which the thread is to be executed is selected based on the affinity identifiers of the threads, by an operating system being executed on the multiple-processor computer system and in relation to which the computer programs are to be executed. Each thread is then executed by the processor selected for the thread. | 01-21-2010 |
| 20100037214 | METHOD AND SYSTEM FOR MPI_WAIT SINKING FOR BETTER COMPUTATION-COMMUNICATION OVERLAP IN MPI APPLICATIONS - A computer implemented method is provided for optimizing at the time of compiling a program that employs a message-passing interface (MPI). The method includes: detecting an MPI application source file; identifying a non-blocking communication within the MPI application source file; and overlapping independent computation concurrently with the non-blocking communication. A system is also provided. | 02-11-2010 |
| 20100125835 | HIGH EFFICIENCY COMPILATION FRAMEWORK - A method and system for reducing processing overhead during execution of a code block in a high efficiency compilation framework. The method identifies second code blocks within the code block and separates them out from the first code block during compilation. Further, during compilation, the system converts the second code blocks to kernel program modules, in a form recognizable by the system kernel. The compilation is followed by execution of the first code block, with the compiled object code of the first code block being executed in user mode and the kernel program modules being executed in kernel mode. | 05-20-2010 |
| 20110041131 | MIGRATING TASKS ACROSS PROCESSORS - The present disclosure is directed to a method for managing tasks in a computer system having a plurality of CPUs. Each task in the computer system may be configured to indicate a migration ready indicator of the task. The migration ready indicator for a task may be given when the set of live data for that task reduces or its working set of memory changes. The method may comprise associating a migration readiness queue with each of the plurality of CPUs, the migration readiness queue having a front-end and a back-end; analyzing a task currently executing on a particular CPU, wherein the particular CPU is one of the plurality of CPUs; placing the task in the migration readiness queue of the particular CPU based on status of the task and/or the migration ready indicator of the task; and selecting at least one queued task from the front-end of the migration readiness queue of the particular CPU for migration when the particular CPU receives a task migration command. | 02-17-2011 |
