| Patent application number | Description | Published |
|---|
| 20090327784 | ENERGY MEASUREMENT TECHNIQUES FOR COMPUTING SYSTEMS - An energy measurement system (“EMS”) and techniques for correlating energy consumption to computing system activity. The EMS includes a data acquisition module, a processing module, and optionally a visualization module. The data acquisition module receives and transmits to the processing unit a number of sampled data streams, referred to as “data acquisition traces,” associated with a computing system under test (“SUT”). The processing module concurrently receives one or more system traces from the SUT, which are produced by particular components under examination by the EMS. Synchronization is established between the data acquisition traces and the system trace(s) when the SUT executes certain predetermined actions to produce data in both the data acquisition traces and the system trace(s), which data is used to logically align the traces. Then, as test scenarios are executed by the SUT, changes are monitored in the traces, and energy consumption is quantified. | 12-31-2009 |
| 20100146245 | PARALLEL EXECUTION OF A LOOP - A method of executing a loop over an integer index range of indices in a parallel manner includes assigning a plurality of index subsets of the integer index range to a corresponding plurality of threads, and defining for each index subset a start point of the index subset, an end point of the index subset, and a boundary point of the index subset positioned between the start point and the end point of the index subset. A portion of the index subset between the start point and the boundary point represents a private range and the portion of the index subset between the boundary point and the end point represents a public range. Loop code is executed by each thread based on the index subset of the integer index range assigned to the thread. | 06-10-2010 |
| 20100185840 | PROPAGATING UNOBSERVED EXCEPTIONS IN A PARALLEL SYSTEM - A method of handling an exception in a parallel system includes constructing a task object, executing a method with the task object, and catching an exception with the task object during execution of the method. The exception is propagated in response to the task object becoming inaccessible without the exception having been observed. | 07-22-2010 |
| 20100295856 | DATA ANALYSIS AND VISUALIZATION SYSTEM AND TECHNIQUES - A data visualization and analysis system (“DVAS”) is described, which provides techniques and data models for modeling, storing, retrieving, analyzing, and visually representing large data sets in a rapid, lightweight, flexible, and highly interactive fashion. A data model and various techniques are described with reference to trace data sets, which are files or other data storage constructs used to record information regarding certain defined events occurring during operation of a computing system or a portion thereof. The DVAS receives and parses one or more trace data sets to create a data model that includes a number of layers and other inner or auxiliary data structures. Based on the data model, the DVAS visually renders one or more sets of geometric objects in accordance with different drawing modes. The drawing modes, which are dynamic and interactive, enable users to effectively visually identify patterns within the trace data sets. | 11-25-2010 |
| 20110078691 | STRUCTURED TASK HIERARCHY FOR A PARALLEL RUNTIME - The present invention extends to methods, systems, and computer program products for a structured task hierarchy for a parallel runtime. The parallel execution runtime environment permits flexible spawning and attachment of tasks to one another to form a task hierarchy. Parent tasks can be prevented from completing until any attached child sub-tasks complete. Exceptions can be aggregated in an exception array such that any aggregated exceptions for a task are available when the task completes. A shield mode is provided to prevent tasks from attaching to another task as child tasks. | 03-31-2011 |
| 20110239217 | PERFORMING A WAIT OPERATION TO WAIT FOR ONE OR MORE TASKS TO COMPLETE - A method of performing a wait operation includes creating a first plurality of tasks and a continuation task. The continuation task represents a second plurality of tasks. The continuation task and each of the tasks in the first plurality have an associated wait handle. The wait handles for the first plurality of tasks and the continuation task are stored in an array. A wait operation is performed on the array, thereby waiting for at least one of the tasks in the first and second pluralities to complete. | 09-29-2011 |
| 20110289503 | EXTENSIBLE TASK SCHEDULER - A parallel execution runtime allows tasks to be executed concurrently in a runtime environment. The parallel execution runtime delegates the implementation of task queuing, dispatch, and thread management to one or more plug-in schedulers in a runtime environment of a computer system. The plug-in schedulers may be provided by user code or other suitable sources and include interfaces that operate in conjunction with the runtime. The runtime tracks the schedulers and maintains control of all aspects of the execution of tasks from user code including task initialization, task status, task waiting, task cancellation, task continuations, and task exception handling. | 11-24-2011 |
| 20110307905 | INDICATING PARALLEL OPERATIONS WITH USER-VISIBLE EVENTS - The present invention extends to methods, systems, and computer program products for indicating parallel operations with user-visible events. Event markers can be used to indicate an abstracted outer layer of execution as well as expose internal specifics of parallel processing systems, including systems that provide data parallelism. Event markers can be used to show a variety of execution characteristics including higher-level markers to indicate the beginning and end of an execution program (e.g., a query). Inside the execution program (query) individual fork/join operations can be indicated with sub-levels of markers to expose their operations. Additional decisions made by an execution engine, such as, for example, when elements initially yield, when queries overlap or nest, when the query is cancelled, when the query bails to sequential operation, when premature merging or re-partitioning are needed can also be exposed. | 12-15-2011 |
