148 results about "Generation number" patented technology

A system and method for updating a replicated destination file system snapshot with changes in a source file system snapshot, facilitates construction of a new directory tree on the destination from source update information using a temporary or “purgatory” directory that allows any modified and deleted files on the destination active file system to be associated with (e.g. moved to) the purgatory directory if and until they are reused. In addition, an inode map is established on the destination that maps source inode numbers to destination inode numbers so as to facilitate building of the destination tree using inode / generation number tuples. The inode map allows resynchronization of the source file system to the destination. The inode map also allows association of two or more destination snapshots to each other based upon their respective maps with the source.

A high-speed method for maintaining a summary of thread activity reduces the number of remote-memory operations for an n processor, multiple node computer system from n2 to (2n−1) operations. The method uses a hierarchical summary of-thread-activity data structure that includes structures such as first and second level bit masks. The first level bit mask is accessible to all nodes and contains a bit per node, the bit indicating whether the corresponding node contains a processor that has not yet passed through a quiescent state. The second level bit mask is local to each node and contains a bit per processor per node, the bit indicating whether the corresponding processor has not yet passed through a quiescent state. The method includes determining from a data structure on the processor's node (such as a second level bitmask) if the processor has passed through a quiescent state. If so, it is then determined from the data structure if all other processors on its node have passed through a quiescent state. If so, it is then indicated in a data structure accessible to all nodes (such as the first level bitmask) that all processors on the processor's node have passed through a quiescent state. The local generation number can also be stored in the data structure accessible to all nodes. If a processor determines from this data structure that the processor is the last processor to pass through a quiescent state, the processor updates the data structure for storing a number of the current generation stored in the memory of each node.

A method and system to detect and resolve a partition condition in a cluster of computers in a networked environment is described. The method can include: creating a scratch pad area accessible by the cluster of computers; dividing the scratch pad into a plurality of slots; recording in the plurality of slots, a generation number and a list of known nodes by each one of the plurality of notes, wherein an identifier is written in the list for each node that is known to a writing node; comparing each slot of the plurality of slots to ensure the generation number and the list of known nodes matches in each slot of the plurality of slots; and resolving the partition condition by creating a list of surviving nodes and re-allocating appropriate resources to each of the surviving nodes.

A video distribution system that distributes encrypted video data, using improved encryption keys. A master content key is set as the highest-order key. One or more elements (unique camera ID, generation number, access list, time), and the order thereof, are set for the generation of keys (unique camera key, camera generation key, channel key, session key) that are of a lower order than the highest-order key. A hierarchical key system is used that is implemented by using element by element to generate keys of a gradually lower order than the highest-order key in accordance with the set order of the elements. The lowest-order key (session key) is used for data encryption and decryption.

A cluster of computer system nodes connected by a storage area network include two classes of nodes. The first class of nodes can act as clients or servers, while the other nodes can only be clients. The client-only nodes require much less functionality and can be more easily supported by different operating systems. To minimize the amount of data transmitted during normal operation, the server responsible for maintaining a cluster configuration database repeatedly multicasts the IP address, its incarnation number and the most recent database generation number. Each node stores this information and when a change is detected, each node can request an update of the data needed by that node. A client-only node uses the IP address of the server to connect to the server, to download the information from the cluster database required by the client-only node and to upload local disk connectivity information.

According to the present invention, an image compression / encoding apparatus for determining a quantization width by which a video signal is encoded so as to encode the video signal based on the quantization width is provided. The apparatus includes control means for determining an actual bit generation number which has been consumed for encoding the video signal, determining a target bit generation number in accordance with a target bit rate, determining a bit generation error as a difference between the actual bit generation number and the target bit generation number, determining a quantization width with respect to the bit generation error, setting a characteristic in a predetermined range of the bit generation error where the quantization width varies slightly with respect to the bit generation error, and determining the quantization width with respect to the bit generation error based on the characteristic.

A system and method for updating a replicated destination file system snapshot with changes in a source file system snapshot, facilitates construction of a new directory tree on the destination from source update information using a temporary or “purgatory” directory that allows any modified and deleted files on the destination active file system to be associated with (e.g. moved to) the purgatory directory if and until they are reused. In addition, an inode map is established on the destination that maps source inode numbers to destination inode numbers so as to facilitate building of the destination tree using inode / generation number tuples. The inode map allows resynchronization of the source file system to the destination. The inode map also allows association of two or more destination snapshots to each other based upon their respective maps with the source.

