Industrial Technology Research Institute

Jun-Yao Wang

Shen-Ming Chung

Wen-Shyang Hwang

Hsiao-Hui Lee

Tsung-Lin Tsai

Wen-Fong Wang

Chung-Ho Chen

Ce-Kuen Shieh

Shou-Jen Wey

Chao-Lin Su

Cheng-Yeh Yu

Chin-Pei Su

Chao-Hsien Hsu

I-Cheng Chung

Ching-Hung Lin

In a method and system for calculating CRC, a Partial CRC is first calculated directly according to a segment of a message. Then, a First Code including the Partial CRC appended with a plurality of zero-bytes is generated. Finally, the Adjusted CRC is calculated according to the First Code. Therefore, an Adjusted CRC can be derived directly from each segment of a message. After all segments of a message are received, all the derived Adjusted CRCs are merged to obtain a Final CRC of the message. The method and system can be quickly prototyped and implemented to various systems due to its simplicity.

Method and system for calculating CRC

A snapshot mechanism and a method thereof used in a data processing system are provided to backup snapshot data. The snapshot mechanism includes a snapshot storage unit and a buffer storage unit, wherein the snapshot storage unit is used as a unit for storing data generated after a target storage unit snapshots data and accordingly generating a plurality of snapshot management data. In addition, the buffer storage unit temporarily stores new data and flushes the data to the target storage unit in predetermined time interval. According to the snapshot management data, the target storage unit can be rolled back or rolled forward to the status before a predetermined time.

Snapshot mechanism and method thereof

A snapshot mechanism of a data processing system is provided herein. The snapshot mechanism includes providing a snapshot storage unit for storing the data created when snapshotting the target storage units and generating a plurality of snapshot images accordingly. Two different types of address tables in the snapshot image are used for corresponding to the storage units of the snapshot storage unit and the target storage units. The status of the target storage units can be recovered to the status at a predetermined time ago according to the snapshot images. The two types of address tables are respectively used for storing the data created by the data processing system and history data so as to prevent the data stored in the target storage units to be overwritten.

Snapshot mechanism in a data processing system and method and apparatus thereof

A method and system for recognizing offloaded packets, wherein a common attribute of connection identifications among a plurality of offloaded connections is first calculated. Then, a connection identification of a packet is recognized to determine whether the connection identification of the packet has the common attribute so as to determine whether the packet is a non-offloaded packet. Therefore, the non-offloaded packet can be promptly recognized to greatly lower the recognition workload of an embedded processor, to improve the efficiency of executing a partial offloaded process by the embedded processor and to decrease the operation delay of the non-offloaded packet in a protocol offload processing system.

System and method for recognizing offloaded packets

A storage structure and method having multiple protocol processor units are disclosed. The storage structure comprises a host CPU, a main memory, a storage device, a switch fabric, and a host bus adapter module. The host bus adapter module includes a plurality of protocol processor nodes for processing frames received from a network, and storing those frames into the storage device. A processing module of the host bus adapter module extracts the session information of each frame and compares it with entries recorded in a look-up table. If the connection information hits one entry of the look-up table, the frame can be bypassed into a corresponding protocol processor node according to the definition of the look-up table. Otherwise, a new entry will be inserted into the look-up table for designating a corresponding protocol processor node.

Storage structure and method utilizing multiple protocol processor units

The present invention relates to an adaptive interrupts coalescing system with recognizing minimum delay packets. The adaptive interrupts coalescing system of the invention comprises a first calculating device, a packet header parser, a second calculating device, and an interrupt controller. The first calculating device is used for calculating packet information of a plurality of packets. The packet header parser is used for recognizing the type of service field in each packet and for generating a minimum delay control signal. The second calculating device is used for determining a coalescing interrupt number signal according to the packet information and the minimum delay control signal. The interrupt controller is used for transmitting an interrupt control signal to process the packet according to the coalescing interrupt number signal. The system of the invention can process the minimum delay packet in a minimum delay time so as to reduce the delay time of the minimum delay packet and the average delay time of the packets and to avoid the miss owing to the delay of the packet.

Adaptive interrupts coalescing system with recognizing minimum delay packets

The present invention discloses a multi-priority media access control method for a multi-channel slotted ring network. In the slotted ring networks, each node has one tunable transmitter and one fixed receiver for data channels, and is able to inspect slot status on all channels. The header slot format defines the slot priorities on ring networks and limits which packets can be transmitted through the slots. By assigning slot priority based on two thresholds to raise and lower slot priority, multiple priority packets can be transmitted.

Growing community of inventors

Hsinchu, Taiwan

Jun-Yao Wang