| 摘要 |
<P>PROBLEM TO BE SOLVED: To provide an information processor capable of changing the priority in reading out data sequences that is too many in types to have a priority queue preliminary prepared therewith. <P>SOLUTION: An information processor in which a plurality of queues are consisted in a single memory includes, a storage part having a pointer list to store a correspondence relation between a memory region for storing data and each queue, and a priority list to store a sequence number which differs in each data, a pointer for indicating beginning of the queue in the pointer list, a last number which is a sequence number of data having the last priority, and a next number which is a sequence number of data having the next priority, in respect to each of the stored data, after mapping them; and a control part which rewrites the last number and the next number in the priority list based on the change information on priority of the data. <P>COPYRIGHT: (C)2012,JPO&INPIT |