A method, system and computer program product for supporting concurrent updates to a shared data element group while preserving group integrity on behalf of one or more readers that are concurrently referencing group data elements without using locks or atomic instructions. Two or more updaters may be invoked to generate new group data elements. Each new data element created by the same updater is assigned a new generation number that is different than a global generation number associated with the data element group and which allows a reader of the data element group to determine whether the new data element is a correct version for the reader. The new generation numbers are different for each updater and assigned according to an order in which the updaters respectively begin update operations. The global generation number is updated so that when all of the updaters have completed data element update processing, the global generation number will correspond to the new generation number that is associated with the last of the updaters to begin update operations.

The problem of the present invention is to provide a carbazole derivative which has an excellent heat resistance and can be formed into a film without crystallization. Also, a problem is to produce an organic semiconductor element, a light emitting element and an electronic device by employing the carbazole derivative. For the purpose, a novel carbazole derivative represented by following general formula (1) is provided: (in the formula, I represents a core carbazole (G0) illustrated by general formula (2), Z represents an internally branched carbazole (G1 to Gn-1) illustrated by general formula (3), E represents an end carbazole (Gn) illustrated by general formula (4), n represents an integer showing generation number of dendrimer, X1 represents hydrogen, halogen, a cynano group, an alkyl group, an aryl group, a heterocyclic residue or the like, X2 and X3 in (G(n-m)-1) (provided, n-m≧1) make a covalent bond with X4 in (G(n-m)), and each of R1 to R8 represents independently hydrogen, halogen, a cynano group, an alkyl group, a dialkylamino group, a diarylamino group, a heterocyclic residue or the like).

A method, system and computer program product for modifying data elements in a shared data element group that must be updated atomically for the benefit of readers requiring group integrity. A global generation number is associated with the data element group and each member receives a copy of this number when it is created. Each time an update is performed, the global generation number is incremented and the updated element's copy of this number is set to the same value. For each updated data element, a link is maintained from the new version to the pre-update version thereof, either directly or using pointer-forwarding entities. When a search is initiated, the current global generation number is referenced at the commencement of the search. As data elements in the group are traversed, the reader traverses the links between new and old data element versions to find a version having a matching generation number, if any. Following the occurrence of a grace period in which all readers have passed through quiescent states, all old data element versions are freed.

A cache manager maintains coherency of cached objects used by applications in a computing system. The cache manager maintains a cache memory of objects as they are accessed by an application. The cache manager tracks cached objects on a per-application basis using a cache database, storing for each object metadata comprising the generation number of the application using the cached object, and the file generation number of the file from which the object was read. The cache manager determines whether cached objects are valid and can be used by the application, or are stale and must be reloaded, by using these generation numbers when an application attempts to use a file or object. In this fashion, cache coherency is maintained even in a distributed environment without the centralized cache management bottlenecks of prior approaches and without the need to eagerly purge the cache of stale versions of objects.

A method, system and computer program product for supporting concurrent updates to a shared data element group while preserving group integrity on behalf of one or more readers that are concurrently referencing group data elements without using locks or atomic instructions. Two or more updaters may be invoked to generate new group data elements. Each new data element created by the same updater is assigned a new generation number that is different than a global generation number associated with the data element group and which allows a reader of the data element group to determine whether the new data element is a correct version for the reader. The new generation numbers are different for each updater and assigned according to an order in which the updaters respectively begin update operations. The global generation number is updated so that when all of the updaters have completed data element update processing, the global generation number will correspond to the new generation number that is associated with the last of the updaters to begin update operations.

A system and method for object-level snapshot creation in an object-based storage system. The host device includes a first object management table (OMT) and a file system. The object-based storage system is connected to the host device and includes a controller and object-based storage devices (OSD). The controller includes a snapshot module, a second OMT. The snapshot module receives and processes OSD and other commands from the file system or a service processor, creates an original object and a mirror object in an OSD, and initiates a snapshot operation in an OSD. The first OMT may also reside at a metadata server. A snapshot operation may be a mirror operation or a copy on write operation. The first OMT and the second OMT maintain mapping information of a file identifier, a partition ID, and an object ID, and an object status and a generation number of snapshots.

The invention discloses an HEK (human embryonic kidney) 293 cell line applicable to serum-free culture and an application thereof. According to the invention, the HEK 293 cell (293SF) applicable to serum-free culture is obtained by adopting a culture solution progressive substitution method, wherein the preservation number of the HEK 293 cell is CGMCC (China General Microbiological Culture Collection Center) No.5824. Detection shows that the 293SF cell has stable adenovirus proliferation capacity and foreign protein expressing ability; average lesion time is 97 hours and is reduced by 12.9% compared with the HEK 293 cell; virus virulence reaches up to 107.48TCID50 / mL and is improved by 43.3% compared with the HEK293 cell; and stability is good while generation number is improved, and the state and susceptibility of the 293SF cell are not changed after the 293SF cell is continuous passage is carried out for sixteen times. The cell line disclosed by the invention can be used for serum-free production of an adenovirus vector vaccine.

