Appeal 2007-1756
Application 10/185,476
claims 1, 19 and 40, as these claims do not recite a limitation directed to one
memory being written to by two processors.
FINDINGS OF FACT
1) Kale teaches a system to control the transfer of information
from scattered (non-contiguous) memory locations.
(Abstract).
2) Kale’s system makes use of descriptors which are associated
with a region of a host memory that includes the address for
each of the non-contiguous memory locations of the
network processor to be written to or from. (Col. 5, ll. 5-
24).
3) These descriptors are stored in a host descriptor table (item
114). The table and descriptors are generated by the host
computer system. (Col. 4, ll. 32-48).
4) The host descriptor table is stored in the host computer
memory. (Col. 3, ll. 48-54).
5) The host also generates a host descriptor head pointer and
tail pointer which define the beginning and end of the
descriptor table. These pointers are stored in two memories,
one associated with the host processor and the other
associated with the network processor. (Col. 4, ll. 49-57).
6) The network processor uses the pointers to find and read the
appropriate descriptor from the host descriptor table (in host
memory). Based upon the descriptor the network processor
performs the data transfer. (Col. 5, ll. 42-53).
5
Page: Previous 1 2 3 4 5 6 7 8 9 Next
Last modified: September 9, 2013