Industrial Technology Research Institute

Yih-Woei Liang

Jinshuan Eric Lee

Shiao-Li Tsao

Kuen-Rong Hsieh

Yueh-Min Huang

Tsern-Huei Lee

Chui Chu Cheng

Chih-Yu Chiou

Eric Lee

Chien-Ming Tsao

An-Bang Chang

Chin Cheng Chuo

The present invention optimizes data placement in reference to the service of cyclic re-broadcast, typical of a media server. When the media data to be re-broadcast and the cycle of the re-broadcast are known, it is possible, according to the present invention, to calculate the portions of all the media data that will be read simultaneously and place sequentially such portions of data, so that the search time of the read/write head in the data blocks of direct access devices, such as magnetic disks, magnetic disk arrays, read-and-write optical disks, and other storage devices, can be reduced. Using the inventive data placement technology, the search time of the read/write head can be significantly reduced and the efficiency of bandwidth use can be improved, without altering typical hardware devices.

Data placement on direct access devices for media servers with cyclic

The present invention discloses a network access admission controller and the method used to determine its schedulability. The basic principle involves determining, for all the connections to be checked, if there is any time slot, among all the time slots within a cycle, that will satisfy the scheduling property without the possible misjudgment of schedulability found in the conventional technology. The inventive method of determining schedulability makes its judgment based on packets issued by all the connections and on each of these connections individually. In particular, a determination is made regarding whether there is a particular time slot, among all the time slots, corresponding to the cycle of connection under evaluation, such that all the time slots prior to it are capable of processing the previously issued packets from the connections having higher priority than this particular time slot. When the connections all have a time slot that satisfies the above conditions, a connection is determined to be schedulable. However, when any of the connections fail to have a time slot that satisfies the above conditions, a connection is determined not to be schedulable.

Admission controller for network access

An improved method is disclosed for placing continuous media data in a memory storage disk that will increase the disk operating efficiency and increase the number of users in a service round. The memory storage disk contains a plurality of tracks each track having at least one sector and the disk is divided into a plurality of physical zones of different sector/track density, and the method comprising the steps of: (a) dividing the disk into a plurality of logical zones of equal number of tracks, each logical zone being allowed to include tracks of different sector/track density; (b) for each logical zone, setting the tracks contained therein to have the same number of sector/density as the track with the smallest sector/track density; (c) assigning a constant disk access time for each logical zone; and (d) determining a read block size for each logical zone in such a manner that: (i) the read block size decreases from outer logical zones to inner logical zones; (ii) assigning a first portion of the logical zones with read block sizes that are greater than a minimum read block size required for continuous media playing so as to read extra data, which will be stored in a buffer; (iii) assigning a second portion of the logical zones with read block sizes that are smaller than the minimum read block size to thereby cause an inadequacy; and (iv) the block sizes are structured such that the inadequacy from the second portion of logical zones will be compensated by the extra data stored in the buffer, so as to ensure a continuous media play requirement.

Method and apparatus for data placement of continuous media to utilize

Growing community of inventors

Hsinchu, Taiwan

Yih-Woei Liang