International Business Machines Corporation

Hewlett-packard Company

Ricoh Company, Ltd.

Hewlett-packard Development Company, L.p.

Other

A^3 by Airbus

Richard Andrew Golding

Peter E Hart

Stephen R Savitzky

Rithy K Roth

Tina L Jeng

Elizabeth Lynn Borowsky

Omer Ahmed Zaki

Arif Abdulhusein Merchant

John Wilkes

Mirjana Spasojevic

Claudio Fleiner

Deepak R Kenchammana-Hosekote

Theodore Ming-Tao Wong

Dushyanth Narayanan

Ram Swaminathan

Eric A Anderson

Alistair Veitch

Guillermo Alvarez

Ralph Attila Becker-Szendy

Elizabeth A Shriver

Joseph Polastre

Karthik Balakrishnan

Theodore M Wong

Scott A Brandt

Caixue Lin

Ahmed Zaki Omer

Peter Sachs

Nelly Fazio

Ryan Rodriguez

Ted Romer

Tim Sullivan

Data associated with a flight, including a flight plan, a vehicle, and/or a pilot is processed via a risk assessment platform to obtain one of more numerical risk values, for example a ground risk value and an air risk value. Based on the processed data, a matrix of risk assessment decisions is generated containing risk related information (such as risk remediation information). Accordingly, based on a consistent set of risk relation information, a predictable and repeatable flight decision (such as a decision whether to fly, or an adjustment to a flight route) can be made. In some instances, the data to be processed is quantitative data collected from one or more third party systems, such as sensor data or geospatial data. The risk assessment platform includes toolkits or services to be used in the processing and transformation of this data to reach a risk assessment decision.

Risk assessment for unmanned aerial vehicles

According to one embodiment of the present invention, a method for protecting authenticated communication in dynamic federated environments is provided. The method includes distributing shares of a private signature key to a group of users. When switching from an existing to a new group of users, the method includes producing a plurality of sub-shares from each of the distributed shares of existing users, with each sub-share being accompanied by a corresponding validity proof. The sub-shares from multiple existing users are combined to generate a set of shares for new users, with each new share being derived from sub-shares from multiple existing users.

Method for authenticated communication in dynamic federated environments

A method for implementation within a scheduler for a processor is described. The method includes receiving a plurality of jobs from an earliest deadline first (EDF) schedule, wherein the scheduler implements an EDF scheduling model. The method also includes receiving a separate job from a source other than the EDF schedule. The separate job has a fixed scheduling requirement with a specific execution time. The method also includes determining an amount of available utilization capacity of the processor and inserting the separate job into an execution plan of the processor with the plurality of jobs from the EDF schedule in response to a determination that the available utilization capacity of the processor is sufficient to execute the separate job according to the fixed scheduling requirement associated with the separate job.

Integration of dissimilar job types into an earliest deadline first (EDF) schedule

A scheduler selects an I/O from a session of a pool and updates token buckets associated with resource limits and reserves for the session and the pool and statistics used in determining fair sharing. To select an I/O, the scheduler identifies sessions with a non-empty queue, identifies head I/Os in the queues, computes for the head I/O a deadline using session and pool reserve buckets and a release time using session and pool limit buckets, and selects a head I/O with an earliest deadline that is past the release time. If the deadline of the selected candidate head I/O is in the past, the scheduler transfers the selected head I/O to the tail of the storage device queue. Otherwise, the scheduler selects the pool with the least amount of I/O traffic according to a session fair share estimator.

System and method for managing storage system performance as a resource

A fault-tolerant and efficient way of deducing a set of inconsistent stripes for a network RAID protocol, wherein clients forward input/output (I/O) to a particular controller device called the coordinator, which executes RAID logic and which sends out device IOs to the relevant storage devices. If the coordinator fails then a new coordinator reconstructs its state from the storage devices.

System and method for fault tolerant controller for network raid