The invention discloses a bitter gourd large-scale rapid seedling growing method which includes the steps of seed germination accelerating, seedling growing nutrient soil preparing, bowl loading seeding, seedling management and the like. According to the bitter gourd large-scale rapid seedling growing method, the water-retaining performance, the permeability and the antibacterial property of nutrient soil are good, the abundant nutrient elements such as nitrogen, phosphorus, potassium and organic materials are contained, various nutrients required by seedling emerging of bitter gourd seeds are completely met, rapid seedling emerging of the seeds is prompted, the seedling stage plant diseases and insect pests are reduced, the seedling emergency percentage is improved, and manpower is saved; the seedling growing period is short, the seedling emergency percentage is higher than 95%, limitation of the seasonality is avoided, seedling growing can be carried out all the year around, the transplanting survival rate is high, the bitter gourd planting time can be shortened, the inner-year planting generation number can be increased, the bitter gourd yield can be improved, and the bitter gourd large-scale rapid seedling growing method is suitable for bitter gourd manual large-scale planting, and has the high economic benefits.

A data coherence system includes a generation number written to a data track of a logical sub-system. The generation number is compared to a corresponding generation number in a processing device when it is initialized. If the two generations numbers are the same, the generation numbers are incremented and saved. If not, cache associated with the logical sub-system residing within the processing device is erased and the generation numbers are reset.

Provided are a method, system, and program for managing updates of user data and parity data stored in stripes across a plurality of disk storage units arranged in a data organization type such as a RAID array. In one embodiment, a record of stripes potentially containing inconsistent user and parity data is stored on a disk storage unit. In another aspect, before writing a record of stripes to a disk storage unit, stripe entries for a plurality of write processes is permitted to accumulate. In another aspect, a record of stripes may be written to different disk storage units and a generation number is used to identify the latest record of stripes.

Methods, systems, and computer program products for file version control management are provided. Methods include receiving a loadset of at least one data file and activating the loadset. For each data file in the loadset, the data file is written to a target system and identified by a base name and a generation number. A symbolic link with an activation number is created in a version control file index (VCFX) to the data file written to the target system. An application view to the symbolic link is provided as the base name of the data file, and the application view to the symbolic link is limited based on an activation number of the application corresponding to the activation number of the symbolic link.

Disclosed herein are an apparatus and method for enabling clients to participate in data storage in a distributed file system. The client device of a distributed file system according to the present invention includes a storage determination unit and a file reading unit. The storage determination unit determines whether first metadata information, including a global generation number of the chunk corresponding to a file to be read, has already been stored in the local storage. The file reading unit performs a read operation on the file using local data corresponding to the first metadata information if, as a result of the determination, it is determined that the first metadata information has already been stored.

Systems and methods for managing records stored in a storage cache are provided. A cache index is created and maintained to track where records are stored in buckets in the storage cache. The cache index maps the memory locations of the cached records to the buckets in the cache storage and can be quickly traversed by a metadata manager to determine whether a requested record can be retrieved from the cache storage. Bucket addresses stored in the cache index include a generation number of the bucket that is used to determine whether the cached record is stale. The generation number allows a bucket manager to evict buckets in the cache without having to update the bucket addresses stored in the cache index. Further, the bucket manager is tiered thus allowing efficient use of differing filter functions and even different types of memories as may be desired in a given implementation.

The invention discloses a method for routing multicasts and allocating frequency spectrums in a cognitive wireless Mesh network, comprising the following steps of: modelling the cognitive wireless Mesh network composed of a static CR-Mesh router into an undirected multi-graph; then, using a genetic algorithm to obtain a channel allocation scheme that a maximum value of path delay is minimum, including initialization; based on a shortest path algorithm, calculating an individual fitness function value; executing selection, crossover and mutation operations; generating the next generation of population; achieving a generation number; and outputting a plurality of steps of an optimal solution. By means of the invention, the problem of routing multicasts and allocating frequency spectrums of a monophyletic node in the cognitive wireless Mesh network can be solved; therefore, the maximum value of the path delay from a source node to all multicast destination nodes is minimum; and the network performance can be effectively improved.

Systems and methods for managing records stored in a storage cache are provided. A cache index is created and maintained to track where records are stored in buckets in the storage cache. The cache index maps the memory locations of the cached records to the buckets in the cache storage and can be quickly traversed by a metadata manager to determine whether a requested record can be retrieved from the cache storage. Bucket addresses stored in the cache index include a generation number of the bucket that is used to determine whether the cached record is stale. The generation number allows a bucket manager to evict buckets in the cache without having to update the bucket addresses stored in the cache index. In an alternative embodiment, non-contiguous portions of computing system working memory are used to cache data instead of a dedicated storage cache.

