263 results about "Data reorganization" patented technology

A system and method is provided for vectorizing misaligned references in compiled code for SIMD architectures that support only aligned loads and stores. In this framework, a loop is first simdized as if the memory unit imposes no alignment constraints. The compiler then inserts data reorganization operations to satisfy the actual alignment requirements of the hardware. Finally, the code generation algorithm generates SIMD codes based on the data reorganization graph, addressing realistic issues such as runtime alignments, unknown loop bounds, residual iteration counts, and multiple statements with arbitrary alignment combinations. Loop peeling is used to reduce the computational overhead associated with misaligned data. A loop prologue and epilogue are peeled from individual iterations in the simdized loop, and vector-splicing instructions are applied to the peeled iterations, while the steady-state loop body incurs no additional computational overhead.

A distributed data reorganization system and method for mapping and reducing raw data containing a plurality of data records. Embodiments of the distributed data reorganization system and method operate in a general-purpose parallel execution environment that use an arbitrary communication directed acyclic graph. The vertices of the graph accept multiple data inputs and generate multiple data inputs, and may be of different types. Embodiments of the distributed data reorganization system and method include a plurality of distributed mappers that use a mapping criteria supplied by a developer to map the plurality of data records to data buckets. The mapped data record and data bucket identifications are input for a plurality of distributed reducers. Each distributed reducer groups together data records having the same data bucket identification and then uses a merge logic supplied by the developer to reduce the grouped data records to obtain reorganized data.

A system and method is provided for vectorizing misaligned references in compiled code for SIMD architectures that support only aligned loads and stores. In the framework presented herein, a loop is first simdized as if the memory unit imposes no alignment constraints. The compiler then inserts data reorganization operations to satisfy the actual alignment requirement of the hardware. Finally, the code generation algorithm generates SIMD codes based on the data reorganization graph, addressing realistic issues such as runtime alignments, unknown loop bounds, residue iteration counts, and multiple statements with arbitrary alignment combinations. Beyond generating a valid simdization, a preferred embodiment further improves the quality of the generated codes. Four stream-shift placement policies are disclosed, which minimize the number of data reorganization generated by the alignment handling.

The invention relates to a method and a device for detecting Trojans by analyzing network behaviors. The Trojans are detected by analyzing and comparing behavior characteristics. The method comprises the following steps of: searching the network behaviors in a local area network; analyzing the representative behavior characteristics of the network behaviors, and detecting the Trojans in real time through the network behaviors such as external linkage of the Trojans, information stealing and outbound information. The device consists of an acquisition device and an analyzer, wherein the acquisition device acquires a network data packet and sends the network data packet to the analyzer; the analyzer reorganizes data, extracts the representative behavior characteristic of the data, performs correlation analysis with a Trojan characteristic library, generates a security event report and presents the security event report to a fore system. The Trojans are detected by using behavior characteristic analysis technology; and compared with the conventional program characteristic code comparison technology, the method of the invention has the advantages of capability of detecting the Trojans in known types and in unknown types, and good detection effect particularly for mutation and variation such as packed and kill-free Trojans.

The invention discloses a data security monitoring method and device, electronic equipment and a readable medium, and the method comprises the steps: carrying out the protocol recognition of obtainednetwork flow data, and determining the protocol type of the network flow data; analyzing and recombining the network flow data layer by layer according to the protocol type and the corresponding protocol characteristics to obtain corresponding restored data; and analyzing and detecting the restored data, and determining whether the restored data is abnormal or not. According to different protocoltypes, multi-level data analysis and data recombination are carried out on the obtained network flow data; according to the method, the restored data is acquired by analyzing and detecting the restored data, and whether the restored data is abnormal or not, namely hidden threats, exists in the restored data or not is determined, so that various hidden threats in the network can be discovered in time, and various network attacks with long latency time and complex attack means can be discovered.