A resource management system uses a virtual resource pool distributed across a set of storage devices to manage resources in a distributed storage system. The storage devices dedicate a resource in an allocation pool available to the virtual resource pool. The virtual resource pool is a virtual storage server in which an application receives at least a predetermined amount of storage capacity, a predetermined level of performance, or a predetermined reliability, represented by tokens. A virtual resource pool manager gives the tokens to an application. The application transmits the tokens along with the commands to the storage device. The token represents a right to consume up to some limit of resources on a specific storage device in a computing session. The storage device locally tracks resource consumption through the token.

Computer program and method for managing resources in a distributed storage system

A method and system for data redundancy, wherein method comprises storing an object in an object storage device, storing a duplicate of the object in a second object storage device, converting the object into any of a grouped object Redundant Array of Independent Disks (RAID) layout and an individual RAID layout upon growth of the object, and discarding the duplicate object. The step of converting further comprises determining which of the grouped object RAID or individual RAID layout to convert the object into based on a size of the object being converted. Moreover, the step of converting into a grouped object RAID layout further comprises selecting a group based on whether the group comprises other objects similarly sized to the object, wherein the similarly sized objects comprise variably sized objects.

Adaptive grouping in object RAID

System and method for fault tolerant controller for network RAID

Adaptive grouping in object raid

A client node of a distributed storage system adaptive determines on an operation-by-operation basis whether to process a network-RAID IO operation (IO request) locally at the client node or to forward the IO request to a storage server of the system for processing. The client node determines to process the requested network-RAID operation at the client node when a local estimator for a type of the requested network-RAID operation is less than a central estimator for the type of the requested network-RAID operation. Otherwise, the client node determines to process the requested network-RAID operation at a storage server when the local estimator for the type of the requested network-RAID operation is greater than the central estimator for the type of the requested network-RAID operation.

Decision mechanisms for adapting RAID operation placement

A RAID-configured grouped-object storage system provides reduced storage space overhead for small objects. The storage system includes a plurality stripes arranged across a plurality of physical objects. Each stripe includes a plurality of storage blocks that are each mapped on to a respectively different physical object. The storage system also includes a plurality of virtual objects each containing at least one storage block. A group of virtual objects is formed when a virtual object contains less storage blocks than the number of stripes by associating the virtual object with at least one virtual object containing less storage blocks than the number of stripes and/or at least one storage block containing zero values so that the storage blocks of each group of virtual objects equals the number of stripes. The storage blocks of each virtual object and of each group of virtual objects are mapped to a respectively different stripe.

Grouped-object RAID

RAID levels are assigned to data prior to loading the data on a disk array or other data storage device. The RAID levels are determined by applying an algorithm (e.g., a rule-based criteria, a utilization model) to data workload specifications and device specifications.

Method and apparatus for assigning raid levels

Systems and methods are provided for enabling an application programmer to construct a new application program for communicating with a remote machine. The systems and methods include a parser class that retrieves during runtime a representation of object instances contained in a data file and for enabling the new application program to create in memory a plurality of object instances from the representation of the plurality of the object instances.

Object-oriented communications framework system with support for multiple remote machine types

Data storage devices of an enterprise system are tested to determine whether the enterprise system is optimally configured. Each data storage device is tested to determine whether it can satisfy a performance requirement for an assigned group of n workloads. A group of n inequalities are generated, and only up to n of the inequalities may be evaluated to determine whether the device satisfies the performance requirement for the assigned group of workloads. The inequalities are based on a phased, correlated model of I/O activity.

Acceptability testing for capacity planning of data storage system

A data storage system is provided in which a migration plan generates migration plans for reaching a goal configuration from an initial configuration in a predetermined period of time. The migration plan initially makes terminal moves until no further terminal moves can be made. A shunt move is then made based on reducing the contention (the total size of the data stores that need to be moved onto a particular data stores device divided by the amount of excess capacity on the data storage device). The shunt is selected to lead to the lowest contention for the data storage system. Subsequently, the migration plan returns to making terminal moves to develop a migration plan. By determining existence and utilization dependencies of the various moves, independent moves are determined to be implemented in parallel with moves having dependencies. This produces parallelized migration plans which run much faster than sequential migration plans.

Computer data storage system with parallelization migration plan generator

Growing community of inventors

San Francisco, CA, United States of America

Richard Andrew Golding