1. A method of prioritizing data transfer requests serviced by a centralized data transfer unit comprising the steps of:
receiving transfer request packets, each transfer request packet indicating a desired data transfer and a priority level within a hierarchy of a plurality of priority levels;
storing each received transfer request packet in a queue memory, each received transfer request packet stored in a first-in-first-out fashion within each priority level, said storing including
storing each received transfer request packet in a random access memory fashion,
defining an address range within said queue memory allocated to each priority level with a corresponding queue bounds register,
storing a next input transfer request packet for a priority level at address within said queue memory indicated by a corresponding queue write pointer indicating address location,
reading a next output transfer request packet for a priority level from an address within said queue memory indicated by a corresponding queue read pointer,
dynamically defining said address range allocated to a priority level by dynamically writing to a corresponding queue bounds register;
detecting availability of free data transfer channel among a plurality of data transfer channels within said centralized data transfer processor; and
dispatching a next transfer request packet in said first-in-first-out fashion to the corresponding free data transfer channel.
2. The method of claim 1, further comprising the steps of:
incrementing the corresponding queue write pointer upon storage of a transfer request packet in queue memory; and
decrementing the corresponding queue read pointer upon transfer of a transfer request packet to a data transfer channel.
3. The method of claim 1, further comprising the steps of:
generating said transfer request packets at each of a plurality of transfer request nodes; and
upon dispatching of a transfer request packet to a free data transfer channel, sending a queue acknowledge signal to said transfer request node originating said transfer request packet.
4. The method of claim 1, wherein:
the number of data transfer channels equals the number of priority levels.
5. A method of prioritizing data transfer requests serviced by a centralized data transfer unit comprising the steps of:
receiving transfer request packets, each transfer request packet indicating a desired data transfer and a priority level within a hierarchy of a plurality of priority levels;
storing each received transfer request packet in a queue memory each received transfer request packet stored in a first-in-first-out fashion within each priority level;
detecting availability of free data transfer channel among a plurality of data transfer channels within said centralized data transfer processor;
dispatching a next transfer request packet in said first-in-first-out fashion to the corresponding free data transfer channel;
detecting if a channel corresponding to a priority level within the queue is empty; and
if a received transfer request packet es has a priority level detected to be empty;
bypassing storing said transfer request packet in said queue memory, and
dispatching said transfer request packet directly to the corresponding free data transfer channel.
6. The method of claim 5, wherein:
said step of storing each received transfer request packet in a queue memory includes
storing each received transfer request packet in a random access memory fashion,
defining an address range within said queue memory allocated to each priority level with a corresponding queue bounds register,
storing a next input transfer request packet for a priority level at address within said queue memory indicated by a corresponding queue write pointer indicating address location, and
reading a next output transfer request packet for a priority level from an address within said queue memory indicated by a corresponding queue read pointer.
7. The method of claim 6, further comprising the steps of:
incrementing the corresponding queue write pointer upon storage of a transfer request packet in queue memory; memory and
decrementing the corresponding queue read pointer upon transfer of a transfer request packet to a data transfer channel.
8. The method of claim 5, further comprising the steps of:
generating said transfer request packets at each of a plurality of transfer request nodes; and
upon dispatching of a transfer request packet to a free data transfer channel, sending a queue acknowledge signal to said transfer request node originating said transfer request packet.
9. The method of claim 5, wherein:
the number of data transfer channels equals the number of priority levels.
10. A method of prioritizing data transfer requests serviced by a centralized data transfer unit comprising the steps of:
receiving transfer request packets, each transfer request packet indicating a desired data transfer and a priority level within a hierarchy of a plurality of priority levels;
storing each received transfer request packet in a queue memory, each received transfer request packet stored in a first-in-first-out fashion within each priority level;
detecting availability of free data transfer channel among a plurality of data transfer channels within said centralized data transfer processor;
dispatching a next transfer request packet in said first-in-first-out fashion to the corresponding free data transfer channel;
generating said transfer request packets at each of a plurality of transfer request nodes, said transfer request packet identifying an originating transfer request node;
disabling dispatching transfer request packets originating from selected transfer request nodes; and
ignoring transfer request packets originating from disabled transfer request nodes.
11. The method of claim 10, wherein:
said step of disabling dispatching transfer request packets originating from selected transfer request nodes includes writing at least one to a corresponding location within a request disable register.
12. The method of claim 10, wherein:
said step of storing each received transfer request packet in a queue memory includes
storing each received transfer request packet in a random access memory fashion,
defining an address range within said queue memory allocated to each priority level with a corresponding queue bounds register,
storing a next input transfer request packet for a priority level at address within said queue memory indicated by a corresponding queue write pointer indicating address location, and
reading a next output transfer request packet for a priority level from an address within said queue memory indicated by a corresponding queue read pointer.
13. The method of claim 12, further comprising the steps of:
incrementing the corresponding queue write pointer upon storage of a transfer request packet in queue memory; memory and
decrementing the corresponding queue read pointer upon transfer of a transfer request packet to a data transfer channel.
14. The method of claim 10, further comprising the steps of:
generating said transfer request packets at each of a plurality of transfer request nodes; and
upon dispatching of a transfer request packet to a free data transfer channel, sending a queue acknowledge signal to said transfer request node originating said transfer request packet.
15. The method of claim 10, wherein:
the number of data transfer channels equals the number of priority levels.
16. The method of prioritizing data transfer requests serviced by a centralized data transfer unit comprising the steps of:
receiving transfer request packets, each transfer request packet indicating a desired data transfer and a priority level within a hierarchy of a plurality of priority levels;
storing each received transfer request packet in a queue memory, each received transfer request packet stored in a first-in-first-out fashion within each priority level;
detecting availability of free data transfer channel among a plurality of data transfer channels within said centralized data transfer processor;
dispatching a next transfer request packet in said first-in-first-out fashion to the corresponding free data transfer channel;
generating said transfer request packets at each of a plurality of transfer request nodes; and
upon dispatching of a transfer request packet to a free data transfer channel, sending a queue acknowledge signal to said transfer request node originating said transfer request packet.
17. The method of claim 16, wherein:
said step of storing each received transfer request packet in a queue memory includes
storing each received transfer request packet in a random access memory fashion,
defining an address range within said queue memory allocated to each priority level with a corresponding queue bounds register,
storing a next input transfer request packet for a priority level at address within said queue memory indicated by a corresponding queue write pointer indicating address location, and
reading a next output transfer request packet for a priority level from an address within said queue memory indicated by a corresponding queue read pointer.
18. The method of claim 17, further comprising the steps of:
incrementing the corresponding queue write pointer upon storage of a transfer request packet in queue memory; memory and
decrementing the corresponding queue read pointer upon transfer of a transfer request packet to a data transfer channel.
19. The method of claim 16, wherein:
the number of data transfer channels equals the number of priority levels.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. An image data reproducing apparatus comprising:
first means for classifying main image data pieces in a recording medium into groups according to recording date and time;
second means for generating a digest image data piece from a main image data piece or pieces in each of the groups, wherein each of the generated digest image data pieces represents a digest of contents of the corresponding main image data piece or pieces; and
third means responsive to user’s command for sequentially reproducing contents of the digest image data pieces, which are generated by the second means, in an order accorded with the recording dates and times of the main image data pieces corresponding to the digest image data pieces.
2. An image data reproducing apparatus comprising:
first means for classifying main image data pieces in a recording medium into groups according to recording date and time;
second means for generating a digest segment information piece designating a portion or portions of a main image data piece or pieces in each of the groups as a virtual digest image data piece; and
third means responsive to user’s command for sequentially reproducing contents of the portions designated by the digest segment information pieces generated by the second means to sequentially reproduce contents of the virtual digest image data pieces in an order accorded with the recording dates and times of the main image data pieces corresponding to the virtual digest image data pieces.
3. An image data reproducing apparatus as recited in claim 1, further comprising fourth means for reproducing contents of one or ones of the main image data pieces, and fifth means responsive to user’s command for replacing reproduction of contents of one of the digest image data pieces by the third means with reproduction of a main image data piece or pieces in a group corresponding to the one of the digest image data pieces by the fourth means, wherein the reproduction of the main image data pieces is in an order accorded with the recording dates and times thereof.
4. An image data reproducing apparatus as recited in claim 1, further comprising fourth means for reproducing contents of one of the main image data pieces, and fifth means responsive to user’s command for replacing reproduction of one of the main image data pieces by the fourth means with reproduction of a digest image data piece corresponding to a group to which the one of the main image data pieces belongs, and other digest image data pieces by the third means, wherein the reproduction of the digest image data pieces is in an order accorded with the recording dates and times of the main image data pieces corresponding to the digest image data pieces.
5. A method of reproducing image data, comprising the steps of:
classifying main image data pieces in a recording medium into groups according to recording date and time;
generating a digest image data piece from a main image data piece or pieces in each of the groups, wherein each of the generated digest image data piece represents a digest of contents of the corresponding main image data piece or pieces; and
responsive to user’s command, sequentially reproducing contents of the digest image data pieces in an order accorded with the recording dates and times of the main image data pieces corresponding to the digest image data pieces.
6. A method of reproducing image data, comprising the steps of:
classifying main image data pieces in a recording medium into groups according to recording date and time;
generating a digest segment information piece designating a portion or portions of a main image data piece or pieces in each of the groups as a virtual digest image data piece; and
responsive to user’s command, sequentially reproducing contents of the portions designated by the generated digest segment information pieces to sequentially reproduce contents of the virtual digest image data pieces in an order accorded with the recording dates and times of the main image data pieces corresponding to the virtual digest image data pieces.
7. An image data reproducing apparatus comprising:
first means for reproducing first image data;
second means for reproducing second image data containing link information providing a link to the first image data; and
third means for making a switch from the reproduction of the second image data by the second means to the reproduction of the first image data by the first means in response to the link information.
8. An image data reproducing apparatus as recited in claim 7, wherein the link information represents a term for which the link information is effective, and an ID number of the first image data or an ID number of one among groups of pieces of the first image data, and wherein the link information contains button information, and further comprising a display for indicating a button in accordance with the button information, means for allowing a user to select the button indicated by the display, and means provided in the third means for making a switch from the reproduction of the second image data by the second means to the reproduction of the first image data having the ID number represented by the link information or a piece of the first image data in a group having the ID number represented by the link information in cases where the user selects the button during the term represented by the link information.
9. An image data reproducing apparatus as recited in claim 8, wherein the link information contains compulsory information representing one of (1) an ID number of the first image data, (2) an ID number of one among groups of pieces of the first image data, and (3) an ID number of one among pieces of the second image data, and further comprising means for making a switch from the reproduction of one among pieces of the second image data by the second means to reproduction of one of (1) the first image data having the ID number represented by the compulsory information, (2) a piece of the first image data in a group having the ID number represented by the compulsory information, and (3) a piece of the second image data which has the ID number represented by the compulsory information in cases where the user does not select the button during the term represented by the link information.
10. A method of reproducing image data, comprising the steps of:
a) reproducing first image data;
b) reproducing second image data containing link information providing a link to the first image data; and
c) making a switch from the reproduction of the second image data by the step b) to the reproduction of the first image data by the step a) in response to the link information.
11. A method as recited in claim 10, wherein the link information represents a term for which the link information is effective, and an ID number of the first image data or an ID number of one among groups of pieces of the first image data, and wherein the link information contains button information, and further comprising the steps of enabling a display to indicate a button in accordance with the button information, allowing a user to select the button indicated by the display, and making a switch from the reproduction of the second image data by the step b) to the reproduction of the first image data having the ID number represented by the link information or a piece of the first image data in a group having the ID number represented by the link information in cases where the user selects the button during the term represented by the link information.
12. A method as recited in claim 11, wherein the link information contains compulsory information representing one of (1) an ID number of the first image data, (2) an ID number of one among groups of pieces of the first image data, and (3) an ID number of one among pieces of the second image data, and further comprising the step of making a switch from the reproduction of one among pieces of the second image data by the step b) to reproduction of one of (1) the first image data having the ID number represented by the compulsory information, (2) a piece of the first image data in a group having the ID number represented by the compulsory information, and (3) a piece of the second image data which has the ID number represented by the compulsory information in cases where the user does not select the button during the term represented by the link information.