Das, WA
Amulya K. Das, Everett, WA US
Patent application number | Description | Published |
---|---|---|
20100278771 | Optically Clear Biofouling Resistant Compositions and Methods for Marine Instruments - An optically clear biofouling resistant coating compositions specially formulated for very high light transmission and more particularly coating compositions which can be applied to marine instruments and sensors. The compositions provide a biofouling resistant coating on the surface of the marine instruments and sensors which prevents underwater organisms from adhering and growing on the surfaces of the structures over a long period of time. | 11-04-2010 |
Anjan Kumar Das, Bellevue, WA US
Patent application number | Description | Published |
---|---|---|
20080270350 | SYSTEMS AND METHODS FOR MODULARIZING DATA FLOWS - Systems, devices, and methods for modularizing data flows and for providing stand-alone execution of incomplete data flows are provided based on an improved data warehousing framework. Data flow modularization and code reuse is improved through the use of the disclosed flowlets and allows for consistent and efficient standalone testing of incomplete data flows. The disclosed details enable various refinements and modifications according to system design considerations. | 10-30-2008 |
20080270424 | STANDALONE EXECUTION OF INCOMPLETE DATA FLOWS - Systems, devices, and methods for modularizing data flows and for providing stand-alone execution of incomplete data flows are provided based on an improved data warehousing framework. Data flow modularization and code reuse is improved through the use of the disclosed flowlets and allows for consistent and efficient standalone testing of incomplete data flows. The disclosed details enable various refinements and modifications according to system design considerations. | 10-30-2008 |
Munindra N. Das, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090328172 | SESSIONLESS REDIRECTION IN TERMINAL SERVICES - Embodiments described herein are directed to establishing a terminal services (TS) session between a TS server and the client without creating a temporary session. In one embodiment, a computer system receives a user request indicating that a TS session with a first TS server is to be initiated. The request includes an indication that the user is authenticated and authorized to use the first TS server. The computer system searches for any prior TS sessions previously initiated by the user with other TS servers and determines, based on the search, that at least one prior TS session was initiated with a second TS server. The computer system also sends redirection data to the user indicating that the user request is to be redirected to the second TS server to reestablish the prior TS session with the second TS server. | 12-31-2009 |
Munindra Nath Das, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20140379899 | AUTOMATIC ADJUSTMENT OF APPLICATION LAUNCH ENDPOINTS - The adjustment of a number of application launch endpoint servers that may be used to service incoming connection requests. Application launch endpoints are entities, such as running code, that may be used to launch other applications. Examples of endpoints include virtual machines or sessions in a session management server. The system load associated with the incoming connection rate and number of users is monitored. In response, an add threshold and a perhaps a remove threshold is calculated. If the system load rises above the add threshold, application launch endpoint server(s) are added to the set of endpoints that can handle incoming connection requests. If the system load falls below the remove threshold, application launch endpoint server(s) are removed from to the set of endpoints. The add and remove thresholds may be calculated per tenant, and adjusted based on tenant behavior. | 12-25-2014 |
Oisik Das, Pullman, WA US
Patent application number | Description | Published |
---|---|---|
20100223839 | SYSTEMS AND PROCESSES FOR PRODUCING BIO-FUELS FROM LIGNOCELLULOSIC MATERIALS - A selective pyrolysis process for the production of bio-oils enriched in pyrolytic sugars and phenols and conversion of these compounds into second generation bio-fuels is disclosed herein. One embodiment of the process comprises pre-treating a biomass with superheated steam or gases in a selected range of temperatures, followed by fast pyrolysis using synthesis gas as a carrier, and a two-step condensation operation. The aqueous phase from the second condenser can then be reformed to produce hydrogen or can be gasified together with the charcoal to produce syngas. | 09-09-2010 |
Paramita Das, Bellevue, WA US
Patent application number | Description | Published |
---|---|---|
20120096559 | CANCELLING DIGITAL SIGNATURES FOR FORM FILES - The embodiments described herein generally relate to methods and systems for enabling a client to request a server to cancel the digital signing of a form file associated with a form. Successful cancellation of the digital signing process results in a return of the form file to its initial state, in which data are not lost, and the form can be resubmitted and/or the application of the digital signature can be retried. Request and response messages, communicated between a protocol client and a protocol server, cause the performance of protocol functions for applying a digital signature to a form file and for cancelling the signature thereof where errors in the signing process are detected. A versioning mechanism enabling the detection of version differences and resulting upgrades to the digital signature control allows for robust communications between a client and a server operating under different product versions. | 04-19-2012 |
Pejus Manoj Das, Shoreline, WA US
Patent application number | Description | Published |
---|---|---|
20150379050 | CONFIGURABLE-CAPACITY TIME-SERIES TABLES - Methods and apparatus for configurable-capacity time-series tables are disclosed. A schedule of database table management operations, including at least an operation to change a throughput constraint associated with a table in response to a triggering event, is generated. The table is instantiated with an initial throughput constraint in accordance with the schedule. Work requests directed to the table are accepted based on the initial throughput constraint. The throughput constraint is modified in response to the triggering event. Subsequent work requests are accepted based on the modified throughput constraint. | 12-31-2015 |
Raj Das, Kirkland, WA US
Patent application number | Description | Published |
---|---|---|
20160063018 | File System with Data Block Sharing - To provide an operation that can quickly copy or rearrange a file, a file system allows stored data to be shared among two or more files or within a file. The file system provides an operation that allows an extent from one file to be copied into an extent of another file, or into a different extent in the same file if the extents do not overlap. To support such an operation, the file system tracks the storage locations for stored data for extents of a file, and whether the stored data for an extent of a file is shared with any other file or by another portion of the same file. When stored data is shared, writing to an extent of a file that refers to the shared stored data invokes a write operation to a new extent on the storage device, and the tracked information for the affected extents is updated. | 03-03-2016 |
20160092467 | FILE SYSTEM WITH PER-EXTENT CHECKSUMS - A file system allows a different checksum algorithm to be used for different extents of a file system object independently of other extents of the file system object. The checksum algorithm can be a selectable attribute of an extent or range of extents of a file system object, such that some extents of a file system object can use a first checksum algorithm, while other extents of the file system object can use a second checksum algorithm. An extent of the file system object also may have no associated checksum algorithm. The file system stores, for each extent of a file system object, data indicating a checksum for the extent and an indication of any checksum algorithm used for the extent. | 03-31-2016 |
Rajsekhar Das, Kirkland, WA US
Patent application number | Description | Published |
---|---|---|
20090043968 | Sharing Volume Data Via Shadow Copies - Aspects of the subject matter described herein relate to sharing volume data via shadow copies. In aspects, an active computer creates a shadow copy of a volume. The shadow copy is exposed to one or more passive computers that may read but not write to the volume. A passive computer may obtain data from the shadow copy by determining whether the data has been written to a differential area and, if so, reading it from the differential area. If the data has not been written to the differential area, the passive computer may obtain it by first reading it from the volume, then re-determining whether it has been written to the differential area, and if so, reading the data from the differential area. Otherwise, the data read from the volume corresponds to the data needed for the shadow copy. | 02-12-2009 |
20100250750 | CONSISTENT CLUSTER OPERATIONAL DATA IN A SERVER CLUSTER USING A QUORUM OF REPLICAS - A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations. | 09-30-2010 |
20110238813 | CONSISTENT CLUSTER OPERATIONAL DATA IN A SERVER CLUSTER USING A QUORUM OF REPLICAS - A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations. | 09-29-2011 |
20110238842 | CONSISTENT CLUSTER OPERATIONAL DATA IN A SERVER CLUSTER USING A QUORUM OF REPLICAS - A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations. | 09-29-2011 |
20140201163 | HANDLING FILE SYSTEM CORRUPTION - Aspects of the subject matter described herein relate to file system technology. In aspects, a mechanism is described that allows a file system to handle corrupted file system metadata in a way that provides high availability. When corrupted metadata is detected, the corrupted metadata may be deleted while the file system remains online and available to service file input/output operations that involve non-corrupted metadata. | 07-17-2014 |
20140280392 | FILE SYSTEM OPERATION ON MULTI-TIERED VOLUME - A file system that operates on an underlying volume that has multiple tiers, each tier including a particular trait set. Upon creating or otherwise identifying a file system namespace (such as a directory or file) that is in a volume or that is to be included within the volume, a storage trait set to be applied corresponding to the file system namespace is identified. Then, the storage trait set is compared against the trait sets for the multiple tiers to identify a tier into which to store the file system namespace. The file system namespace is then caused to be stored within the identified tier. Thus, the file system is provided with a volume that has multiple tiers (each having different trait sets) to choose from in storing files. | 09-18-2014 |
20160077988 | EFFICIENT DATA MOVEMENT WITHIN FILE SYSTEM VOLUMES - Embodiments are directed to efficiently managing data storage and efficiently storing data. In one scenario, a computer system receives a write request addressed to one portion of data storage within a data store. The computer system redirects the received write request to another portion of data storage which includes storage containers, each of which is a logically specified portion of the data store. The computer system determines which storage container the write request is to write to, and identifies a storage container that is to be de-staged from the second portion of data storage to the first portion of data storage. The computer system then de-stages the identified storage containers to the first portion of data storage, the data of the de-staged container being stored on the first portion of data storage in the same order in which the data was stored in the identified storage container prior to de-staging. | 03-17-2016 |
Rajsekhar Das, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090327798 | Cluster Shared Volumes - Described is a technology by which a storage volume is shared by cluster nodes of a server cluster. In one implementation, each node includes a redirector that provides shared access to the volume from that node. The redirector routes file system metadata requests from applications and the like through a first (e.g., SMB) communications path to the owning node, and routes file system read and write data to the storage device through a second, high-speed communications path such as direct direct block level I/O. An owning node maintains ownership of the storage device through a persistent reservation mechanism that writes a key to a registration table associated with the storage device. Non-owning nodes write a shared key. The owning node validates the shared keys against cluster membership data, and preempts (e.g., removes) any key deemed not valid. Security mechanisms for controlling access are also described. | 12-31-2009 |
20100077249 | RESOURCE ARBITRATION FOR SHARED-WRITE ACCESS VIA PERSISTENT RESERVATION - Described is a technology by which an owner node in a server cluster maintains ownership of a storage mechanism through a persistent reservation mechanism, while allowing non-owning nodes read and write access to the storage mechanism. An owner node writes a reservation key to a registration table associated with the storage mechanism. Non-owning nodes write a shared key that gives them read and write access. The owner node validates the shared keys against cluster membership data, and preempts (e.g., removes) any key deemed not valid. The owner node also defends ownership against challenges to ownership made by other nodes, so that another node can take over ownership if a (formerly) owning node is unable to defend, e.g., because of a failure. | 03-25-2010 |
20100086134 | FULL VOLUME ENCRYPTION IN A CLUSTERED ENVIRONMENT - Full volume encryption can be applied to volumes in a clustering environment. To simplify the maintenance of keys relevant to such encrypted volumes, a cluster key table construct can be utilized, where each entry of the cluster key table corresponds to an encrypted volume and comprises an identification of the encrypted volume and a key needed to access that volume. Keys can be protected by encrypting them with a key specific to each computing device storing the cluster key table. Updates can be propagated among the computing devices in the cluster by first decrypting the keys and then reencrypting them with a key specific to each computing device as they are stored on those computing devices. Access control requirements can also be added to the entries in the cluster key table. Alternative access control requirements can be accommodated by assigning multiple independent entries to a single encrypted volume. | 04-08-2010 |
20110252208 | EXPRESS-FULL BACKUP OF A CLUSTER SHARED VIRTUAL MACHINE - A computer-implemented method includes creating a first snapshot of at least one virtual machine at a first time. The first snapshot is created at a computing device of a cluster of computing devices configured to share the at least one virtual machine. As an example, each computing device in the cluster may modify the shared virtual machine via a direct input/output (I/O) transaction, bypassing a file-system stack. The first snapshot is transmitted to a backup device. The method includes creating a second snapshot of the at least one virtual machine at a second time and determining a set of changed data blocks associated with a difference between the second snapshot and the first snapshot. The set of changed blocks is transmitted to the backup device. | 10-13-2011 |
20120158681 | VOLUMES AND FILE SYSTEM IN CLUSTER SHARED VOLUMES - The present invention extends to methods, systems, and computer program products for sharing volumes between clustered nodes. Embodiments of the invention include a Clustered Shared Volume File System (CsvFs) that appears to clients as a local file system. The CsvFs communicates to a node where a disk is mounted to coordinate access to files on the disks. CsvFs uses Opportunistic Locks (oplocks) to decide when direct access to a volume is safe. CsvFs can be extended with oplock upgrade mechanisms that allow a coordinating node to tell CsvFs when it is safe to attempt to upgrade oplock. CsvFs also uses a transitivity property of oplocks to be able to grant (delegate) oplocks to clients that are on top of CsvFs. | 06-21-2012 |
Shaiket S. Das, Snoqualmie, WA US
Patent application number | Description | Published |
---|---|---|
20140365977 | Accommodating Sensors and Touch in a Unified Experience - Automatically alternating between input modes on a computing device based on a usage pattern is provided. A first input mode is initiated for interacting with content displayed on the computing device. An input corresponding to a second input mode on the computing is then detected. A transition is then made from the first input mode to the second input mode on the computing device. Upon the detecting a termination of the input on the displayed content the second input mode, a gradual transition is made from the second input mode to the first input mode based on a current sensor state of the computing device and a threshold. | 12-11-2014 |
Sudipto Das, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20140207740 | Isolating Resources and Performance in a Database Management System - Techniques for tenant performance isolation in a multiple-tenant database management system are described. These techniques may include providing a reservation of server resources. The server resources reservation may include a reservation of a central processing unit (CPU), a reservation of Input/Output throughput, and/or a reservation of buffer pool memory or working memory. The techniques may also include a metering mechanism that determines whether the resource reservation is satisfied. The metering mechanism may be independent of an actual resource allocation mechanism associated with the server resource reservation. | 07-24-2014 |
20140379924 | DYNAMIC ALLOCATION OF RESOURCES WHILE CONSIDERING RESOURCE RESERVATIONS - Described herein are technologies relating to computing resource allocation among multiple tenants. Each tenant may have a respective absolute reservation for rate-based computing resources, which is independent of computing resource reservations of other tenants. The multiple tenants vie for the rate-based computing resources, and tasks are scheduled based upon which tenants submit the tasks and the resource reservations of such tenants. | 12-25-2014 |
Sudipto Das, Bellevue, WA US
Patent application number | Description | Published |
---|---|---|
20130332435 | PARTITIONING OPTIMISTIC CONCURRENCY CONTROL AND LOGGING - Parallel certification of transactions on shared data stored in database partitions included in an approximate database partitioning arrangement may be initiated, based on initiating a plurality of certification algorithm executions in parallel, and providing a sequential certifier effect. Logging operations associated with a plurality of log partitions configured to store transaction objects associated with each respective transaction may be initiated, each respective database partition included in the approximate database partitioning being associated with one or more of the log partitions. A scheduler may assign each of the transactions to a selected one of the certification algorithm executions. | 12-12-2013 |