An index can be maintained during a reorganization of data in a database by retaining each root segment, or the prefix component of each root segment, in its storage location during the reorganization. Correction of an index after a reorganization of data in a database can be facilitated by assigning a unique token to each target segment, or the prefix component of each target segment, and each corresponding index entry having an address to a target segment, prior to a reorganization of data. The unique token for a given target segment, or the prefix component for a given target segment, and the unique token for a corresponding index entry are the same. After a reorganization of data in the database, the unique token of a first index entry is read. Then, the unique token of each target segment, or the prefix component of each target segment, is read until a match is found.

A dominion database format that is specially used in parasitic parameter extraction tools belongs to the technical field of IC CAD. When using a regular dominion database to perform parasitic parameter extraction, the efficiency of searching, reading and input data organization with the parasitic parameter extraction tool is not high. The invention provides a ZPD format database, which is a special-purpose dominion database format for the parasitic parameter extraction tools. The special-purpose dominion data format can establish quick indexes for polygon data as well as the bodies of bus network that are distributed inside different layers; define and save the network connection relationship and the element data type of component information, so as to reduce unnecessary data recombination; compress the storage space for the dominion coordinate data; store relevant element data into a continuous space and eliminate redundant information, so as to improve data-reading speed; the invention can considerably improve the capacity of searching, reading and input data organization for parasitic parameter extraction tools.

A virtual address scheme for improving performance and efficiency of memory accesses of sparsely-stored data items in a cached memory system is disclosed. In a preferred embodiment of the present invention, a special address translation unit is used to translate sets of non-contiguous addresses in real memory into contiguous blocks of addresses in an “intermediate address space.” This intermediate address space is a fictitious or “virtual” address space, but is distinguishable from the virtual address space visible to application programs, and in user-level memory operations, effective addresses seen/manipulated by application programs are translated into intermediate addresses by an additional address translation unit for memory caching purposes. This scheme allows non-contiguous data items in memory to be assembled into contiguous cache lines for more efficient caching/access (due to the perceived spatial proximity of the data from the perspective of the processor).

Disclosed are a method and system for finding an optimal data layout. The approach of the present invention is to try one of several data layouts in the memory, measure the impact of said one data layout on a performance of a program, and decide which of said several data layouts to try next. The trying and measuring steps are repeated, and one of said several data layouts is selected as best or optimal based on the measurings. The preferred embodiment of the invention provides layout auditing, a framework for picking the best data layout online without requiring any user input. Layout auditing optimizes data layouts with a try-measure-decide feedback loop: use a data reorganizer to try one of several data layouts, use a profiler to measure the impact of the data layout on performance, and use a controller to decide which data layout to try next.

A data restructuring method and system. The method includes receiving by a computing system from a first user content data arranged in a first specified order and a command for tagging portions of the content data according to various parameters. The computing system assigns identification tags to the portions of the content data. The computing system presents the identification tags to the first user. The computing system receives from the first user, a selection of at least one of the identification tags. The computing system restructures the content data into a second specified order in response to the selection. The computing system receives a request for viewing the content data from a second user. The computing system presents to the second user, the content data in the second specified order.

The invention discloses a method and a system for transmitting data. The method comprises at least one data transmission process, wherein the process comprises the following steps of reading data in a source data storage device; according to the type number of data transmission interfaces and the transmission speed of each type of data transmission interface, dividing the read data into a plurality of first divided data blocks, wherein each first divided data block corresponds to one type of data transmission interface, and the size of each first divided data block is matched with the transmission speed of the data transmission interface corresponding to the first divided data block; according to the number of data caching devices connected with each type of data transmission interface, averagely dividing the data in each first divided data block into a plurality of second divided data blocks; transmitting the data in each second divided data block to the corresponding data caching device; and after performing data reconstitution on the data in the data caching device, transmitting the data to a target data storage device. By the method and the system, the data transmission speed can be improved, and the data transmission time is saved.

