Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Operations research or analysis
Reexamination Certificate
2003-07-03
2010-12-21
Rines, R. D (Department: 3623)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Operations research or analysis
C370S231000, C370S232000, C370S233000, C370S395400
Reexamination Certificate
active
07856369
ABSTRACT:
A method is provided for generating a feasible schedule for n jobs given a duration and a revisit time for each job. The method comprises determining whether it is impossible to generate a feasible schedule, determining whether a round robin schedule is possible, calculating theoretical probabilities, calculating actual probabilities, creating a potential schedule based on the theoretical probabilities and the actual probabilities, and searching for a feasible schedule from the potential schedule.
REFERENCES:
patent: 6578005 (2003-06-01), Lesaint et al.
patent: 6704692 (2004-03-01), Banerjee et al.
patent: 7043731 (2006-05-01), Ramaswamy
Amotz Bar-Noy et al., “Nearly Optimal Perfectly-Periodic Schedules,” (Nov. 1, 2000).
Michael B. Jones et al., “CPU Reservations and Time Constraints,” ACM (1997).
Chih-wen Hsueh et al., “Distributed Pinwheel Scheduling with End-to-End Timing Constraints,” IEEE (1995).
Mee Yee Chan & Francis YL Chin, “General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction,” IEEE Transactions on Computers, vol. 41, No. 6, p. 755 (Jun. 1992).
Chih-wen Hsueh & Kwei-Jay Lin, “Scheduloing Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model,” IEEE Transactions on Computers, vol. 50, No. 1, p. 51 (Jan. 2001).
Amotz Bar-Noy et al., “Minimizing Service and Operation Costs of Periodic Scheduling,” Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p. 11 (1998).
C.L. Liu & James W. Leyland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,” ACM (1973).
Sanjoy Baruah & Azer Bestavros, “Pinwheel Scheduling for Fault-tolerant Broadcast Disks in Real-time Database Systems,” IEEE (1997).
Eugene A. Feinberg, List of Published Papers (retrieved Jan. 2008).
Curry Michael
Feinberg Eugene
F. Chau & Associates LLC
Research Foundation of the State University of New York
Rines R. D
LandOfFree
Frequency based method for scheduling jobs with hard... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Frequency based method for scheduling jobs with hard..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Frequency based method for scheduling jobs with hard... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4182416