Data transfer request processing scheme for reducing...

Details Data transfer request processing scheme for reducing... Data transfer request processing scheme for reducing...

2006-10-24

2006-10-24

Thomson, William (Department: 2194)

Electrical computers and digital processing systems: virtual mac

Task management or control

Process scheduling

C710S040000, C711S112000, C711S167000

Reexamination Certificate

active

07127714

ABSTRACT:
There are two classes of scheduling policy: a first class in which a completion of data transfer requested by a data transfer request within a deadline for completing the requested data transfer, specified for the request, is a primary key factor in determining an order of processing, and a second class in which a reduction of amounts of mechanical actions of a storage device required in carrying out the data transfer requested by the request is a primary key factor in determining the order of processing. Data transfer requests with respect to the storage device are sequentially accepted. Each data transfer request is classified into the second class while the current time has not yet exceeded a time earlier by a certain time than the deadline. Each data transfer request is classified into the first class after the current time has already exceeded the time.

REFERENCES:
patent: 4325120 (1982-04-01), Colley et al.
patent: 5220653 (1993-06-01), Miro
patent: 5442730 (1995-08-01), Bigus
patent: 5721950 (1998-02-01), Tobagi et al.
patent: 5761417 (1998-06-01), Henley et al.
patent: 5787482 (1998-07-01), Chen et al.
patent: 5826081 (1998-10-01), Zolnowsky
patent: 5974503 (1999-10-01), Venkatesh et al.
patent: 6028843 (2000-02-01), Delp et al.
patent: 6078998 (2000-06-01), Kamel et al.
patent: 6085215 (2000-07-01), Ramakrishnan et al.
patent: 6088734 (2000-07-01), Marin et al.
patent: 6343351 (2002-01-01), Lackman et al.
patent: 6378036 (2002-04-01), Lerman et al.
patent: 6532213 (2003-03-01), Chiussi et al.
patent: 6779182 (2004-08-01), Zolnowsky
patent: 6802064 (2004-10-01), Yao et al.
patent: 0 757 310 (1997-02-01), None
patent: 10-333954 (1996-12-01), None
patent: WO 98/45780 (1998-10-01), None
Reddy “Real-Time Communication Scheduling in a Multicomputer Video Server”, 1999, pp. 425-445.
Shih et al “Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines”, 1993 IEEE, pp. 1171-1179.
Xu et al “Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations”, 1990 IEEE, pp. 360-369.
Chetto et al “Some Results of the Ealiest Deadline Scheduling Algorithm”, 1989 IEEE, pp. 1261-1269.
Ramamritham et al “Distributed Scheduling of Tasks with Deadlines and Resource requirements”, 1989 IEEE, pp. 1110-1123.
Siu-Wah Lau, et al. “Scheduling and Replacement Policies for a Hierarchical Multimedia Storage Server,” Proc. of Multimedia Japan 96, 1996, pp. 68-75.
Tatsuo Mori, et al. “Video-on-Demand System Using Optical Mass Storage System,” Jpn. J. Appl. Physl, vol. 32, Nov. 1993, pp. 5433-5438.
Y. Rompogiannakis, et al., Proceedings of the ACM Multimedia, vol. 6, pp. 297-302, “Disk Scheduling for Mixed-Media Workloads in a Multimedia Server”, 1998.

Affiliated with

Also associated with

Rating

Data transfer request processing scheme for reducing... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data transfer request processing scheme for reducing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data transfer request processing scheme for reducing... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3639420