The invention provides a digital high-definition display controlling device and a method thereof. The method comprises the steps that: a DVI interface module accesses an external video signal and inputs the external video signal to a screen capturing module; the screen capturing module captures the video signal according to a HDTV resolution ratio standard of 1280 multiplied by 720 and transmits the video signal after capturing to a data reorganization module which carries out data reorganization to the video signal and inputs the signal after reorganization to a ping pong storage controlling module which carries out caching storage process to the video data after reorganization and causes the video data to be output continuously to a data distribution module by an HDTV frame frequency of 60Hz; and the data distribution module adjusts the output sequence of the video data and outputs the video data to an LED lattice screen. The device and the method can cause the displaying result of the LED lattice screen to reach an HDTV displaying standard of 1280 multiplied by 720 at 60Hz.

The invention discloses a TV-based 3D positron emission tomography (PET) image reconstruction method. The method includes the following steps that: (1) 3D projection data are obtained by using a PET 3D acquisition mode; (2) the 3D projection data are recombined to form 2D projection data; (3) reconstruction image frequency domain distribution is calculated from the 2D projection data; (4) total variation operators are added into a direct Fourier transform model, and a target function is established; (5) the above model is solved through adopting a BOSVS algorithm, so that 2D reconstruction results can be obtained; and (6) all 2D reconstruction results are merged so as to form a 3D reconstruction image. According to the method of the invention, based on direct Fourier transform, total variation is adopted as a regular term, so that the model can be constructed; the BOSVS algorithm is adopted to perform iteration solving, so that the reconstruction image with higher resolution and clearer edges can be obtained, and therefore, the quality of the reconstruction image can be significantly improved on the basis that direct Fourier transform rapid reconstruction is ensured, and better results can be obtained under low counting rate.

The invention provides a cloud storage data service device, a cloud storage data transmission system, a server and a method. The cloud storage data service device comprises a data service module. The data service module is used for: receiving characteristic values of data to be transmitted when a cloud storage client conducts cloud storage, and conducting duplication eliminating storage according to the characteristic values; and receiving an access request transmitted when the cloud storage client conducts cloud storage access, according to the access request, extracting the data after duplication elimination, conducting data reorganization, and transmitting to the cloud storage client. According to the invention, by application of data duplication elimination to cloud storage data transmission, the expandability problem of a large-scale cloud storage environment can be solved, the duplication eliminating ratio and transmission efficiency are improved, the availability of transmission services is improved, the resource consumption of the client is reducing, and poor network environments are tolerated.

A system and method of reassembly a file from fragmented data written onto digital storage media are disclosed. The data reassembling system and method is particularly useful for image data reconstruction, and in forensic data recovery. More particularly, the inventive concept allows for reassembling out-of-sequence data fragments.

A method for organizing data at levels of granularity larger or smaller than an extent is disclosed. The method initially closes a dataset on a host system. The host system includes a mapping table storing a logical address of the dataset. When the dataset is closed, the host system generates a message indicating that the dataset has been closed and sends the message to a storage system storing the dataset. In response, the storage system allocates a new logical address and copies the dataset from the existing logical address to the new logical address to improve data placement. The storage system then returns the new logical address to the host system so that the host system can update its mapping table. A corresponding system and computer program product are also disclosed.

The invention relates to the technical field of a geospatial information system, and provides a three-dimensional space data parallel scheduling method based on data content. The method comprises the steps of receiving three-dimensional space data scheduling requests of a plurality of clients; resolving a three-dimensional space data scheduling task through a scheduling task parallel resolving method based on the data content, generating a three-dimensional space data scheduling sub-task which can be executed in parallel; distributing a usable task executing thread and a database connection for the three-dimensional space data scheduling sub-task, carrying out parallel inquiry of the three-dimensional space database; recombining the obtained data inquired by the three-dimensional space data scheduling sub-task and then returning to the clients. The efficiency of scheduling different types of three-dimensional space data from the three-dimensional space database is improved, and the real-time visualization ability of a three-dimensional geographic information system (GIS) is also improved by resolving and parallel executing of the three-dimensional space data scheduling task.