The invention discloses a batch scheduling method for flexible job shops based on genetic algorithms. The steps of the method are: (1) Determine the operating parameters, including population size M, crossover probability P C , the mutation probability P M , the number of iterations T; (2) Initial population generation, using segmented coding method to generate batch codes and process codes; (3) Individual fitness calculation, taking the reciprocal of the individual’s total completion time as its fitness value; (4) Select Operation, using the roulette selection operator; (5) crossover operation, setting crossover execution criteria, performing crossover on batch codes or process codes according to the criteria, and repairing after crossover; (6) mutation operation, using multiple Point mutation, using reverse sequence mutation for the process code; (7) Termination discrimination, judging whether the number of generations meets the termination condition, stop if it is satisfied, and output the optimal scheduling plan, otherwise go to (3). The invention can optimize the production operation of the flexible workshop, effectively shorten the production cycle, has strong applicability and is easy to popularize.

A method, system, and program manages updates of user data and parity data stored in stripes across a plurality of disk storage units arranged in a data organization type such as a RAID array. In one embodiment, a record of stripes potentially containing inconsistent user and parity data is stored on a disk storage unit. In another aspect, before writing a record of stripes to a disk storage unit, stripe entries for a plurality of write processes is permitted to accumulate. In another aspect, a record of stripes may be written to different disk storage units and a generation number is used to identify the latest record of stripes.

A main memory stores cache blocks obtained by dividing a program. At a position in a cache block where a branch to another cache block is provided, there is embedded an instruction for activating a branch resolution routine for performing processing, such as loading of a cache block of the branch target. A program is loaded into a local memory in units of cache blocks, and the cache blocks are serially stored in first through nth banks, which are sections provided in the storage area. Management of addresses in the local memory or processing for discarding a copy of a cache block is performed with reference to an address translation table, an inter-bank reference table and a generation number table.

The invention discloses a preparation method of a diamond composite coating of a micro milling cutter, and relates to the micro milling cutter. The preparation method comprises the following steps of: placing a PCB (Printed Circuit Board) micro milling cutter into a tool and then placing into a deposition reaction chamber; evacuating the deposition reaction chamber, and introducing methane (CH4), hydrogen gas and oxygen gas into the deposition reaction chamber; applying direct-current electric arc to a heating wire which is installed in the deposition reaction chamber, wherein a deposition process in the deposition reaction chamber is divided into five stages including a heating stage, a nucleation stage, a submicrocrystal growth stage, a superfine nanocrystalline growth stage and a final growth stage, different gas-phase deposition conditions are adopted in the five stages, the submicrocrystal growth stage and the superfine nanocrystalline growth stage can be generated in a circulating manner to form a diamond submicrocrystal and superfine nanocrystalline composite coating, and the circulating generation number is N (N is not less than 1). The prepared diamond composite coating of the micro milling cutter can be used for keeping the cutting edge to be sharp for a longer time, obviously improving the machining effect, prolonging the service life of the cutter, reducing the cutter changing frequency, improving the machining efficiency and lowering the machining cost.

The invention discloses a laser projection system comprising a laser light source which emits laser beams of at least one color. The transmission light path of the laser beams includes a light homogenizing part which is used for receiving and homogenizing the laser beams; a light valve which is used for receiving the laser beams homogenized by the light homogenizing part and modulating the laser beams; a diffuse scattering phase plate which is arranged at the light incident surface side of the light homogenizing part and can increase the divergence angle of the beams; and a moving diffuser which is arranged at the light emergent surface side of the light homogenizing part and can greatly enhance the generation number of random phases, wherein the position of the moving diffuser is the object plane position of the light valve and the human eye integration effect is performed on the generated random phases so that the speckle effect of the projection frame can be weakened or eliminated to the greatest extent, and thus the speckle elimination effect and the display quality of the projection frame can be greatly enhanced.

The invention provides a method for network reconstruction double-layer optimization based on a node importance evaluation matrix and relates to a power supply network reconstruction method. At present, the weighted network node importance assessment result is too one-sided. The method comprises the steps of inputting an initial parameter of a particle swarm optimization; according to each particle, calling a double layer optimization model, wherein solving an upper layer optimization model to obtain a starting moment of a machine set and working out an available generating capacity of a system, solving a lower layer model to obtain a recovery path of a generator node, and thus obtaining a target function value of each particle; calculating the fitness of each particle according to the target function value; updating locations and speeds of the particles to obtain new particles; repeating the steps until the particle swarm reproductive generation number Mc is reached; selecting optimal particles, causing the solution to the upper layer optimization model corresponding to the optimal particles to be the optimal machine set starting time, and causing the solution to the lower layer model to be the recovery path. According to the technical scheme, the assessment of the node importance is more comprehensive, and the problem that the machine set delays the recovery is solved effectively.