Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Jason L. Peipelman

Jason L. Peipelman, Tucson, AZ US

Patent application numberDescriptionPublished
20080216101PARTIAL DYNAMIC IMPLEMENTATION OF JAVA INTERFACES - A system and method for implementing dynamic interfaces in a JAVA program including methods having a common implementation and other methods to be handled independently. The system comprises a first dynamic proxy object implementing an invocation handler for providing default implementations; a separate object providing implementations of any method in a defined interface that requires independent handling; and, a second dynamic proxy object provided for checking a method definition object for an implementation of the method, and in response, one of: invoking the method on the separate object if the implementation exists, and if the implementation does not exist, invoking the method on the first dynamic proxy object. The second dynamic proxy object thus allows for a single implementation for repetitive methods, while allowing special cases to be handled independently.09-04-2008
20110082842DATA COMPRESSION ALGORITHM SELECTION AND TIERING - A data storage subsystem having a plurality of data compression engines configured to compress data, each having a different compression algorithm. A data handling system is configured to select at least one sample of data; operate a plurality of the data compression engines to compress the selected sample(s); determine the compression ratios of the operated data compression engines with respect to the selected sample(s); and select the data compression engine having the greatest compression ratio with respect to the selected sample(s), to compress the data. Further, the data compression engines may be in tiers from low to high in accordance with expected latency to compress data and to uncompress compressed data; and a data compression engine is selected from a tier that is inverse to the present rate of access.04-07-2011
20110093862WORKLOAD-DISTRIBUTING DATA REPLICATION SYSTEM - A method for more effectively distributing the I/O workload in a data replication system is disclosed herein. In selected embodiments, such a method may include generating an I/O request and identifying a storage resource group associated with the I/O request. In the event the I/O request is associated with a first storage resource group, the I/O request may be directed to a first storage device and a copy of the I/O request may be mirrored from the first storage device to a second storage device. Alternatively, in the event the I/O request is associated with a second storage resource group, the I/O request may be directed to a second storage device and a copy of the I/O request may be mirrored from the second storage device to the first storage device. A corresponding system, apparatus, and computer program product are also disclosed and claimed herein.04-21-2011

Patent applications by Jason L. Peipelman, Tucson, AZ US

Jason L. Peipelman, Vail, AZ US

Patent application numberDescriptionPublished
20090172541METHOD AND SYSTEM FOR PROVIDING DYNAMIC CONTEXT ASSIST FOR A COMMAND LINE INTERFACE - A method, system, and computer program product for providing dynamic context assistance to a user of a system, such as a storage system. One or more current command line interface (CLI) entries that are entered in a CLI of the system are received and a current state of the system is determined. Dynamic context assistance is then generated for one or more current CLI entries based on entered values of the one or more CLI entries. In this regard, the dynamic context assistance can be generated and displayed in a text or graphical form when one or more dynamic context assist keys are entered in the CLI in conjunction with the current CLI entry.07-02-2009
20090187650Method and system for determining probability for availability in an instant message system - This invention provides a method or a system to track, query, and display an accurate time for the availability of other users in an instant messaging environment. The solution provides an advantage over the known solutions by providing an accurate estimation of the time for the user to be online, thus avoiding waiting for the person to log on during a timeframe where the person typically does not log on. This is a common occurrence where team members are located on the other side of the world.07-23-2009
20090193088Dynamic message correction - A system is presented to allow users in an instant messaging environment to edit already-exchanged messages dynamically, and resend the edited version of the message to the target users, as an example. The newly edited message received by the second user is clearly understandable because the corrected parts of the message have been tagged. Depending on the implementation, either a new complete and corrected message is sent, or the sent message indicates the recent editions. The altering user should go over the communication text, change or edit the text, and press ENTER.07-30-2009
20090198699REMOTE SPACE EFFICIENT REPOSITORY - A method for storing data includes establishing a space efficient storage system including a virtual repository, a staging repository and a remote repository. The virtual repository includes a first pointer to the staging repository, and the staging repository includes a second pointer to the remote repository. The method further includes receiving data at the virtual repository, storing the received data in the staging repository based on the first pointer, and determining a data access frequency based on the storage in the staging repository. In addition, the method includes comparing the determined data access frequency to a threshold frequency and transferring the stored data to the remote repository based on the second pointer and comparison and storing the stored data at the staging repository based on the comparison.08-06-2009
20090198710REMOTE SPACE EFFICIENT REPOSITORY - A method for storing data includes establishing a space efficient storage system including a virtual repository, a staging repository and a remote repository. The virtual repository includes a first pointer to the staging repository, and the staging repository includes a second pointer to the remote repository. The method further includes receiving data at the virtual repository, storing the received data in the staging repository based on the first pointer, and transferring the stored data to the remote repository based on the second pointer.08-06-2009
20100175075METHOD FOR EXECUTING A SOFTWARE ROUTINE IDENTIFIED IN A TASK OBJECT - A method for executing a software routine identified in a task object is provided. The method includes accessing a list of software routine identifiers associated with software routines that are executable on a computer server. The method further includes generating a task object generation command having at least a first software routine identifier, parameter data, and link task information and generating a second task object in response to the task object generation command. The second task object includes the first software routine identifier, the parameter data, and the link task information. The method further includes adding the second task object to a task execution queue on the computer server and executing the first software routine identified by the first software routine identifier in the second task object on the computer server to obtain at least a first result value, when the first flag value is a first predetermined value and the result parameter associated with the first task object corresponds to a second predetermined value.07-08-2010
20100175076METHOD FOR EXECUTING A SOFTWARE ROUTINE IDENTIFIED IN A TASK OBJECT - A method for executing a software routine identified in a task object is provided. The method includes accessing a list of software routine identifiers associated with software routines that are executable on a computer server, and generating a task object generation command having at least a first software routine identifier, parameter data, and event information. The event information has an event identifier and a first flag value. The method further includes generating a first task object in response to the task object generation command, which includes the first software routine identifier, the parameter data, and the event information. The method further includes adding the first task object to a task execution queue on the computer server, and executing the first software routine identified by the first software routine identifier in the first task object on the computer server to obtain at least a first result value, when an event listener on the computer server determines that the first flag value is a first predetermined value and an event associated with the event identifier is detected.07-08-2010