| 摘要 |
<P>PROBLEM TO BE SOLVED: To implement an I/O task architecture in which a data access request (for example, stripe writing) is decomposed into a plurality of independently schedulable lower-level synchronous I/O tasks. <P>SOLUTION: Resources needed by lower-level I/O tasks are dynamically assigned, as needed, for effective load and resource use balance to thereby achieve high scalability. A hierarchical order is assigned to the I/O tasks to ensure that there is a forward progression of their higher-level I/O task and to ensure that resources do not become deadlocked. <P>COPYRIGHT: (C)2004,JPO |
