Browse Prior Art Database

Continuous Data Passing using Sliding Window Control

IP.com Disclosure Number: IPCOM000111970D
Original Publication Date: 1994-Apr-01
Included in the Prior Art Database: 2005-Mar-26
Document File: 4 page(s) / 79K

Publishing Venue

IBM

Related People

Gair, TA: AUTHOR [+4]

Abstract

An efficient method of moving data among physically interconnected logic units in a multimedia workstation is disclosed. The method is based on a sliding window control algorithm and is designed to consider the characteristics of multimedia applications such as:

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Continuous Data Passing using Sliding Window Control

      An efficient method of moving data among physically
interconnected logic units in a multimedia workstation is disclosed.
The method is based on a sliding window control algorithm and is
designed to consider the characteristics of multimedia applications
such as:

o   Continuous data traffic (rather than bursty)

o   Constrained end-to-end latency requirement

o   Long session time

      A multimedia workstation includes three functionally
independent components that are interconnected via a system bus.

o   Multimedia subsystem (hardware + software),

o   System processor (including system memory),

o   Communication adapter.

      It is assumed that the multimedia applications require the end
users to set up a session before actual multimedia data transfer
takes place, and a similar procedure is used to terminate the session
before the connection is stopped.  Upon confirmation of a setup
request (from the other station), the system unit prepares a
consecutive memory space region and passes the lowest (BASE) and
highest (TOP) addresses to the local parties, the multimedia
subsystem and the communication adapter, to form a channel.  One
channel is required for each direction of data transfer.  When the
end-to-end session is terminated, the system processor will release
the memory space.

      The memory space assigned by the system is accessible by the
two other parties via a system bus, and it will be used logically as
a First-In/First-Out (FIFO) queue (Fig. 1).  Besides the BASE and TOP
pointer, two pointers (FRONT and REAR) are defined to indicate the
positions of the valid data.

FRONT     indicates the available position where next data shall be
          writte...